Improved water flow-like algorithm for capacitated vehicle routing problem

Mokhtar Massoud Kerwad, Zulaiha Ali Othman, Suhaila Zainudin

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The capacitated vehicle routing problem (CVRP) has many applications in different domains seeking ways to minimize the total traveled distance. Although the CVRP has been widely investigated in the literature, it is facing ongoing operational challenges. Moreover, despite various metaheuristics that have been proposed to solve this problem, its optimal solution is still not achieved. Thus far, the water-flow-like algorithm (WFA) has obtained a reasonable solution for this problem, with room for further improvement. The WFA has strategies for diversification (in the precipitation operation). This study aims to enhance the WFA for solving the CVRP by providing a good solution in terms of diversity and quality. The basic WFA is capable of solving the CVRP, however, it has problems in terms of slow convergence and the tendency of being trapped in the local optimum. Therefore, an improved WFA (IWFA) is proposed in this study to overcome this weakness by increasing the diversity of solution search in the precipitation operation using constructive heuristics (i.e., nearest neighbor, random method, and greedy randomized adaptive search procedure). Constructive heuristics aim to construct new solutions instead of duplicating existing ones. Computational results show that the IWFA outperforms the basic WFA with a solution quality improvement of up to 76.92% and is better than other state-of-the-art methods by up to 74.55%. This finding indicates that the IWFA is a promising approach for solving instances of CVRP.

Original languageEnglish
Pages (from-to)4836-4853
Number of pages18
JournalJournal of Theoretical and Applied Information Technology
Volume96
Issue number15
Publication statusPublished - 15 Aug 2018

Fingerprint

Vehicle routing
Vehicle Routing Problem
Water
Heuristics
Greedy Randomized Adaptive Search Procedure
Quality Improvement
Diversification
Metaheuristics
Computational Results
Nearest Neighbor
Optimal Solution
Minimise

Keywords

  • Capacitated vehicle routing problem
  • Constructive heuristics
  • Metaheuristics
  • Water-flow-like algorithm

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Improved water flow-like algorithm for capacitated vehicle routing problem. / Kerwad, Mokhtar Massoud; Ali Othman, Zulaiha; Zainudin, Suhaila.

In: Journal of Theoretical and Applied Information Technology, Vol. 96, No. 15, 15.08.2018, p. 4836-4853.

Research output: Contribution to journalArticle

@article{e631937aa05f48a2b827a343bbd68a90,
title = "Improved water flow-like algorithm for capacitated vehicle routing problem",
abstract = "The capacitated vehicle routing problem (CVRP) has many applications in different domains seeking ways to minimize the total traveled distance. Although the CVRP has been widely investigated in the literature, it is facing ongoing operational challenges. Moreover, despite various metaheuristics that have been proposed to solve this problem, its optimal solution is still not achieved. Thus far, the water-flow-like algorithm (WFA) has obtained a reasonable solution for this problem, with room for further improvement. The WFA has strategies for diversification (in the precipitation operation). This study aims to enhance the WFA for solving the CVRP by providing a good solution in terms of diversity and quality. The basic WFA is capable of solving the CVRP, however, it has problems in terms of slow convergence and the tendency of being trapped in the local optimum. Therefore, an improved WFA (IWFA) is proposed in this study to overcome this weakness by increasing the diversity of solution search in the precipitation operation using constructive heuristics (i.e., nearest neighbor, random method, and greedy randomized adaptive search procedure). Constructive heuristics aim to construct new solutions instead of duplicating existing ones. Computational results show that the IWFA outperforms the basic WFA with a solution quality improvement of up to 76.92{\%} and is better than other state-of-the-art methods by up to 74.55{\%}. This finding indicates that the IWFA is a promising approach for solving instances of CVRP.",
keywords = "Capacitated vehicle routing problem, Constructive heuristics, Metaheuristics, Water-flow-like algorithm",
author = "Kerwad, {Mokhtar Massoud} and {Ali Othman}, Zulaiha and Suhaila Zainudin",
year = "2018",
month = "8",
day = "15",
language = "English",
volume = "96",
pages = "4836--4853",
journal = "Journal of Theoretical and Applied Information Technology",
issn = "1992-8645",
publisher = "Asian Research Publishing Network (ARPN)",
number = "15",

}

TY - JOUR

T1 - Improved water flow-like algorithm for capacitated vehicle routing problem

AU - Kerwad, Mokhtar Massoud

AU - Ali Othman, Zulaiha

AU - Zainudin, Suhaila

PY - 2018/8/15

Y1 - 2018/8/15

N2 - The capacitated vehicle routing problem (CVRP) has many applications in different domains seeking ways to minimize the total traveled distance. Although the CVRP has been widely investigated in the literature, it is facing ongoing operational challenges. Moreover, despite various metaheuristics that have been proposed to solve this problem, its optimal solution is still not achieved. Thus far, the water-flow-like algorithm (WFA) has obtained a reasonable solution for this problem, with room for further improvement. The WFA has strategies for diversification (in the precipitation operation). This study aims to enhance the WFA for solving the CVRP by providing a good solution in terms of diversity and quality. The basic WFA is capable of solving the CVRP, however, it has problems in terms of slow convergence and the tendency of being trapped in the local optimum. Therefore, an improved WFA (IWFA) is proposed in this study to overcome this weakness by increasing the diversity of solution search in the precipitation operation using constructive heuristics (i.e., nearest neighbor, random method, and greedy randomized adaptive search procedure). Constructive heuristics aim to construct new solutions instead of duplicating existing ones. Computational results show that the IWFA outperforms the basic WFA with a solution quality improvement of up to 76.92% and is better than other state-of-the-art methods by up to 74.55%. This finding indicates that the IWFA is a promising approach for solving instances of CVRP.

AB - The capacitated vehicle routing problem (CVRP) has many applications in different domains seeking ways to minimize the total traveled distance. Although the CVRP has been widely investigated in the literature, it is facing ongoing operational challenges. Moreover, despite various metaheuristics that have been proposed to solve this problem, its optimal solution is still not achieved. Thus far, the water-flow-like algorithm (WFA) has obtained a reasonable solution for this problem, with room for further improvement. The WFA has strategies for diversification (in the precipitation operation). This study aims to enhance the WFA for solving the CVRP by providing a good solution in terms of diversity and quality. The basic WFA is capable of solving the CVRP, however, it has problems in terms of slow convergence and the tendency of being trapped in the local optimum. Therefore, an improved WFA (IWFA) is proposed in this study to overcome this weakness by increasing the diversity of solution search in the precipitation operation using constructive heuristics (i.e., nearest neighbor, random method, and greedy randomized adaptive search procedure). Constructive heuristics aim to construct new solutions instead of duplicating existing ones. Computational results show that the IWFA outperforms the basic WFA with a solution quality improvement of up to 76.92% and is better than other state-of-the-art methods by up to 74.55%. This finding indicates that the IWFA is a promising approach for solving instances of CVRP.

KW - Capacitated vehicle routing problem

KW - Constructive heuristics

KW - Metaheuristics

KW - Water-flow-like algorithm

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

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

M3 - Article

AN - SCOPUS:85052146862

VL - 96

SP - 4836

EP - 4853

JO - Journal of Theoretical and Applied Information Technology

JF - Journal of Theoretical and Applied Information Technology

SN - 1992-8645

IS - 15

ER -