scholarly journals Improving vehicle routing decision for subsidized rice distribution using linear programming considering stochastic travel times

2021 ◽  
Vol 1811 (1) ◽  
pp. 012007
Author(s):  
Filscha Nurprihatin ◽  
Yuri Delano Regent Montororing
Keyword(s):  
Linear Programming ◽  
Vehicle Routing ◽  
Travel Times ◽  
Rice Distribution ◽  
Stochastic Travel Times

scholarly journals A Three-Stage Saving-Based Heuristic for Vehicle Routing Problem with Time Windows and Stochastic Travel Times

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Zheng Wang ◽  
Chunyue Zhou
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Travel Times ◽  
Start Time ◽  
Routing Problem ◽  
Problem Transformation ◽  
Basic Ideas ◽  
Two Stages ◽  
Stochastic Travel Times

This paper presents a saving-based heuristic for the vehicle routing problem with time windows and stochastic travel times (VRPTWSTT). One of the basic ideas of the heuristic is to advance the latest service start time of each customer by a certain period of time. In this way, the reserved time can be used to cope with unexpected travel time delay when necessary. Another important idea is to transform the VRPTWSTT to a set of vehicle routing problems with time windows (VRPTW), each of which is defined by a given percentage used to calculate the reserved time for customers. Based on the above two key ideas, a three-stage heuristic that includes the “problem transformation” stage, the “solution construction” stage, and the “solution improvement” stage is developed. After the problem transformation in the first stage, the work of the next two stages is to first construct an initial solution for each transformed VRPTW by improving the idea of the classical Clarke-Wright heuristic and then further improve the solution. Finally, a number of numerical experiments are conducted to evaluate the efficiency of the described methodology under different uncertainty levels.

The Vehicle Routing Problem with Stochastic Travel Times

1992 ◽  
Vol 26 (3) ◽  
pp. 161-170 ◽  
Author(s):  
Gilbert Laporte ◽  
François Louveaux ◽  
Hélène Mercure
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Travel Times ◽  
Routing Problem ◽  
Stochastic Travel Times

scholarly journals A Simulation-Based Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Travel Times

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Zheng Wang ◽  
Lin Lin
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Working Time ◽  
Travel Times ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Simulation Based ◽  
Basic Ideas ◽  
Stochastic Travel Times ◽  
Capacitated Vehicle

This paper presents a flexible solution methodology for the capacitated vehicle routing problem with stochastic travel times (CVRPSTT). One of the basic ideas of the methodology is to consider a vehicle working time lower than the actual maximum vehicle working time when designing CVRPSTT solutions. In this way, the working time surplus can be used to cope with unexpected congestions when necessary. Another important idea is to transform the CVRPSTT instance to a limited set of capacitated vehicle routing problems (CVRP), each of which is defined by a given percentage of the maximum vehicle working time. Thus, our approach can take advantage of any efficient heuristic that already exists for the CVRP. Based on the two key ideas, this paper presents a simulation-based algorithm, in which Monte Carlo simulation is used to obtain estimates of the cost and the reliability of each solution, and the Clarke and Wright heuristic is improved to generate more reliable solutions. Finally, a number of numerical experiments are done in the paper with the purpose of analyzing the efficiency of the described methodology under different uncertainty scenarios.

Sign in / Sign up

Export Citation Format

Share Document