AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING

DOI10.1142/S0217595905000522zbMath1078.90018OpenAlexW2143208611MaRDI QIDQ5315981

No author found.

Publication date: 12 September 2005

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595905000522

zbMATH Keywords

mixed integer programmingheuristicVehicle routingbackhauling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (5)

A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ Vehicle routing problems with split deliveries ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads ⋮ Shipper collaboration in forward and reverse logistics

Cites Work

• Unnamed Item
• An algorithm for the traveling salesman problem with pickup and delivery customers
• The vehicle routing problem with backhauls
• A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
• Quantitative models for reverse logistics: A review
• Heuristic approaches to vehicle routing with backhauls and time windows
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up

This page was built for publication: AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING