GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery

DOI10.1016/j.endm.2012.10.029zbMath1268.90138OpenAlexW2004869061MaRDI QIDQ2840778

Marcone Jamilson Freitas Souza, R. C. Cruz, M. T. Mine, T. C. B. Silva, Alexandre Xavier Martins, Vitor N. Coelho

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

zbMATH Keywords

tabu searchvariable neighborhood searchvariable neighborhood descentvehicle routing problem with simultaneous pickup and delivery

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

A review of vehicle routing with simultaneous pickup and delivery

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• Variable neighbourhood search: Methods and applications
• An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
• Probability distribution of solution time in GRASP: an experimental investigation
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• 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

This page was built for publication: GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery