Taguchi-based Parameter Setting of Cuckoo Search Algorithm for Capacitated Vehicle Routing Problem

2016 ◽  
pp. 71-79 ◽  
Author(s):  
Mansour Alssager ◽  
Zulaiha Ali Othman
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Parameter Setting ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

scholarly journals Cuckoo search via Lévy flights for the capacitated vehicle routing problem

2017 ◽  
Vol 14 (2) ◽  
pp. 293-304 ◽  
Author(s):  
Jon Henly Santillan ◽  
Samantha Tapucar ◽  
Cinmayii Manliguez ◽  
Vicente Calag
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Cuckoo Search ◽  
Lévy Flights ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Levy Flights ◽  
Capacitated Vehicle

New Tabu Search Algorithm with Applied Technology for Capacitated Vehicle Routing Problem

2013 ◽  
Vol 859 ◽  
pp. 395-398
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Insertion Method ◽  
Applied Technology ◽  
Capacitated Vehicle

This paper studies the vehicle routing problem. According to the characteristics of model, new tabu search algorithm is used to get the optimization solution. It applies newly improved insertion method to construct initial solution, to improve the feasibility of the solution; designs dual layered random operation to construct its neighborhood; applies auto adaptive tabu length to control the searching capability dynamically. At last, it uses simulated experiments to prove the effectiveness and feasibility of this algorithm, and provides clues for massively solving practical problems.

scholarly journals Hybrid Cuckoo Search for the Capacitated Vehicle Routing Problem

Symmetry ◽  
2020 ◽  
Vol 12 (12) ◽  
pp. 2088
Author(s):  
Mansour Alssager ◽  
Zulaiha Ali Othman ◽  
Masri Ayob ◽  
Rosmayati Mohemad ◽  
Herman Yuliansyah
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
State Of The Art ◽  
Cuckoo Search ◽  
Disruptive Selection ◽  
Selection Strategy ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Neighborhood Structures ◽  
Capacitated Vehicle

Having the best solution for Vehicle Routing Problem (VRP) is still in demand. Beside, Cuckoo Search (CS) is a popular metaheuristic based on the reproductive strategy of the Cuckoo species and has been successfully applied in various optimizations, including Capacitated Vehicle Routing Problem (CVRP). Although CS and hybrid CS have been proposed for CVRP, the performance of CS is far from the state-of-art. Therefore, this study proposes a hybrid CS with Simulated Annealing (SA) algorithm for the CVRP, consisting of three improvements—the investigation of 12 neighborhood structures, three selections strategy and hybrid it with SA. The experiment was conducted using 16 instances of the Augerat benchmark dataset. The results show that 6 out of 12 neighborhood structures were the best and the disruptive selection strategy is the best strategy. The experiments’ results showed that the proposed method could find optimal and near-optimal solutions compared with state-of-the-art algorithms.

Sign in / Sign up

Export Citation Format

Share Document