A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups

DOI10.1016/j.endm.2012.10.014zbMath1268.90135OpenAlexW2062737218MaRDI QIDQ2840759

Luiz Satoru Ochi, Marcone Jamilson Freitas Souza, Matheus Nohra Haddad, Pablo Luiz Araújo Munhoz, Igor M. Coelho

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.014

zbMATH Keywords

hybrid metaheuristicsgeneral variable neighborhood searchsingle vehicle routing problem with deliveries and selective pickups

Mathematics Subject Classification ID

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

Related Items (1)

A guide-and-observe hyper-heuristic approach to the Eternity II puzzle

Cites Work

• Variable neighbourhood search: methods and applications
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• Variable neighbourhood search: Methods and applications
• The single vehicle routing problem with deliveries and selective pickups
• The single‐vehicle routing problem with unrestricted backhauls

This page was built for publication: A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups