@inproceedings{876fa126b2c94f82b2e2b331ae7a676b,
title = "LCS-based selective route exchange crossover for the pickup and delivery problem with time windows",
abstract = "The pickup and delivery problem with time windows (PDPTW) is an NP-hard discrete optimization problem of serving transportation requests using a fleet of homogeneous trucks. Its main objective is to minimize the number of vehicles, and the secondary objective is to minimize the distance traveled during the service. In this paper, we propose the longest common subsequence based selective route exchange crossover (LCS-SREX), and apply this operator in the memetic algorithm (MA) for the PDPTW. Also, we suggest the new solution representation which helps handle the crossover efficiently. Extensive experimental study performed on the benchmark set showed that using LCS-SREX leads to very high-quality feasible solutions. The analysis is backed with the statistical tests to verify the importance of the elaborated results. Finally, we report one new world{\textquoteright}s best routing schedule found using a parallel version of the MA exploiting LCS-SREX.",
keywords = "Crossover, LCS, Memetic algorithm, PDPTW",
author = "Miroslaw Blocho and Jakub Nalepa",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 17th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2017 ; Conference date: 19-04-2017 Through 21-04-2017",
year = "2017",
doi = "10.1007/978-3-319-55453-2\_9",
language = "English",
isbn = "9783319554525",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "124--140",
editor = "Bin Hu and Manuel Lopez-Ibanez",
booktitle = "Evolutionary Computation in Combinatorial Optimization -17th European Conference, EvoCOP 2017, Proceedings",
address = "Germany",
}