期刊论文

Chen, Yanjiao

英文

IEEE ACCESS

2169-3536

2019

7

19643-19652

10.1109/ACCESS.2019.2894681

This work was supported in part by the National Natural Science Foundation of China under Grant 61772377, Grant 61672257, and Grant 61702380, in part by the Natural Science Foundation of Hubei Province of China under Grant 2017CFA007 and Grant 2017CFB134, in part by the Science and Technology Planning Project of Shenzhen under Grant JCYJ20170818112550194, in part by the Fund of Hubei Key Laboratory of Transportation Internet of Things under Grant WHUTIOT-2017A0011, in part by the Technological Innovation Projects of Hubei Province under Grant 2017AAA125, and in part by the Equipment Pre-Research Joint Fund of Ministry of Education of China (Youth Talent) under Grant 6141A02033327.

本校为其他机构

In this paper, we propose a novel ant colony optimization algorithm based on improved brainstorm optimization (IBSO-ACO) to solve the vehicle routing problem with soft time windows. Compared with the traditional ant colony algorithm, the proposed IBSO-ACO can better address the local optimum problem, since we have carefully designed an improved brainstorming optimization algorithm to update the solutions obtained by the ant colony algorithm, which enhance the solution diversity and the global search ability. Furthermore, we use the classification method to accelerate the convergence of the pro...