A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- 31 May 2009
- journal article
- research article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 36 (5), 1639-1645
- https://doi.org/10.1016/j.cor.2008.03.008
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Rejoinder on: Static pickup and delivery problems: a classification scheme and surveyTOP, 2007
- The one‐commodity pickup and delivery travelling salesman problem on a path or a treeNetworks, 2006
- Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman ProblemTransportation Science, 2004
- A branch-and-cut algorithm for a traveling salesman problem with pickup and deliveryDiscrete Applied Mathematics, 2004
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveriesNaval Research Logistics (NRL), 1999
- Approximating Capacitated Routing and Delivery ProblemsSIAM Journal on Computing, 1999
- Variable neighborhood searchComputers & Operations Research, 1997
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- The General Pickup and Delivery ProblemTransportation Science, 1995
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965