A water flow-like algorithm for capacitated vehicle routing problem

Suhaila Zainudin, Mokhtar Massoud Kerwad, Zulaiha Ali Othman

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

The goal of the capacitated vehicle routing problem (CVRP) is finding a useful vehicle route which is a fundamental issue of logistic management. CVRP consists of finding the optimal routes for distributing various items between customers and depot by a fleet of vehicles at a minimum traveling distance without exceeding the capacity of each vehicle. Among many proposed schemes, meta-heuristic algorithm is a well-known optimization method for solving non-deterministic polynomial-time problems. The populationbased meta-heuristics has shown the ability to obtain an excellent solution in many domains but consumes time. This is due to the nature of the algorithms that have fixed a number of the solutions, so they suffer from high computation times to reach the solution. In this paper a new approximation algorithm named Water Flow-like Algorithm (WFA) is proposed to tackle CVRP. It is inspired by the natural behavior of water flowing from a higher to a lower level, which is self-adaptive and dynamic based on population sizes and parameter settings. The performance of the proposed algorithm is evaluated using 14 benchmark datasets. The result shown performance of the proposed algorithm is comparable with other recent enhanced algorithms. Therefore, it indicates that WFA is a potential alternative to solve the CVRP using other enhancement on the algorithm.

Original languageEnglish
Pages (from-to)125-135
Number of pages11
JournalJournal of Theoretical and Applied Information Technology
Volume77
Issue number1
Publication statusPublished - 10 Jul 2015

Fingerprint

Vehicle routing
Vehicle Routing Problem
Water
Metaheuristics
Population parameter
Approximation algorithms
Heuristic algorithms
Population Size
Heuristic algorithm
Logistics
Optimization Methods
Approximation Algorithms
Polynomial time
Customers
Enhancement
Polynomials
Benchmark
Alternatives

Keywords

  • Combinatorial optimization
  • Dynamic solution
  • Meta-heuristics
  • Vehicle routing problem
  • Water flow-like algorithm

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

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

In: Journal of Theoretical and Applied Information Technology, Vol. 77, No. 1, 10.07.2015, p. 125-135.

Research output: Contribution to journalArticle

@article{4833b5f5fd4f49dd8e8a55f0fe7ed96a,
title = "A water flow-like algorithm for capacitated vehicle routing problem",
abstract = "The goal of the capacitated vehicle routing problem (CVRP) is finding a useful vehicle route which is a fundamental issue of logistic management. CVRP consists of finding the optimal routes for distributing various items between customers and depot by a fleet of vehicles at a minimum traveling distance without exceeding the capacity of each vehicle. Among many proposed schemes, meta-heuristic algorithm is a well-known optimization method for solving non-deterministic polynomial-time problems. The populationbased meta-heuristics has shown the ability to obtain an excellent solution in many domains but consumes time. This is due to the nature of the algorithms that have fixed a number of the solutions, so they suffer from high computation times to reach the solution. In this paper a new approximation algorithm named Water Flow-like Algorithm (WFA) is proposed to tackle CVRP. It is inspired by the natural behavior of water flowing from a higher to a lower level, which is self-adaptive and dynamic based on population sizes and parameter settings. The performance of the proposed algorithm is evaluated using 14 benchmark datasets. The result shown performance of the proposed algorithm is comparable with other recent enhanced algorithms. Therefore, it indicates that WFA is a potential alternative to solve the CVRP using other enhancement on the algorithm.",
keywords = "Combinatorial optimization, Dynamic solution, Meta-heuristics, Vehicle routing problem, Water flow-like algorithm",
author = "Suhaila Zainudin and Kerwad, {Mokhtar Massoud} and {Ali Othman}, Zulaiha",
year = "2015",
month = "7",
day = "10",
language = "English",
volume = "77",
pages = "125--135",
journal = "Journal of Theoretical and Applied Information Technology",
issn = "1992-8645",
publisher = "Asian Research Publishing Network (ARPN)",
number = "1",

}

TY - JOUR

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

AU - Zainudin, Suhaila

AU - Kerwad, Mokhtar Massoud

AU - Ali Othman, Zulaiha

PY - 2015/7/10

Y1 - 2015/7/10

N2 - The goal of the capacitated vehicle routing problem (CVRP) is finding a useful vehicle route which is a fundamental issue of logistic management. CVRP consists of finding the optimal routes for distributing various items between customers and depot by a fleet of vehicles at a minimum traveling distance without exceeding the capacity of each vehicle. Among many proposed schemes, meta-heuristic algorithm is a well-known optimization method for solving non-deterministic polynomial-time problems. The populationbased meta-heuristics has shown the ability to obtain an excellent solution in many domains but consumes time. This is due to the nature of the algorithms that have fixed a number of the solutions, so they suffer from high computation times to reach the solution. In this paper a new approximation algorithm named Water Flow-like Algorithm (WFA) is proposed to tackle CVRP. It is inspired by the natural behavior of water flowing from a higher to a lower level, which is self-adaptive and dynamic based on population sizes and parameter settings. The performance of the proposed algorithm is evaluated using 14 benchmark datasets. The result shown performance of the proposed algorithm is comparable with other recent enhanced algorithms. Therefore, it indicates that WFA is a potential alternative to solve the CVRP using other enhancement on the algorithm.

AB - The goal of the capacitated vehicle routing problem (CVRP) is finding a useful vehicle route which is a fundamental issue of logistic management. CVRP consists of finding the optimal routes for distributing various items between customers and depot by a fleet of vehicles at a minimum traveling distance without exceeding the capacity of each vehicle. Among many proposed schemes, meta-heuristic algorithm is a well-known optimization method for solving non-deterministic polynomial-time problems. The populationbased meta-heuristics has shown the ability to obtain an excellent solution in many domains but consumes time. This is due to the nature of the algorithms that have fixed a number of the solutions, so they suffer from high computation times to reach the solution. In this paper a new approximation algorithm named Water Flow-like Algorithm (WFA) is proposed to tackle CVRP. It is inspired by the natural behavior of water flowing from a higher to a lower level, which is self-adaptive and dynamic based on population sizes and parameter settings. The performance of the proposed algorithm is evaluated using 14 benchmark datasets. The result shown performance of the proposed algorithm is comparable with other recent enhanced algorithms. Therefore, it indicates that WFA is a potential alternative to solve the CVRP using other enhancement on the algorithm.

KW - Combinatorial optimization

KW - Dynamic solution

KW - Meta-heuristics

KW - Vehicle routing problem

KW - Water flow-like algorithm

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

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

M3 - Article

VL - 77

SP - 125

EP - 135

JO - Journal of Theoretical and Applied Information Technology

JF - Journal of Theoretical and Applied Information Technology

SN - 1992-8645

IS - 1

ER -