Solution algorithm for the vehicle routing problem with stochastic demands

Ryota Omori, Takayuki Shiina

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 exactly calculating the value of the additional cost. In this study, we focused on calculating additional costs exactly 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.

Original languageEnglish
Title of host publication2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728197326
DOIs
Publication statusPublished - 2020 Dec 5
EventJoint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020 - Virtual, Tokyo, Japan
Duration: 2020 Dec 52020 Dec 8

Publication series

Name2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020

Conference

ConferenceJoint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020
CountryJapan
CityVirtual, Tokyo
Period20/12/520/12/8

Keywords

  • Optimization
  • Stochastic programming
  • Vehicle routing

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Computer Vision and Pattern Recognition
  • Software
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Solution algorithm for the vehicle routing problem with stochastic demands'. Together they form a unique fingerprint.

Cite this