TY - GEN
T1 - New Formulation for the Vehicle Routing Problem with Stochastic Demands
AU - Omori, R.
AU - Shiina, T.
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/9
Y1 - 2020/9
N2 - The main purpose of the Vehicle Routing Problem (VRP) is to minimize the total cost of delivery. When customer demand is not considered, the total cost is only travel cost. This is obtained by solving the Traveling Salesman Problem (TSP). However, when customers' demands are stochastic (Vehicle Routing Problem with Stochastic Demands, SVRP), the vehicle may thus be unable to load the customer's demand, even if the expected demand along the route does not exceed the vehicle capacity. This situation is referred to as a failure. Therefore, in SVRP, it is necessary to minimize the sum of the travel cost obtained by solving the TSP and the additional cost incurred when delivering along the route.In previous studies, it was common to use the lower bound instead of directly calculating the value of the additional cost. In this study, we focused on calculating additional costs directly without using lower bounds. The method used here considers additional costs of multiple edges: edges that pass through the depot and edges that do not pass through the depot, for all edges connecting the depot to the customer. The method provides a new solution to find the exact value.
AB - The main purpose of the Vehicle Routing Problem (VRP) is to minimize the total cost of delivery. When customer demand is not considered, the total cost is only travel cost. This is obtained by solving the Traveling Salesman Problem (TSP). However, when customers' demands are stochastic (Vehicle Routing Problem with Stochastic Demands, SVRP), the vehicle may thus be unable to load the customer's demand, even if the expected demand along the route does not exceed the vehicle capacity. This situation is referred to as a failure. Therefore, in SVRP, it is necessary to minimize the sum of the travel cost obtained by solving the TSP and the additional cost incurred when delivering along the route.In previous studies, it was common to use the lower bound instead of directly calculating the value of the additional cost. In this study, we focused on calculating additional costs directly without using lower bounds. The method used here considers additional costs of multiple edges: edges that pass through the depot and edges that do not pass through the depot, for all edges connecting the depot to the customer. The method provides a new solution to find the exact value.
KW - VRP
UR - http://www.scopus.com/inward/record.url?scp=85107197000&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85107197000&partnerID=8YFLogxK
U2 - 10.1109/IIAI-AAI50415.2020.00144
DO - 10.1109/IIAI-AAI50415.2020.00144
M3 - Conference contribution
AN - SCOPUS:85107197000
T3 - Proceedings - 2020 9th International Congress on Advanced Applied Informatics, IIAI-AAI 2020
SP - 719
EP - 724
BT - Proceedings - 2020 9th International Congress on Advanced Applied Informatics, IIAI-AAI 2020
A2 - Matsuo, Tokuro
A2 - Takamatsu, Kunihiko
A2 - Ono, Yuichi
A2 - Hirokawa, Sachio
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 9th International Congress on Advanced Applied Informatics, IIAI-AAI 2020
Y2 - 1 September 2020 through 15 September 2020
ER -