scientific article; zbMATH DE number 1361557
zbMATH Open0948.90019MaRDI QIDQ4699378FDOQ4699378
Authors: Andreas Löbel 
Publication date: 27 November 2000
Title of this publication is not available (Why is that?)
Recommendations
- Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
- Multi-depot vehicle scheduling problems with time windows and waiting costs
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- Publication:4889093
integer linear programmingmulticommodity flow\({\mathcal N}{\mathcal P}\)-hard multiple-depot vehicle scheduling problembranch-and cutLagrangean pricing
Large-scale problems in mathematical programming (90C06) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)
Cited In (18)
- Scheduling of road vehicles in sugarcane transport: a case study at an Australian sugar mill
- A time-space network based exact optimization model for multi-depot bus scheduling
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
- A bundle method for integrated multi-depot vehicle and duty scheduling in public transit
- Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
- Optimal Trip Assignment To Depots In A Large Inter-City Bus System
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- List-graph colouring for multiple depot vehicle scheduling
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
- A rolling horizon heuristic with optimality guarantee for an on-demand vehicle scheduling problem
- A set partitioning approach to shunting
- A set partitioning approach to shunting
- Application oriented variable fixing methods for the multiple depot vehicle scheduling problem
- Online-Optimization of Large-Scale Vehicle Dispatching Problems
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Decision Support System for the Multi-depot Vehicle Routing Problem
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4699378)
