Lee, Lai Soon and Potts, Christopher N. and Bennell, Julia A. (2007) A Genetic Algorithm for Symmetric Travelling Salesman Problem With Due Dates. In: 22nd European Conference on Operational Research, July 8 – 11, 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.
|Item Type:||Conference or Workshop Item (Paper)|
|Keyword:||symmetric, time constrained traveling salesman problem, due dates, genetic algorithms, local search methods|
|Subject:||Genetics - Mathematical models|
|Faculty or Institute:||Institute for Mathematical Research|
|Deposited By:||Erni Suraya Abdul Aziz|
|Deposited On:||23 Dec 2010 09:07|
|Last Modified:||23 Dec 2010 09:10|
Repository Staff Only: Edit item detail
Document Download Statistics
This item has been downloaded for since 23 Dec 2010 09:07.