A comparative study among different parallel hybrid artificial intelligent approaches to solve the capacitated vehicle routing problem

• Main Authors: Teerapun Saeheaw, Nivit Charoenchai
• Format: Journal
• Published: 2018
• Subjects: Computer Science; Mathematics
• Online Access: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85047367168&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/58558
• Institution: Chiang Mai University

Copyright © 2018 Inderscience Enterprises Ltd. The vehicle routing problem involves distribution management in the fields of transportation, distribution, and logistics, and it is one of the most important, and studied, combinatorial optimisation problems. The capacitated vehicle routing problem is an NP-hard problem, which was introduced by Dantzig and Ramser in 1959. The objective is to minimise the total distance and to maximise capacity for all of the vehicles. In this paper, the proposed parallel hybrid artificial intelligent approaches are based on cuckoo search that uses the positive features of two other optimisation techniques, central force optimisation and chemical reaction optimisation, for enhancing local search and improving the quality of the initial population, respectively. The motivation for this work is to improve the computational efficiency by getting even better results than the previous best known solutions, to study of the dynamics of various parameters of proposed approaches in searching optimum solutions, and to quicken the process of finding the optimal solution. The proposed approaches are tested on standard test instances from the literature. The test results demonstrate the effectiveness of the proposed approaches in solving the capacitated vehicle routing problem efficiently.