scholarly journals A Label Correcting Algorithm with Storing Partial Solutions to Solving the Bus Routing Problem

Informatica ◽  
2013 ◽  
Vol 24 (3) ◽  
pp. 461-484 ◽  
Author(s):  
Jacek Widuch
Keyword(s):  
2017 ◽  
Vol 27 (1) ◽  
pp. 133-155 ◽  
Author(s):  
Jacek Widuch

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.


Author(s):  
Alberto Ochoa-Zezzatti ◽  
Ulises Carbajal ◽  
Oscar Castillo ◽  
José Mejía ◽  
Gilberto Rivera ◽  
...  

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

2018 ◽  
Vol 10 (3) ◽  
pp. 50-58 ◽  
Author(s):  
Samuel A. Oluwadare ◽  
◽  
Iyanu P. Oguntuyi ◽  
John C. Nwaiwu

Ingeniería ◽  
2015 ◽  
Vol 20 (1) ◽  
Author(s):  
Eduyn Ramiro Lopez Santana ◽  
Jose de Jesus Romero Carvajal

<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>


Author(s):  
Dejan Dragan ◽  
Tomaž Kramberger ◽  
Klemen Prah

The chapter deals with the road transport optimization and estimation of reduced CO2 emissions. To reduce the latter, several approaches were adopted, like alternative technologies, sustainable community changes, and changes in driving behavior. Another possible approach is to reduce the vehicle miles of traveled (VMT) by the means of transport optimization. In this chapter, the heuristic optimization approach for VMT reduction is firstly presented and tested for the case of School Bus Routing Problem. Afterwards, main focus is dedicated to the models for estimation of reduced CO2 emissions. Herein, MEET emission model is integrated into the Monte Carlo based scenario playing algorithm, which calculates the total CO2 emissions in the dependence of the randomly independently changing average speeds of the vehicles of the driving fleet. This algorithm is applied to the optimized situation, and the calculated results are compared with the unoptimized case. Results show that the applied optimization concept can significantly reduce the CO2 emissions compared to unoptimized conditions.


Sign in / Sign up

Export Citation Format

Share Document