Por favor, use este identificador para citar o enlazar este ítem:
http://repositorio.ufc.br/handle/riufc/21182
Tipo: | Artigo de Periódico |
Título : | A Multiobjective metaheuristic approach for the integrated vehicle and crew scheduling |
Autor : | Prata, Bruno de Athayde |
Palabras clave : | Mass transit;Combinatorial optimization;Evolutionary algorithms;Otimização combinatória;Algoritmos |
Fecha de publicación : | 2016 |
Editorial : | Journal of Transport Literature |
Citación : | PRATA, B. A. A Multiobjective metaheuristic approach for the integrated vehicle and crew scheduling. Journal of Transport Literature, [S.l.], v 10, n 2, p 10-14, abr. 2016. |
Abstract: | The integrated vehicle and crew scheduling problem is a hard Combinatorial Optimization problem widely studied over the years. Taking into consideration the range of variables related to the planning process of vehicles and drivers, there are several practical characteristics of the problem that are not reflected in the solutions generated computationally. Among these characteristics, that were not found in the consulted literature, the most important is the existence of multiple objectives. This paper aims at presenting a multiobjective approach for the integrated vehicle and crew scheduling problem based on Genetic Algorithms. A case study in Portimão (Portugal) is presented and discussed. Were applied: (i) a Pareto Envelope-based Selection Algorithm II (PESA-II), and (ii) a hybridization between PESA-II and Integer Programming, which were summarized in a table. These results indicate that this new approach has a considerable potential for achieving significant gains in terms of operation costs and reduction in planning times. |
URI : | http://www.repositorio.ufc.br/handle/riufc/21182 |
ISSN : | 2238-1031 |
Aparece en las colecciones: | GESLOG - Artigos publicados em revistas científicas |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
2016_art_baprata.pdf | 774,68 kB | Adobe PDF | Visualizar/Abrir |
Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.