Cover Image

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Lee, Lai Soon, Potts, Christopher N., Bennell, Julia A.
Format: Conference or Workshop Item
Published: 2007
Online Access:http://psasir.upm.edu.my/id/eprint/8896/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.8896
record_format eprints
spelling my.upm.eprints.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. .
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
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.
format Conference or Workshop Item
author Lee, Lai Soon
Potts, Christopher N.
Bennell, Julia A.
spellingShingle Lee, Lai Soon
Potts, Christopher N.
Bennell, Julia A.
A genetic algorithm for symmetric travelling salesman problem eith due dates
author_facet Lee, Lai Soon
Potts, Christopher N.
Bennell, Julia A.
author_sort Lee, Lai Soon
title 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_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_sort genetic algorithm for symmetric travelling salesman problem eith due dates
publishDate 2007
url http://psasir.upm.edu.my/id/eprint/8896/
_version_ 1643824153225068544
score 13.209306

Similar Items