Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem

DOI10.1007/S11590-015-0944-XMaRDI QIDQ331982zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

heuristicscolumn generationmulti-depotsvehicle scheduling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
• A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
• A branch and bound algorithm for the multiple depot vehicle scheduling problem
• A comparison of five heuristics for the multiple depot vehicle scheduling problem
• A quasi-assignment algorithm for bus scheduling
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• A time-space network based exact optimization model for multi-depot bus scheduling
• Algorithms and codes for dense assignment problems: The state of the art
• On some matching problems arising in vehicle scheduling models
• Selected Topics in Column Generation
• Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
• Vehicle scheduling in public transit and Lagrangean pricing

Cited in

(9)

• scientific article; zbMATH DE number 1361557 (Why is no real title available?)
• 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
• A comparison of five heuristics for the multiple depot vehicle scheduling problem
• Application oriented variable fixing methods 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

Describes a project that uses

Uses Software

• MCF

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)