tailieunhanh - Heuristic constructive algorithm for work-shift scheduling in bus rapid transit systems

This paper proposes a two-phase heuristic algorithm to solve the crew scheduling problem of the Megabus Bus Rapid Transit System. | Heuristic constructive algorithm for work-shift scheduling in bus rapid transit systems Decision Science Letters 8 2019 519 530 Contents lists available at GrowingScience Decision Science Letters homepage dsl Heuristic constructive algorithm for work-shift scheduling in bus rapid transit systems César Augusto Marín Morenoa Luis Miguel Escobar Falcónb John Willmer Escobarc Antonio Hernando Escobar Zuluagaa and Mauricio Granada Echeverria aFaculty of Engineering Universidad Tecnologíca de Pereira Colombia bDepartment of Systems Engineering Universidad Libre Pereira Colombia cDepartment of Accounting and Finance Universidad del Valle Colombia CHRONICLE ABSTRACT Article history This paper proposes a two-phase heuristic algorithm to solve the crew scheduling problem of the Received March 12 2019 Megabus Bus Rapid Transit System. In the first stage a division of the original schedules is Received in revised format performed using a recursive algorithm based on dynamic scheduling. In the second stage work- March 29 2019 shift construction based on graph theory is performed using a pairing algorithm . matching . Accepted April 10 2019 Available online The method is validated by applying it to the mass transit system of the Central Western April 10 2019 Metropolitan Area AMCO operated by Integra SA which serves 11 routes for a daily total of Keywords 2899 trips. Crew Scheduling Problem Heuristic Techniques Massive Public Transport 2018 by the authors licensee Growing Science Canada. 1. Introduction The crew scheduling problem CSP or driver scheduling problem DSP is part of the operational planning of public transport systems and refers to the daily tasks assigned to the drivers required to cover a set of trips assigned to a set of vehicles . the vehicle scheduling problem VSP . That is given a set of trips within a fixed period the problem is to generate the schedule of feasible work shifts including start and end times and various types of .