A branch and bound algorithm for the multiple depot vehicle scheduling problem

DOI10.1002/net.3230190505zbMath0672.90073OpenAlexW2023589711MaRDI QIDQ3826353

Giorgio Carpaneto, Matteo Fischetti, Mauro Dell'Amico, Paolo Toth

Publication date: 1989

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230190505

zbMATH Keywords

branch and boundlower boundsvehicle schedulingComputational resultsconnectivity constraintsNP-hard multiple depot casestrong dominance procedure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (33)

A comparison of five heuristics for the multiple depot vehicle scheduling problem ⋮ Electric bus planning \& scheduling: a review of related problems and methodologies ⋮ TSP race: minimizing completion time in time-sensitive applications ⋮ Solving a real-world train-unit assignment problem ⋮ Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem ⋮ A decision support system for the single-depot vehicle rescheduling problem ⋮ Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation ⋮ Simulation-based optimization for housekeeping in a container transshipment terminal ⋮ The vehicle rescheduling problem with retiming ⋮ An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem ⋮ A note to independent sets in scheduling ⋮ Discrete optimization in public rail transport ⋮ An exact algorithm for the capacitated shortest spanning arborescence ⋮ Routing problems: A bibliography ⋮ Solution approaches for integrated vehicle and crew scheduling with electric buses ⋮ Scheduling the vehicles of bus rapid transit systems: a case study ⋮ Public transport for smart cities: recent innovations and future challenges ⋮ Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network ⋮ Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems ⋮ A time-space network based exact optimization model for multi-depot bus scheduling ⋮ Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem ⋮ Parallel Auction Algorithm for Bus Rescheduling ⋮ An additive bounding procedure for the asymmetric travelling salesman problem ⋮ Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows ⋮ Stabilized dynamic constraint aggregation for solving set partitioning problems ⋮ Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem ⋮ Multi-depot vehicle scheduling problems with time windows and waiting costs ⋮ Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows ⋮ On the choice of explicit stabilizing terms in column generation ⋮ New lower bounds for the symmetric travelling salesman problem ⋮ A proximal trust-region algorithm for column generation stabilization ⋮ An exact approach for the multi-depot electric bus scheduling problem with time windows ⋮ An exact algorithm for multiple depot bus scheduling

This page was built for publication: A branch and bound algorithm for the multiple depot vehicle scheduling problem