Multi-depot vehicle routing problem with time windows under shared depot resources

DOI10.1007/s10878-014-9767-4zbMath1338.90056OpenAlexW2056479729MaRDI QIDQ5963636

No author found.

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

zbMATH Keywords

time windowsadaptive local searchhybrid genetic algorithmmulti-depot vehicle routing problem

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (7)

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 ⋮ Crowdsourced humanitarian relief vehicle routing problem ⋮ A general VNS for the multi-depot open vehicle routing problem with time windows ⋮ A lower bound for the adaptive two-echelon capacitated vehicle routing problem ⋮ 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

Uses Software

• MDVRPTW
• METSlib

Cites Work

• Unnamed Item
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• A general heuristic for vehicle routing problems
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• 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
• 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
• A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
• A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics
• 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
• Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
• The open vehicle routing problem with time windows
• New measures of proximity for the assignment algorithms in the MDVRPTW
• Recent progress of local search in handling the time window constraints of the vehicle routing problem

This page was built for publication: Multi-depot vehicle routing problem with time windows under shared depot resources