A Label Correcting Algorithm for the Bus Routing Problem

2012 ◽  
Vol 118 (3) ◽  
pp. 305-326 ◽  
Author(s):  
Jacek Widuch
Keyword(s):  
Routing Problem ◽  
Bus Routing

scholarly journals A Relation of Dominance for the Bicriterion Bus Routing Problem

2017 ◽  
Vol 27 (1) ◽  
pp. 133-155 ◽  
Author(s):  
Jacek Widuch
Keyword(s):  
Graph Theory ◽  
Shortest Path ◽  
Experimental Tests ◽  
Partial Solution ◽  
Estimation Methods ◽  
Final Solution ◽  
Routing Problem ◽  
Variable Weights ◽  
Bus Routing ◽  
The Cost

Abstract A bicriterion bus routing (BBR) problem is described and analysed. The objective is to find a route from the start stop to the final stop minimizing the time and the cost of travel simultaneously. Additionally, the time of starting travel at the start stop is given. The BBR problem can be resolved using methods of graph theory. It comes down to resolving a bicriterion shortest path (BSP) problem in a multigraph with variable weights. In the paper, differences between the problem with constant weights and that with variable weights are described and analysed, with particular emphasis on properties satisfied only for the problem with variable weights and the description of the influence of dominated partial solutions on non-dominated final solutions. This paper proposes methods of estimation a dominated partial solution for the possibility of obtaining a non-dominated final solution from it. An algorithm for solving the BBR problem implementing these estimation methods is proposed and the results of experimental tests are presented.

Development of a Java Library to Solve the School Bus Routing Problem

2020 ◽  
pp. 175-196
Author(s):  
Alberto Ochoa-Zezzatti ◽  
Ulises Carbajal ◽  
Oscar Castillo ◽  
José Mejía ◽  
Gilberto Rivera ◽  
...  
Keyword(s):  
School Bus ◽  
Routing Problem ◽  
Bus Routing ◽  
Java Library

scholarly journals Solving School Bus Routing Problem using Genetic Algorithm-based Model

2018 ◽  
Vol 10 (3) ◽  
pp. 50-58 ◽  
Author(s):  
Samuel A. Oluwadare ◽  
◽  
Iyanu P. Oguntuyi ◽  
John C. Nwaiwu
Keyword(s):  
Genetic Algorithm ◽  
School Bus ◽  
Routing Problem ◽  
Bus Routing

scholarly journals A hybrid column generation and clustering approach to the school bus routing problem with time windows

Ingeniería ◽  
2015 ◽  
Vol 20 (1) ◽  
Author(s):  
Eduyn Ramiro Lopez Santana ◽  
Jose de Jesus Romero Carvajal
Keyword(s):  
Column Generation ◽  
Rural Areas ◽  
Vehicle Routing Problem ◽  
Clustering Algorithm ◽  
Time Windows ◽  
School Bus ◽  
Routing Problem ◽  
Bus Routing ◽  
Clustering Approach ◽  
Urban And Rural Areas

<span>This paper attempts to solve the School Bus Routing Problem with Time Windows that consists of finding the best set of routes to pick up students distributed geographically with constraints as capacity, time windows and maximum travel time. We formulated the problem as a classic Vehicle Routing Problem with Time Windows and solved it using an approach based on a clustering algorithm and column generation method. A real world case from a school in Bogotá, Colombiais presented including 600 students to pick up in near 400 nodes located in urban and rural areas. The obtained results demonstrate a reduction as the problem’s complexity and  an improvement on the performance measures of the proposed method.</span>

Sign in / Sign up

Export Citation Format

Share Document