TY - GEN
T1 - New Methods to Solve Vehicle Routing Problem Considering Stochastic Demand
AU - Komatsu, Masahiro
AU - Omori, Ryota
AU - Sato, Tetsuya
AU - Shiina, Takayuki
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - The vehicle routing problem (VRP) determines a delivery route that minimizes the delivery cost. In this study, we consider the stochastic VRP with uncertainty and consider the variation in customer demand, which may cause a shortage of products during delivery. In this case, delivery vehicles have to return to the depot and replenish the products. We consider a model that minimizes the sum of the additional cost caused by the shortage and the normal delivery cost. In previous studies, the decomposition method using the L-shaped method was used. In this study, we improve the decomposition method to make it more efficient. In addition, we have improved the direct method of calculating the additional cost without the decomposition method by considering subtour elimination constraints. We have shown that the direct calculation method is superior in terms of time-saving.
AB - The vehicle routing problem (VRP) determines a delivery route that minimizes the delivery cost. In this study, we consider the stochastic VRP with uncertainty and consider the variation in customer demand, which may cause a shortage of products during delivery. In this case, delivery vehicles have to return to the depot and replenish the products. We consider a model that minimizes the sum of the additional cost caused by the shortage and the normal delivery cost. In previous studies, the decomposition method using the L-shaped method was used. In this study, we improve the decomposition method to make it more efficient. In addition, we have improved the direct method of calculating the additional cost without the decomposition method by considering subtour elimination constraints. We have shown that the direct calculation method is superior in terms of time-saving.
KW - stochastic programming
KW - subtour elimi-nation constraint
KW - vehicle routing problem (VRP)
UR - http://www.scopus.com/inward/record.url?scp=85133179482&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85133179482&partnerID=8YFLogxK
U2 - 10.1109/IIAI-AAI53430.2021.00150
DO - 10.1109/IIAI-AAI53430.2021.00150
M3 - Conference contribution
AN - SCOPUS:85133179482
T3 - Proceedings - 2021 10th International Congress on Advanced Applied Informatics, IIAI-AAI 2021
SP - 861
EP - 866
BT - Proceedings - 2021 10th International Congress on Advanced Applied Informatics, IIAI-AAI 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 10th International Congress on Advanced Applied Informatics, IIAI-AAI 2021
Y2 - 11 July 2021 through 16 July 2021
ER -