A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem
Annals of Operations Research, ISSN: 1572-9338, Vol: 316, Issue: 2, Page: 979-1011
2022
- 3Citations
- 11Captures
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Article Description
This article addresses the one-commodity pickup and delivery traveling salesman problem (1-PDTSP), which is a generalization of the well-known traveling salesman problem. The 1-PDTSP aims to find a Hamiltonian tour in which a set of supply points (pickup locations), demand points (delivery locations) are visited and, the total traveled distance is minimized. We propose a hybrid metaheuristic based on multi-start evolutionary local search and variable neighborhood descent to solve the 1-PDTSP. To test the performance of our algorithm, we solve instances with up to 500 nodes available in the literature and we demonstrate that our approach is able to provide competitive results when comparing to other existing strategies. Since a direct application of the 1-PDTSP arises as the bicycle repositioning problem, we also use our metaheuristic algorithm to solve a set of real-case instances based on EnCicla, the bicycle sharing system in the Aburrá Valley (Antioquia, Colombia).
Bibliographic Details
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know