Research on vehicle routing problem with stochastic demand based on multi-objective method

  • Authors:

  • Yanwei Zhao;Chuan Li;Jing-ling Zhang;Xingqiu Ren;Wei Ren

  • Affiliations:

  • Key Laboratory of Special Equipment and Advanced Processing Technology, Ministry of Education, Zhejiang Univ. of Tech., Hangzhou, Zhejiang, China;College of Computer Science & Technology, Zhejiang Univ. of Tech., Hangzhou, Zhejiang, China;Key Laboratory of Special Equipment and Advanced Processing Technology, Ministry of Education, Zhejiang Univ. of Tech., Hangzhou, Zhejiang, China;Key Laboratory of Special Equipment and Advanced Processing Technology, Ministry of Education, Zhejiang Univ. of Tech., Hangzhou, Zhejiang, China;Key Laboratory of Special Equipment and Advanced Processing Technology, Ministry of Education, Zhejiang Univ. of Tech., Hangzhou, Zhejiang, China

  • Venue:
  • ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper was targeted at minimizing the expectation of traveling distance maximizing the expectation of customers' degree satisfaction, a multi-objective vehicle routing problem with stochastic demand (VRPSD) model based on soft time window was proposed. In order to solve the problem, a hybrid PSO algorithm based on Pareto optimization method was designed in this paper. The paper made the standard PSO algorithm discrete by re-defining operators and employing swap recon, utilized challenge tournament method to construct Pareto optimal solution set, applied an external archive to keep the diversity of solutions. Ultimately, a standard example is used to verify the validity of the algorithm.