New Methods to Solve Vehicle Routing Problem Considering Stochastic Demand

Masahiro Komatsu, Ryota Omori, Tetsuya Sato, Takayuki Shiina

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトルProceedings - 2021 10th International Congress on Advanced Applied Informatics, IIAI-AAI 2021
出版社Institute of Electrical and Electronics Engineers Inc.
ページ861-866
ページ数6
ISBN(電子版)9781665424202
DOI
出版ステータスPublished - 2021
イベント10th International Congress on Advanced Applied Informatics, IIAI-AAI 2021 - Virtual, Online, Japan
継続期間: 2021 7月 112021 7月 16

出版物シリーズ

名前Proceedings - 2021 10th International Congress on Advanced Applied Informatics, IIAI-AAI 2021

Conference

Conference10th International Congress on Advanced Applied Informatics, IIAI-AAI 2021
国/地域Japan
CityVirtual, Online
Period21/7/1121/7/16

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信
  • コンピュータ サイエンスの応用
  • 情報システム
  • 情報システムおよび情報管理
  • 教育

フィンガープリント

「New Methods to Solve Vehicle Routing Problem Considering Stochastic Demand」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル