Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem
DOI10.1007/S11590-015-0944-XzbMATH Open1354.90050OpenAlexW1693260925MaRDI QIDQ331982FDOQ331982
Authors: Pablo Cristini Guedes, William Prigol Lopes, Leonardo Rosa Rohde, Denis Borenstein 
Publication date: 27 October 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: http://dspace.ucuenca.edu.ec/handle/123456789/29158
Recommendations
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
- Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- Application oriented variable fixing methods for the multiple depot vehicle scheduling problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Selected Topics in Column Generation
- Title not available (Why is that?)
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
- Algorithms and codes for dense assignment problems: The state of the art
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
- A time-space network based exact optimization model for multi-depot bus scheduling
- Vehicle scheduling in public transit and Lagrangean pricing
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- On some matching problems arising in vehicle scheduling models
- A quasi-assignment algorithm for bus scheduling
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
Cited In (9)
- Title not available (Why is that?)
- Scheduling the vehicles of bus rapid transit systems: a case study
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
- Application oriented variable fixing methods for the multiple depot vehicle scheduling problem
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
- Modeling and solving the multimodal car- and ride-sharing problem
- Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows
Uses Software
This page was built for publication: Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331982)
