Idioma:

Bi-Objective Bus Routing: An Application to School Buses in Rural Areas

Pacheco, Joaquín ; Caballero, Rafael ; Laguna, Manuel ; Molina, Julián

Transportation science, 2013-08, Vol.47 (3), p.397-411 [Periódico revisado por pares]

Baltimore: INFORMS

Texto completo disponível

Citações Citado por

Enviar para

Título:
Bi-Objective Bus Routing: An Application to School Buses in Rural Areas
Autor: Pacheco, Joaquín ; Caballero, Rafael ; Laguna, Manuel ; Molina, Julián
Assuntos: Algorithms ; Analysis ; Assignment problem ; bi-objective optimization ; Bus travel ; Cost control ; Experimental methods ; Genetic algorithms ; Hazardous materials ; Heuristic ; Management science ; Mathematical optimization ; metaheuristics ; Optimization ; Problem solving ; Road transport ; Route optimization ; routing ; Rural areas ; School buses ; School districts ; Studies ; Transport ; Vehicles ; Western Europe
É parte de: Transportation science, 2013-08, Vol.47 (3), p.397-411
Notas: ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
Descrição: The min-max vehicle routing problem (VRP) is a variant of the classical VRP in which the objective is to minimize the duration of the longest route. Examination of the VRP literature indicates that the min-max VRP has received less attention than other variants have over the years. However, the problem has important practical applications, such as those related to routing school buses. In this setting, in addition to the min-max criterion imposed on the time it takes to complete the longest route, school districts are concerned with the minimization of the total distance traveled, which is the objective of the classical VRP. Hence, the problem is formulated as a bi-objective optimization model that trades off service (i.e., the minimization of the longest route) and operational cost (i.e., the minimization of the total distance traveled). We develop a solution procedure for this problem by applying tabu search within the framework of Multiobjective Adaptive Memory Programming and compare it to an implementation of the Non-dominated Sorting Genetic Algorithm-a well-known approach to multiobjective optimization. We also assess the merit of the solution method by comparing our approximations with solution frontiers obtained with an -constraint implementation.
Editor: Baltimore: INFORMS
Idioma: Inglês

Voltar para lista de resultados

Realização: Logos de Redes Sociais:

Bi-Objective Bus Routing: An Application to School Buses in Rural Areas

Pacheco, Joaquín ; Caballero, Rafael ; Laguna, Manuel ; Molina, Julián

Baltimore: INFORMS

Buscando em bases de dados remotas. Favor aguardar.