Solving a bus driver scheduling problem with randomized multistart heuristics

DOI10.1111/j.1475-3995.2011.00827.xzbMath1267.90058MaRDI QIDQ4918247

Emilia Marchitto, Renato De Leone, Paola Festa

Publication date: 24 April 2013

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2011.00827.x

zbMATH Keywords

transportation; GRASP; variable neighborhood search; hybrid heuristics; path-relinking; Crew and Bus Driver Scheduling Problem

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B36: Stochastic scheduling theory in operations research

Related Items

A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department, A nonmonotone GRASP, A matheuristic for the driver scheduling problem with staff cars, Hybridizations of GRASP with path relinking for the far from most string problem

Uses Software

• GRASP
• GAMS
• MCF

Cites Work

• A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution
• A probabilistic heuristic for a computationally difficult set covering problem
• Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
• Vehicle Scheduling in Public Transit and Lagrangean Pricing
• An annotated bibliography of GRASP-Part II: Applications
• An annotated bibliography of GRASP – Part I: Algorithms
• The Fixed Job Schedule Problem with Spread-Time Constraints
• The Fixed Job Schedule Problem with Working-Time Constraints
• Randomized heuristics for the Max-Cut problem
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Genetic algorithms for the bus driver scheduling problem: a case study
• Variable neighborhood search: Principles and applications