Solving a bus driver scheduling problem with randomized multistart heuristics
type: Item
instance of: scholarly article
title: Solving a bus driver scheduling problem with randomized multistart heuristics
zbMATH Open document ID: 1267.90058
author: Renato De Leone
author: Emilia Marchitto
author: Paola Festa
published in: International Transactions in Operational Research
publication date: 2013-04-24T00:00:00Z
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6156974
zbMATH Keywords: Crew and Bus Driver Scheduling Problem
zbMATH Keywords: transportation
zbMATH Keywords: path-relinking
zbMATH Keywords: GRASP
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: hybrid heuristics
describes a project that uses: GAMS
describes a project that uses: MCF
describes a project that uses: GRASP
MaRDI profile type: Publication
full work available at URL: j.1475-3995.2011.00827.x
OpenAlex ID: W2014426306
cites work: A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution
cites work: Genetic algorithms for the bus driver scheduling problem: a case study
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: An annotated bibliography of GRASP – Part I: Algorithms
cites work: An annotated bibliography of GRASP-Part II: Applications
cites work: Randomized heuristics for the Max-Cut problem
cites work: The Fixed Job Schedule Problem with Spread-Time Constraints
cites work: The Fixed Job Schedule Problem with Working-Time Constraints
cites work: Variable neighborhood search: Principles and applications
cites work: Vehicle scheduling in public transit and Lagrangean pricing
cites work: Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
cites work: Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
DOI: 10.1111/J.1475-3995.2011.00827.X
description: scientific article; zbMATH DE number 6156974