Computer Engineering and Applications ›› 2019, Vol. 55 ›› Issue (3): 238-244.

### Chaotic Fireworks Algorithm for Multi-Type Vehicle Routing Problem in Supply Chain

CAI Yanguang1, QI Yuanhang1, CAI Hao1，2, CHEN Houren1, OLE Hejlesen2

1. 1.School of Automation, Guangdong University of Technology, Guangzhou 510006, China
2.Department of Health Science & Technology, Aalborg University, Aalborg 9220, Denmark
• Online:2019-02-01 Published:2019-01-24

### 物流运输调度问题的混沌烟花算法——基于多车型供应链

1. 1.广东工业大学 自动化学院，广州 510006
2.奥尔堡大学 健康科学与工程系，奥尔堡 9220

Abstract: In order to satisfy the demands of supply chain logistics, considering with multi-type vehicles, capacity of the vehicle, fuel consumption of the vehicle, maximum delivery distance of vehicle, and aiming to minimize the fuel consumption and delivery distance, the paper constructs a model of Multi-Type Vehicle Routing Problem in Supply Chain（MTVRPSC） and proposes a chaotic fireworks algorithm to solve it. The proposed algorithm takes the fireworks algorithm as the core, and proposes a codec strategy to accomplish a mapping from the continuous space to the discrete space of MTVRPSC, and redefines the fitness function, fitness value and comparative approach of fitness. The proposed algorithm also adopts the chaotic initialization strategy and chaotic search strategy to enhance the convergent effect. Experimental results show that, the proposed algorithm has the strong optimization ability and stability to solve MTVRPSC.