An improved hybrid firefly algorithm for capacitated vehicle routing problem |
| |
| Affiliation: | 1. Technical University of Crete, School of Production Engineering and Management, University Campus, Chania 73100, Greece;2. Aristotle University of Thessalonike, Department of Civil Engineering, Thessalonike 54124, Greece;3. Luleå Technical University, Industrial Logistics, Luleå 97187, Sweden;1. School of Management, University of Shanghai for Science and Technology, Mail Box 459, 516 Jungong Road, Shanghai 200093, China;2. School of Materials Engineering, Shanghai University of Engineering Science, China;1. Departamento de Gestão, Escola de Economia e Gestão, Universidade do Minho, Largo do Paço, 4704 – 553 Braga, Portugal;2. CEMAPRE, ISEG, University of Lisbon, Portugal;1. Dipartimento di Ingegneria, Università di Palermo, Viale Delle Scienze Ed. 8, 90128 Palermo, Italy;2. Facoltà di Scienze e Tecnologie, Libera Università di Bolzano, Piazza Università 1, 39100 Bolzano, Italy;3. Dipartimento di Ingegneria dell''Innovazione, Università del Salento, Via per Monteroni, 73100 Lecce, Italy |
| |
| Abstract: | Firefly algorithm (FA) is a new meta-heuristic which is successfully applied to solve several optimization problems. However, it suffers from a drawback of easily getting stuck at local optima. This paper proposes a new hybrid FA, called CVRP-FA, to solve capacitated vehicle routing problem. In CVRP-FA, FA is integrated with two types of local search and genetic operators to enhance the solution’s quality and accelerate the convergence. The experiments are conducted over 82 benchmark instances. The results demonstrate that CVRP-FA has fast convergence rate and high computational accuracy. It significantly outperforms the other state-of-the-art FA variants in majority of the tested instances. |
| |
| Keywords: | Firefly algorithm Capacitated vehicle routing problem Meta-heuristic Local search Taguchi method |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
