The vehicle-routing problem with delivery and back-haul options

DOI10.1002/(SICI)1520-6750(199604)43:3%3C415::AID-NAV7%3E3.0.CO;2-CzbMATH Open0846.90035OpenAlexW2033287538MaRDI QIDQ4883161FDOQ4883161

Authors: Shoshana Anily 

Publication date: 3 October 1996

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199604)43:3%3C415::aid-nav7%3E3.0.co;2-c

Recommendations

• scientific article; zbMATH DE number 1057930
• The traveling salesman problem with delivery and backhauls
• AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING

zbMATH Keywords

heuristiclower boundvehicle-routingoptimal total costfleet of identical capacitated vehiclesroutes of minimum total length

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cited In (19)

• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• Title not available (Why is that?)
• AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING
• The traveling salesman problem with delivery and backhauls
• Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
• A unified heuristic for a large class of vehicle routing problems with backhauls
• A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
• The vehicle routing problem with backhauls
• Self-organizing feature maps for the vehicle routing problem with backhauls
• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
• Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
• CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
• On the exact solution of vehicle routing problems with backhauls
• A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
• The single‐vehicle routing problem with unrestricted backhauls
• A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
• An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
• Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)

This page was built for publication: The vehicle-routing problem with delivery and back-haul options

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883161)