Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
From MaRDI portal
Publication:3134567
DOI10.1287/mnsc.39.1.115zbMath0795.90015OpenAlexW2091972153MaRDI QIDQ3134567
Mauro Dell'Amico, Paolo Toth, Matteo Fischetti
Publication date: 15 September 1993
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.39.1.115
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A comparison of five heuristics for the multiple depot vehicle scheduling problem, Electric bus planning \& scheduling: a review of related problems and methodologies, A decision support system for the single-depot vehicle rescheduling problem, Simulation-based optimization for housekeeping in a container transshipment terminal, Routing problems: A bibliography, Multi-objective temporal bin packing problem: an application in cloud computing, Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network, A time-space network based exact optimization model for multi-depot bus scheduling, Parallel Auction Algorithm for Bus Rescheduling, Algorithms and codes for dense assignment problems: The state of the art, Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows, Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies, Multi-depot vehicle scheduling problems with time windows and waiting costs, Survey of research in the design and control of automated guided vehicle systems, A new ILP-based refinement heuristic for vehicle routing problems
