A genetic algorithm for symmetric travelling salesman problem eith due dates
A new symmetric version of the time constrained traveling salesman problem is introduced, where cities to be visited have due dates. The objective is to find an ordering of the cities that starts and ends at the depot which minimises the maximum lateness, and the total tour length of the cities. A...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2007
|
| Subjects: |