GENVNS-TS-CL-PR: a heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery
DOI10.1016/J.ENDM.2012.10.029zbMATH Open1268.90138OpenAlexW2004869061MaRDI QIDQ2840778FDOQ2840778
Authors: R. C. Cruz, T. C. B. Silva, M. J. F. Souza, M. T. Mine, V. N. Coelho, Alexandre X. Martins 
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.repositorio.ufop.br/handle/123456789/4280
Recommendations
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery
- A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
tabu searchvariable neighborhood searchvariable neighborhood descentvehicle routing problem with simultaneous pickup and delivery
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Variable neighbourhood search: Methods and applications
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Probability distribution of solution time in GRASP: an experimental investigation
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
Cited In (4)
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- A review of vehicle routing with simultaneous pickup and delivery
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A hybrid heuristic based on general variable neighborhood search for the single vehicle routing problem with deliveries and selective pickups
Uses Software
This page was built for publication: GENVNS-TS-CL-PR: a heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840778)
