Citation
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. .
Abstract
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.
Download File
Full text not available from this repository.
|
Additional Metadata
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subject: | Symmetry |
| Subject: | Genetics - Mathematical models |
| Divisions: | Institute for Mathematical Research |
| Keywords: | Symmetric; Time constrained traveling salesman problem; Due dates; Genetic algorithms; Local search methods |
| Depositing User: | Erni Suraya Abdul Aziz |
| Date Deposited: | 23 Dec 2010 09:07 |
| Last Modified: | 21 Jan 2015 08:32 |
| URI: | http://psasir.upm.edu.my/id/eprint/8896 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |