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: | |
| Online Access: | http://psasir.upm.edu.my/id/eprint/8896/ |
| _version_ | 1848840999329071104 |
|---|---|
| author | Lee, Lai Soon Potts, Christopher N. Bennell, Julia A. |
| author_facet | Lee, Lai Soon Potts, Christopher N. Bennell, Julia A. |
| author_sort | Lee, Lai Soon |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T07:36:16Z |
| format | Conference or Workshop Item |
| id | upm-8896 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-15T07:36:16Z |
| publishDate | 2007 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-88962015-01-21T08:32:54Z http://psasir.upm.edu.my/id/eprint/8896/ A genetic algorithm for symmetric travelling salesman problem eith due dates Lee, Lai Soon Potts, Christopher N. Bennell, Julia A. 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. 2007-07-08 Conference or Workshop Item NonPeerReviewed 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. . Symmetry Genetics - Mathematical models |
| spellingShingle | Symmetry Genetics - Mathematical models Lee, Lai Soon Potts, Christopher N. Bennell, Julia A. A genetic algorithm for symmetric travelling salesman problem eith due dates |
| title | A genetic algorithm for symmetric travelling salesman problem eith due dates |
| title_full | A genetic algorithm for symmetric travelling salesman problem eith due dates |
| title_fullStr | A genetic algorithm for symmetric travelling salesman problem eith due dates |
| title_full_unstemmed | A genetic algorithm for symmetric travelling salesman problem eith due dates |
| title_short | A genetic algorithm for symmetric travelling salesman problem eith due dates |
| title_sort | genetic algorithm for symmetric travelling salesman problem eith due dates |
| topic | Symmetry Genetics - Mathematical models |
| url | http://psasir.upm.edu.my/id/eprint/8896/ |