Method for the stochastic traveling time VRPSPD problem

This paper set up a chance-constrained programming model for STT-VRPSDP (stochastic traveling time vehicle routing problem with simultaneous pick-up and delivery), designed respectively a scatter search algorithm applicable to this problem. In response to the complexity of STT-VRPSDP, this paper constructed innovatively an improvement method and a combination method derived from the basic theory of scatter search algorithm. Moreover, with C-W algorithm as an approach to get the initial solution to scatter search algorithm, the scatter search algorithm designed in this paper catered better to the loading floating feature particular to STT-VRPSDP and therefore could better the quality of solution. The simulation experiment firstly analyzed the parameters setting of scatter search algorithm, after which several sets of instances were chosen for the purpose of comparing and analyzing scatter search algorithm and genetic algorithm. The computation results show that solutions of scatter search algorithm are better than those of genetic algorithm.