A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- 1 July 2012
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 220 (1), 270-285
- https://doi.org/10.1016/j.ejor.2012.01.036
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- Variable neighbourhood search: methods and applicationsAnnals of Operations Research, 2009
- Attraction probabilities in variable neighborhood search4OR, 2009
- Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problemComputers & Industrial Engineering, 2009
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithmsNetworks, 2007
- First vs. best improvement: An empirical studyDiscrete Applied Mathematics, 2006
- Sequential search and its application to vehicle-routing problemsComputers & Operations Research, 2005
- A branch-and-cut algorithm for a traveling salesman problem with pickup and deliveryDiscrete Applied Mathematics, 2004
- Heuristics for the traveling salesman problem with pickup and deliveryComputers & Operations Research, 1999
- Routing a vehicle of capacity greater than oneDiscrete Applied Mathematics, 1998
- Variable neighborhood searchComputers & Operations Research, 1997