scholarly journals A New Approach to Crew Scheduling in Rapid Transit Networks

2015 ◽  
Vol 10 ◽  
pp. 554-563 ◽  
Author(s):  
Manuel Fuentes ◽  
Luis Cadarso ◽  
Ángel Marín
Keyword(s):  
Crew Scheduling ◽  
Rapid Transit ◽  
New Approach ◽  
Transit Networks

scholarly journals Population-based simulation optimization for urban mass rapid transit networks

2019 ◽  
Vol 32 (4) ◽  
pp. 767-805 ◽  
Author(s):  
David Schmaranzer ◽  
Roland Braune ◽  
Karl F. Doerner
Keyword(s):  
Discrete Event ◽  
Service Level ◽  
Population Based ◽  
Rapid Transit ◽  
Real World Data ◽  
Transit Networks ◽  
Event Simulation ◽  
Covariance Matrix Adaptation ◽  
Turning Maneuver ◽  
Mass Rapid Transit

AbstractIn this paper, we present a simulation-based headway optimization for urban mass rapid transit networks. The underlying discrete event simulation model contains several stochastic elements, including time-dependent demand and turning maneuver times as well as direction-dependent vehicle travel and passenger transfer times. Passenger creation is a Poisson process that uses hourly origin–destination-matrices based on anonymous mobile phone and infrared count data. The numbers of passengers on platforms and within vehicles are subject to capacity restrictions. As a microscopic element, passenger distribution along platforms and within vehicles is considered. The bi-objective problem, involving cost reduction and service level improvement, is transformed into a single-objective optimization problem by normalization and scalarization. Population-based evolutionary algorithms and different solution encoding variants are applied. Computational experience is gained from test instances based on real-world data (i.e., the Viennese subway network). A covariance matrix adaptation evolution strategy performs best in most cases, and a newly developed encoding helps accelerate the optimization process by producing better short-term results.

scholarly journals Planning rapid transit networks

2011 ◽  
Vol 45 (3) ◽  
pp. 95-104 ◽  
Author(s):  
G. Laporte ◽  
J.A. Mesa ◽  
F.A. Ortega ◽  
F. Perea
Keyword(s):  
Rapid Transit ◽  
Transit Networks

scholarly journals Designing robust rapid transit networks with alternative routes

2011 ◽  
Vol 45 (1) ◽  
pp. 54-65 ◽  
Author(s):  
Gilbert Laporte ◽  
Angel Marín ◽  
Juan A. Mesa ◽  
Federico Perea
Keyword(s):  
Rapid Transit ◽  
Transit Networks ◽  
Alternative Routes

scholarly journals Uso da técnica de busca em vizinhança de grande porte para a programação da escala de motoristas de ônibus urbano

TRANSPORTES ◽  
2010 ◽  
Vol 18 (2) ◽  
Author(s):  
Gustavo Peixoto Silva ◽  
Claudio Barbieri da Cunha
Keyword(s):  
Local Search ◽  
Large Scale ◽  
Crew Scheduling ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Search Technique ◽  
New Approach ◽  
Proposed Model ◽  
Belo Horizonte ◽  
The City

<p><strong>Resumo:</strong> Este artigo apresenta uma nova abordagem para a resolução do Problema de Programação de Tripulações no Sistema de Transporte Público (PPT). O modelo se baseia na metaheurística GRASP cuja busca local é realizada pelo método da Busca em Vizinhança de Grande Porte, conhecida na literatura como Very Large-Scale Neighborhood Search. O grande diferencial da aplicação desta técnica de busca para o PPT é que, além de incorporar os movimentos de realocação e troca de tarefas, realizados tradicionalmente, ela também permite considerar trocas do tipo 3-optimal, 4-optimal, até o limite de n-optimal, para uma solução com n tripulações. A implementação da heurística proposta foi testada com dados de problemas reais de uma empresa que opera em Belo Horizonte, e os resultados foram comparados com as soluções adotadas pela empresa. Desta forma foi possível observar que o modelo apresentado neste trabalho produziu soluções mais econômicas do que aquelas praticadas pela empresa.</p><strong>Abstract:</strong> This paper presents a new approach to solve the Crew Scheduling Problem (CSP) for public mass transport system. The proposed model is based on the GRASP metaheuristic framework, where the local search is performed by the Very Large-Scale Neighborhood (VLSN) search technique. The great differential of this search technique applied to the CSP is that, in addition to task reassigning and swapping movements, adopted in previous work, it also allows considering 3-optimal, 4-optimal, up to n-optimal task movements, for a solution with n crews, yielding to improved solutions. The proposed heuristic was tested with data from real problems of a bus company operating in the city of Belo Horizonte, and the results compared to the manual solution adopted by the company. Thus it was observed that the model presented in this work have produced more economical solutions than those used by the company.

Robust rolling stock in rapid transit networks

2011 ◽  
Vol 38 (8) ◽  
pp. 1131-1142 ◽  
Author(s):  
Luis Cadarso ◽  
Ángel Marín
Keyword(s):  
Rolling Stock ◽  
Rapid Transit ◽  
Transit Networks

Setting lines frequency and capacity in dense railway rapid transit networks with simultaneous passenger assignment

2016 ◽  
Vol 93 ◽  
pp. 251-267 ◽  
Author(s):  
David Canca ◽  
Eva Barrena ◽  
Alicia De-Los-Santos ◽  
José Luis Andrade-Pineda
Keyword(s):  
Rapid Transit ◽  
Transit Networks ◽  
Passenger Assignment
Sign in / Sign up

Export Citation Format

Share Document