Cuckoo search algorithm for capacitated vehicle routing problem

Mansour Alssager, Zulaiha Ali Othman

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The cuckoo search algorithm is a novel metaheuristic based on the reproduction behavior of some cuckoo species in combination with the Levy flight behavior of some birds and fruit flies. It has been applied to a wide range of optimization problems with good performance such as a TSP; nonetheless, it has yet to be applied to the vehicle routing problem, specifically the capacitated vehicle routing problem. In this study cuckoo search is proposed to solve the capacitated vehicle routing problem. The proposed algorithm uses a set of twelve neighborhood structures process based on λ-interchanges scheme and cross-exchange operators with the aim of gaining significant improvements in solution quality. The result shows that the performance of the proposed algorithm is comparable to that of the other algorithms and is able to find near-optimal solution in reasonable time, which indicates that cuckoo search has the potential to solve the capacitated vehicle routing problem.

Original languageEnglish
Pages (from-to)11-19
Number of pages9
JournalJournal of Theoretical and Applied Information Technology
Volume88
Issue number1
Publication statusPublished - 10 Jun 2016

Fingerprint

Vehicle routing
Vehicle Routing Problem
Search Algorithm
Lévy Flights
Interchanges
Birds
Fruit
Fruits
Metaheuristics
Optimal Solution
Optimization Problem
Operator
Range of data

Keywords

  • Capacitated vehicle routing problem
  • Cuckoo search
  • Levy flight
  • Neighborhood structures
  • Optimization

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Cuckoo search algorithm for capacitated vehicle routing problem. / Alssager, Mansour; Ali Othman, Zulaiha.

In: Journal of Theoretical and Applied Information Technology, Vol. 88, No. 1, 10.06.2016, p. 11-19.

Research output: Contribution to journalArticle

@article{f236fab5f322438185a2d5d904451448,
title = "Cuckoo search algorithm for capacitated vehicle routing problem",
abstract = "The cuckoo search algorithm is a novel metaheuristic based on the reproduction behavior of some cuckoo species in combination with the Levy flight behavior of some birds and fruit flies. It has been applied to a wide range of optimization problems with good performance such as a TSP; nonetheless, it has yet to be applied to the vehicle routing problem, specifically the capacitated vehicle routing problem. In this study cuckoo search is proposed to solve the capacitated vehicle routing problem. The proposed algorithm uses a set of twelve neighborhood structures process based on λ-interchanges scheme and cross-exchange operators with the aim of gaining significant improvements in solution quality. The result shows that the performance of the proposed algorithm is comparable to that of the other algorithms and is able to find near-optimal solution in reasonable time, which indicates that cuckoo search has the potential to solve the capacitated vehicle routing problem.",
keywords = "Capacitated vehicle routing problem, Cuckoo search, Levy flight, Neighborhood structures, Optimization",
author = "Mansour Alssager and {Ali Othman}, Zulaiha",
year = "2016",
month = "6",
day = "10",
language = "English",
volume = "88",
pages = "11--19",
journal = "Journal of Theoretical and Applied Information Technology",
issn = "1992-8645",
publisher = "Asian Research Publishing Network (ARPN)",
number = "1",

}

TY - JOUR

T1 - Cuckoo search algorithm for capacitated vehicle routing problem

AU - Alssager, Mansour

AU - Ali Othman, Zulaiha

PY - 2016/6/10

Y1 - 2016/6/10

N2 - The cuckoo search algorithm is a novel metaheuristic based on the reproduction behavior of some cuckoo species in combination with the Levy flight behavior of some birds and fruit flies. It has been applied to a wide range of optimization problems with good performance such as a TSP; nonetheless, it has yet to be applied to the vehicle routing problem, specifically the capacitated vehicle routing problem. In this study cuckoo search is proposed to solve the capacitated vehicle routing problem. The proposed algorithm uses a set of twelve neighborhood structures process based on λ-interchanges scheme and cross-exchange operators with the aim of gaining significant improvements in solution quality. The result shows that the performance of the proposed algorithm is comparable to that of the other algorithms and is able to find near-optimal solution in reasonable time, which indicates that cuckoo search has the potential to solve the capacitated vehicle routing problem.

AB - The cuckoo search algorithm is a novel metaheuristic based on the reproduction behavior of some cuckoo species in combination with the Levy flight behavior of some birds and fruit flies. It has been applied to a wide range of optimization problems with good performance such as a TSP; nonetheless, it has yet to be applied to the vehicle routing problem, specifically the capacitated vehicle routing problem. In this study cuckoo search is proposed to solve the capacitated vehicle routing problem. The proposed algorithm uses a set of twelve neighborhood structures process based on λ-interchanges scheme and cross-exchange operators with the aim of gaining significant improvements in solution quality. The result shows that the performance of the proposed algorithm is comparable to that of the other algorithms and is able to find near-optimal solution in reasonable time, which indicates that cuckoo search has the potential to solve the capacitated vehicle routing problem.

KW - Capacitated vehicle routing problem

KW - Cuckoo search

KW - Levy flight

KW - Neighborhood structures

KW - Optimization

UR - http://www.scopus.com/inward/record.url?scp=84973547870&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84973547870&partnerID=8YFLogxK

M3 - Article

VL - 88

SP - 11

EP - 19

JO - Journal of Theoretical and Applied Information Technology

JF - Journal of Theoretical and Applied Information Technology

SN - 1992-8645

IS - 1

ER -