The vehicle-routing problem with delivery and back-haul options
From MaRDI portal
Publication:4883161
Recommendations
Cited in
(19)- AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING
- The traveling salesman problem with delivery and 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
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
- On the exact solution of vehicle routing problems with backhauls
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- A unified heuristic for a large class of vehicle routing problems with backhauls
- The vehicle routing problem with backhauls
- Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
- Self-organizing feature maps for the vehicle routing problem with backhauls
- scientific article; zbMATH DE number 2144502 (Why is no real title available?)
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- The single‐vehicle routing problem with unrestricted backhauls
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)