A Model for Bus Crew Scheduling Problem with Multiple Duty Types

This paper presents an approach for solving the bus crew scheduling problem which considers early, day, and late duty modes with time shift and work intensity constraints. Furthermore, the constraint with the least crew number of a certain duty (e.g., day duty) has also been considered. An optimizat...

Full description

Bibliographic Details
Main Authors: Mingming Chen, Huimin Niu
Format: Article
Language:English
Published: Hindawi Limited 2012-01-01
Series:Discrete Dynamics in Nature and Society
Online Access:http://dx.doi.org/10.1155/2012/649213
id doaj-1931e837e99b4c368aba76cc69d6485a
record_format Article
spelling doaj-1931e837e99b4c368aba76cc69d6485a2020-11-25T00:23:32ZengHindawi LimitedDiscrete Dynamics in Nature and Society1026-02261607-887X2012-01-01201210.1155/2012/649213649213A Model for Bus Crew Scheduling Problem with Multiple Duty TypesMingming Chen0Huimin Niu1School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, ChinaSchool of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, ChinaThis paper presents an approach for solving the bus crew scheduling problem which considers early, day, and late duty modes with time shift and work intensity constraints. Furthermore, the constraint with the least crew number of a certain duty (e.g., day duty) has also been considered. An optimization model is formulated as a 0-1 integer programming problem to improve the efficiency of crew scheduling at the minimum expense of total idle time of crew for a circle bus line. Correspondingly, a heuristic algorithm utilizing the tabu search algorithm has been proposed to solve the model. Finally, the proposed model and algorithm are successfully tested by a case study.http://dx.doi.org/10.1155/2012/649213
collection DOAJ
language English
format Article
sources DOAJ
author Mingming Chen
Huimin Niu
spellingShingle Mingming Chen
Huimin Niu
A Model for Bus Crew Scheduling Problem with Multiple Duty Types
Discrete Dynamics in Nature and Society
author_facet Mingming Chen
Huimin Niu
author_sort Mingming Chen
title A Model for Bus Crew Scheduling Problem with Multiple Duty Types
title_short A Model for Bus Crew Scheduling Problem with Multiple Duty Types
title_full A Model for Bus Crew Scheduling Problem with Multiple Duty Types
title_fullStr A Model for Bus Crew Scheduling Problem with Multiple Duty Types
title_full_unstemmed A Model for Bus Crew Scheduling Problem with Multiple Duty Types
title_sort model for bus crew scheduling problem with multiple duty types
publisher Hindawi Limited
series Discrete Dynamics in Nature and Society
issn 1026-0226
1607-887X
publishDate 2012-01-01
description This paper presents an approach for solving the bus crew scheduling problem which considers early, day, and late duty modes with time shift and work intensity constraints. Furthermore, the constraint with the least crew number of a certain duty (e.g., day duty) has also been considered. An optimization model is formulated as a 0-1 integer programming problem to improve the efficiency of crew scheduling at the minimum expense of total idle time of crew for a circle bus line. Correspondingly, a heuristic algorithm utilizing the tabu search algorithm has been proposed to solve the model. Finally, the proposed model and algorithm are successfully tested by a case study.
url http://dx.doi.org/10.1155/2012/649213
work_keys_str_mv AT mingmingchen amodelforbuscrewschedulingproblemwithmultipledutytypes
AT huiminniu amodelforbuscrewschedulingproblemwithmultipledutytypes
AT mingmingchen modelforbuscrewschedulingproblemwithmultipledutytypes
AT huiminniu modelforbuscrewschedulingproblemwithmultipledutytypes
_version_ 1725356613511938048