A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
Authors:
- Fermín Alfredo Tang MontanéFMFermín Alfredo Tang Montané
- Roberto Diéguez GalvãoRGRoberto Diéguez Galvão
- 1 March 2006
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 33 (3) , 595-619
Abstract
No abstract availableThis publication has 27 references indexed in Scilit:
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveriesEuropean Journal of Operational Research, 2005
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhaulingJournal of the Operational Research Society, 1999
- Heuristics for the traveling salesman problem with pickup and deliveryComputers & Operations Research, 1999
- Vehicle routing with pick-up and delivery: tour-partitioning heuristicsComputers & Industrial Engineering, 1998
- The Traveling Salesman Problem with BackhaulsComputers & Operations Research, 1996
- A new branching strategy for time constrained routing problems with application to backhaulingAnnals of Operations Research, 1995
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- The control of helicopter operations in the Brazilian oil industry: Issues in the design and implementation of a computerized systemEuropean Journal of Operational Research, 1990
- A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windowsTransportation Research Part B: Methodological, 1986
- Route first—Cluster second methods for vehicle routingOmega, 1983