Citation
An Evolutionary Algorithm for the large Size One-Commodity Pickup and Delivery Travelling Salesman Problems. In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA, pages 127-136, 2011.
Paper
Abstract
In this paper we present an evolutionary algorithm (EA) for the one-commodity pickup and delivery travelling salesman problem (1-PDTSP). This EA is a hybrid steady-state algorithm that uses truncation selection, uses only mutation for the generation of the descendants and it improves the solutions with three local search procedures. The mutation is based on “the EVL method”, that is a memory-based method. The algorithm was tested on large size benchmark problems; the quality of the results is good, the algorithm outperforms the previous heuristics in 84% of the large size test cases.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2011-127-136-P, author = {I. Borgulya},
title = {An Evolutionary Algorithm for the large Size One-Commodity Pickup and Delivery Travelling Salesman Problems},
booktitle = {In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA},
year = {2011},
editor = {J. Fowler and G. Kendall and B. McCollum},
pages = {127--136},
note = {Paper},
abstract = {In this paper we present an evolutionary algorithm (EA) for the one-commodity pickup and delivery travelling salesman problem (1-PDTSP). This EA is a hybrid steady-state algorithm that uses truncation selection, uses only mutation for the generation of the descendants and it improves the solutions with three local search procedures. The mutation is based on “the EVL method”, that is a memory-based method. The algorithm was tested on large size benchmark problems; the quality of the results is good, the algorithm outperforms the previous heuristics in 84% of the large size test cases.},
owner = {gxk},
timestamp = {2011.08.15},
webpdf = {2011-127-136-P.pdf} }