A Glowworm Swarm Optimization algorithm for the Vehicle Routing Problem with Stochastic Demands

作者：

Highlights：

• A hybridized version of the Glowworm Swarm Optimization algorithm is presented.

• We solve the Vehicle Routing Problem with Stochastic Demands (VRPSD) with the proposed algorithm.

• We modify the algorithm in order to be suitable for combinatorial optimization problems.

• We compare the algorithm with a number of algorithms from the literature.

• The obtained results denoted the efficiency of the algorithm.

摘要

•A hybridized version of the Glowworm Swarm Optimization algorithm is presented.•We solve the Vehicle Routing Problem with Stochastic Demands (VRPSD) with the proposed algorithm.•We modify the algorithm in order to be suitable for combinatorial optimization problems.•We compare the algorithm with a number of algorithms from the literature.•The obtained results denoted the efficiency of the algorithm.

论文关键词：Glowworm Swarm Optimization,Path relinking,Combinatorial Neighborhood Topology,Variable Neighborhood Search,Vehicle Routing Problem with Stochastic Demands

论文评审过程：Received 5 August 2014, Revised 11 October 2015, Accepted 12 October 2015, Available online 19 October 2015, Version of Record 18 November 2015.

论文官网地址：https://doi.org/10.1016/j.eswa.2015.10.012