Variable neighborhood search algorithms for pickup and delivery problems with loading constraints

DOI10.1016/J.ENDM.2017.03.015zbMath1387.90224OpenAlexW2605973318MaRDI QIDQ1687656

Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho

Publication date: 4 January 2018

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

zbMATH Keywords

variable neighborhood searchroutingloading constraintsbackhauls

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls

Cites Work

• Unnamed Item
• Variable neighborhood search
• Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints

This page was built for publication: Variable neighborhood search algorithms for pickup and delivery problems with loading constraints