English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Resumo: Este artigo apresenta uma nova abordagem para a resolucao do Problema de Programacao de Tripulacoes no Sistema de Transporte Publico (PPT). O modelo se baseia na metaheuristica GRASP cuja busca local e realizada pelo metodo da Busca em Vizinhanca de Grande Porte, conhecida na literatura como Very Large-Scale Neighborhood Search. O grande diferencial da aplicacao desta tecnica de busca para o PPT e que, alem de incorporar os movimentos de realocacao e troca de tarefas, realizados tradicionalmente, ela tambem permite considerar trocas do tipo 3-optimal, 4-optimal, ate o limite de n-optimal, para uma solucao com n tripulacoes. A implementacao da heuristica proposta foi testada com dados de problemas reais de uma empresa que opera em Belo Horizonte, e os resultados foram comparados com as solucoes adotadas pela empresa. Desta forma foi possivel observar que o modelo apresentado neste trabalho produziu solucoes mais economicas do que aquelas praticadas pela empresa. Abstract: 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.

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