Multi-depot vehicle routing problem with time windows under shared depot resources
DOI10.1007/S10878-014-9767-4zbMATH Open1338.90056OpenAlexW2056479729MaRDI QIDQ5963636FDOQ5963636
Jian Li, Yang Li, Panos M. Pardalos
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9767-4
Recommendations
- Multi-depot time dependent vehicle routing problem with heterogeneous fleet and time windows
- A new variable neighborhood search algorithm for the multi depot heterogeneous vehicle routing problem with time windows
- A hybrid genetic algorithm for the multi-depot open vehicle routing problem
- Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
- The multi-depot vehicle routing problem with inter-depot routes
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)
Cites Work
- New measures of proximity for the assignment algorithms in the MDVRPTW
- Title not available (Why is that?)
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A reactive variable neighborhood search for the vehicle-routing problem with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- A unified tabu search heuristic for vehicle routing problems with time windows
- The open vehicle routing problem with time windows
- A general heuristic for vehicle routing problems
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows
Cited In (10)
- Multi-depot time dependent vehicle routing problem with heterogeneous fleet and time windows
- A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction
- Logic-based benders decomposition for an inter-modal transportation problem
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem
- A general VNS for the multi-depot open vehicle routing problem with time windows
- Application of multiagent technologies to multiple depot vehicle routing problem with time windows
- The multi-depot vehicle routing problem with inter-depot routes
- Crowdsourced humanitarian relief vehicle routing problem
- Approximation schemes for Euclidean vehicle routing problems with time windows
- Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance
Uses Software
This page was built for publication: Multi-depot vehicle routing problem with time windows under shared depot resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963636)