A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters

Mesquita, Marta; Moz, Margarida; Paias, Ana; Paixão, José M. P.; Pato, Margarida Vaz; Respício, Ana

doi:10.1007/s10951-010-0195-8

Cited by 32 publications

(25 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Savings for vehicles costs and driver wages are near to 4.5% and 9.9%, respectively, compared with solutions obtained by human expertise. Mesquita et al (2011) present a non-linear multi-objective formulation for the VDRP which minimizes the number of drivers (cost criterion) and minimizes the maximum overtime assigned to a driver (preference criterion). Since the formulation has a large number of constraints and it is unlikely to be solved efficiently by commercial solvers, a preemptive goal programming based heuristic is designed to decompose the VDRP as follows: (i) solving a VDSP per day; and (ii) determining a roster for a given time horizon.…”

Section: Integrating Vehicle Scheduling Problem Driver Scheduling Prmentioning

confidence: 99%

Planning, operation, and control of bus transport systems: A literature review

Ibarra-Rojas

Delgado

Giesen

et al. 2015

Transportation Research Part B: Methodological

588

243

View full text Add to dashboard Cite

Section: Integrating Vehicle Scheduling Problem Driver Scheduling Prmentioning

confidence: 99%

Planning, operation, and control of bus transport systems: A literature review

Ibarra-Rojas

Delgado

Giesen

et al. 2015

Transportation Research Part B: Methodological

588

243

View full text Add to dashboard Cite

“…A combinação dos dois modelos foi testada com dados reais de uma empresa de transporte coletivo da região metropolitana de Belo Horizonte e os resultados obtidos se mostraram muito superiores à solução empregada pela empresa. Mesquita et al (2011) apresentaram um método que obtêm soluções viáveis para um modelo de programação multiobjetivo binária do problema de programação integrada entre veículos, tripulações e o rodízio das tripulações. Este método é um algoritmo sequencial embutido em um ambiente de programação por metas.…”

Section: Revisão Bibliográficaunclassified

Otimização da escala mensal de motoristas de ônibus urbano utilizando a heurística Variable Neighborhood Search

Silva¹,

Prates²

2014

Transportes

View full text Add to dashboard Cite

One of the last stage from public transportation planning concerns to defining the scale of urban bus drivers for short term period, called Crew Rostering Problem (CRT). This problem aims to generate sequences of daily shifts, including weekdays, Saturdays and Sundays, respecting labor laws and operational constraints. Moreover, a good crew roster should provide a better division of workload among the crews and still to reduce the overtime costs paid by the company. The model proposed in this paper is able to generate solutions satisfying a fixed scheme called 5/1 of day-off, beyond the labor laws and operational constraints imposed by the company. The Variable Neighborhood Search metaheuristic (VNS) was implemented using different neighborhood structures, varying the number of modifications performed on the current solution. The implementation was tested with data from a midsize company and the results show significant improvements compared to the solution adopted by the company.Resumo: Uma das últimas etapas no planejamento do transporte público consiste em definir a escala dos motoristas dos ônibus urbanos para um determinado período, denominada Problema de Rodízio de Tripulações. Esta etapa tem como objetivo gerar sequências de jornadas diárias, compreendendo os dias úteis, sábados e domingos, que respeitem as restrições legais e operacionais. Além disso, uma boa escala deve proporcionar uma melhor divisão da carga de trabalho entre as tripulações e ainda reduzir os custos com as horas extras pagas pela empresa. O modelo proposto neste trabalho gera soluções que respeitam o padrão de folga fixa do tipo 5/1 além das restrições legais e operacionais impostas pela empresa. A metaheurística Variable Neighborhood Search foi implementada utilizando diferentes estruturas de vizinhança e variando o número de modificações na solução. A implementação foi testada com dados de uma empresa de médio porte e os resultados mostraram melhorias significativas em relação à solução adotada pela empresa. Palavras-chave:Rodízio das tripulações. Transporte público. Metaheurística.

show abstract

“…In a previous study from Mesquita et al. (), using the software CPLEX 11 optimizer (ILOG, ) for a BRP single objective model with an objective function mathematically identical to f 1 , exact solutions were obtained only for some of the smallest test instances to be described in section . This experience, along with the hard theoretical complexity of the problem, prompted us to develop evolutionary heuristics which, in general, are well equipped to deal with high complexity multi‐objective problems.…”

Section: The Bus Driver Rostering Problemmentioning

confidence: 99%

“…The 10 instances in the second set, P100, came from solutions of 100 trips VCRP instances and on average comprise 616.8 duties. Finally, the third set, Pc, includes 12 BRP instances based on real data from a Portuguese urban bus company under study (Mesquita et al., ). In this set, the average number of duties is 856.3.…”

Section: Computational Testsmentioning

confidence: 99%

See 1 more Smart Citation

Enhanced genetic algorithms for a bi‐objective bus driver rostering problem: a computational study

Respício

Moz

Pato

2013

Int Trans Operational Res

Self Cite

View full text Add to dashboard Cite

In this work, the bus driver rostering problem is considered in the context of a noncyclic rostering, with two objectives representing either the company or the drivers' interests. A network model and a proof of the NP-hardness of the problem are presented, along with a bi-objective memetic algorithm that combines a specific decoder with a utopian/lexicographic elitism, a strength Pareto fitness evaluation, and a local search procedure. By taking real and benchmark instances the computational behavior of the memetic algorithm is compared with simpler versions to assess the effects of the embedded components. The developed algorithm is a valuable tool for bus companies' planning departments insofar as it yields at low computing times a pool of good quality rosters that reconcile contradictory objectives. This study shows that simple enhancements in standard bi-objective genetic algorithms may improve the results for this difficult combinatorial problem.

show abstract

A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters

Cited by 32 publications

References 25 publications

Planning, operation, and control of bus transport systems: A literature review

Planning, operation, and control of bus transport systems: A literature review

Otimização da escala mensal de motoristas de ônibus urbano utilizando a heurística Variable Neighborhood Search

Enhanced genetic algorithms for a bi‐objective bus driver rostering problem: a computational study

Contact Info

Product

Resources

About