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

DOI10.1007/S11590-015-0944-XzbMath1354.90050OpenAlexW1693260925MaRDI QIDQ331982

Pablo Cristini Guedes, William Prigol Lopes, Denis Borenstein, Leonardo Rosa Rohde

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

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

Related Items (3)

Scheduling the vehicles of bus rapid transit systems: a case study ⋮ Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows ⋮ Modeling and solving the multimodal car- and ride-sharing problem

Uses Software

• MCF

Cites Work

• Unnamed Item
• A comparison of five heuristics for the multiple depot vehicle scheduling problem
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• 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 branch and bound algorithm for the multiple depot vehicle scheduling problem
• A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
• Selected Topics in Column Generation

This page was built for publication: Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem