A comparison of five heuristics for the multiple depot vehicle scheduling problem

DOI10.1007/s10951-008-0072-xzbMath1168.90464OpenAlexW2068123526MaRDI QIDQ835636

Guy Desaulniers, Alain Hertz, Dennis Huisman, Ann-Sophie Pepin

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-008-0072-x

zbMATH Keywords

heuristicscolumn generationtabu searchbranch-and-cutlarge neighborhood searchvehicle schedulingLagrangian heuristicmultiple depot

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Electric bus planning \& scheduling: a review of related problems and methodologies, Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem, The synchronized arc and node routing problem: application to road marking, Heuristics for dynamic and stochastic inventory-routing, The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation, A hybrid method for the probabilistic maximal covering location-allocation problem, Planning of complex supply chains: a performance comparison of three meta-heuristic algorithms, An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem, Solution approaches for integrated vehicle and crew scheduling with electric buses, Scheduling the vehicles of bus rapid transit systems: a case study, Vehicle scheduling based on variable trip times with expected on-time performance, High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows, A school bus scheduling problem, Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price, Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows, A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority, The traveling salesman problem with draft limits, The inventory-routing problem with transshipment, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, Modeling and solving the multimodal car- and ride-sharing problem, Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact algorithm for multiple depot bus scheduling
• Multi-depot vehicle scheduling problems with time windows and waiting costs
• Future paths for integer programming and links to artificial intelligence
• A time-space network based exact optimization model for multi-depot bus scheduling
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Vehicle Scheduling in Public Transit and Lagrangean Pricing
• Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
• Decomposition Principle for Linear Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
• On some matching problems arising in vehicle scheduling models
• A branch and bound algorithm for the multiple depot vehicle scheduling problem
• A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
• Parallel iterative search methods for vehicle routing problems
• Models and Algorithms for Single-Depot Vehicle Scheduling
• A unified tabu search heuristic for vehicle routing problems with time windows
• A Tabu Search Heuristic for the Vehicle Routing Problem