A genetic algorithm for symmetric travelling salesman problem eith due dates
Lee, Lai Soon and Potts, Christopher N. and Bennell, Julia A. (2007) A genetic algorithm for symmetric travelling salesman problem eith due dates. In: 22nd European Conference on Operational Research, 8–11 July 2007, Prague, Czech Republic.
Full text not available from this repository.
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 genetic algorithm (GA) which utilizes the multicrossover operator is developed. We introduce a subtour based crossover where the constraint on sharing the common subtours in both parents is relaxed. Computational results of the proposed GA compared to other local search methods are presented.
Repository Staff Only: Edit item detail