Research on Vehicle Routing Problem with Stochastic Demand Based on Multi-objective Method

摘要

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.