Single vehicle routing with a predefined customer sequence and multiple depot returns
From MaRDI portal
Publication:2463499
DOI10.1016/j.ejor.2007.03.017zbMath1149.90024MaRDI QIDQ2463499
Ioannis Minis, A. Tatarakis, Epaminondas G. Kyriakidis, P. Tsirimpas
Publication date: 12 December 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.03.017
dynamic programming; logistics; routing with multiple-product delivery; routing with pick up and delivery
90B06: Transportation, logistics and supply chain management
90B30: Production models
90C39: Dynamic programming
Related Items
A near-optimal database allocation for reducing the average waiting time in the grid computing environment, Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
- The vehicle routing problem: An overview of exact and approximate algorithms
- Hybrid metaheuristics for the vehicle routing problem with stochastic demands
- The Vehicle Routing Problem
- Stochastic Vehicle Routing Problem with Restocking
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- The vehicle routing problem with pickups and deliveries on some special graphs