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. © 2011 Springer-Verlag.
CITATION STYLE
Zhao, Y., Li, C., Zhang, J. L., Ren, X., & Ren, W. (2011). Research on vehicle routing problem with stochastic demand based on multi-objective method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6838 LNCS, pp. 153–161). https://doi.org/10.1007/978-3-642-24728-6_21
Mendeley helps you to discover research relevant for your work.