Cheapest insertion constructive heuristic based on two combination seed customer criterion for the capacitated vehicle routing problem

Mansour Alssager, Zulaiha Ali Othman, Masri Ayob

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The heuristic method is a well-known constructive method for initialize trail quality solutions in capacitated vehicle routing problem. Cheapest insertion heuristic is a popular construction heuristic known for being fast, producing decent solutions, simple to implement and easy to extend handling complicated constraints. However, in previous work, there was less focus on diverse initial quality solutions. Therefore, this study proposed an extension to the cheapest insertion heuristic which consider various combinations of seed customer criteria (the first customer inserted on a route) to preserve solutions diversification. Three seed customer criteria proposed which based on the combination of two criteria based on (farthest, nearest and random criteria). The best performing criteria selected and tested on benchmark dataset, later compared with Clarke and Wright saving heuristic. The results shown that the combination of (farthest and random) criteria obtained the best initial solution which preserve balance between the quality and diversity, with less time when compared to Clarke and wright saving heuristic. This approach is for generating diverse and quality starting solutions for the capacitated vehicle routing problem.

Original languageEnglish
Pages (from-to)207-214
Number of pages8
JournalInternational Journal on Advanced Science, Engineering and Information Technology
Volume7
Issue number1
DOIs
Publication statusPublished - 2017

Fingerprint

Vehicle routing
Seed
Seeds
seeds
preserves
Benchmarking
Heuristic methods
Heuristics
methodology

Keywords

  • Capacitated vehicle
  • Initial solution construction
  • Insertion heuristic
  • Routing problem

ASJC Scopus subject areas

  • Agricultural and Biological Sciences(all)
  • Computer Science(all)
  • Engineering(all)

Cite this

@article{c7b65dcf280d4146a5e105a1fbbce68f,
title = "Cheapest insertion constructive heuristic based on two combination seed customer criterion for the capacitated vehicle routing problem",
abstract = "The heuristic method is a well-known constructive method for initialize trail quality solutions in capacitated vehicle routing problem. Cheapest insertion heuristic is a popular construction heuristic known for being fast, producing decent solutions, simple to implement and easy to extend handling complicated constraints. However, in previous work, there was less focus on diverse initial quality solutions. Therefore, this study proposed an extension to the cheapest insertion heuristic which consider various combinations of seed customer criteria (the first customer inserted on a route) to preserve solutions diversification. Three seed customer criteria proposed which based on the combination of two criteria based on (farthest, nearest and random criteria). The best performing criteria selected and tested on benchmark dataset, later compared with Clarke and Wright saving heuristic. The results shown that the combination of (farthest and random) criteria obtained the best initial solution which preserve balance between the quality and diversity, with less time when compared to Clarke and wright saving heuristic. This approach is for generating diverse and quality starting solutions for the capacitated vehicle routing problem.",
keywords = "Capacitated vehicle, Initial solution construction, Insertion heuristic, Routing problem",
author = "Mansour Alssager and {Ali Othman}, Zulaiha and Masri Ayob",
year = "2017",
doi = "10.18517/ijaseit.7.1.1792",
language = "English",
volume = "7",
pages = "207--214",
journal = "International Journal on Advanced Science, Engineering and Information Technology",
issn = "2088-5334",
publisher = "INSIGHT - Indonesian Society for Knowledge and Human Development",
number = "1",

}

TY - JOUR

T1 - Cheapest insertion constructive heuristic based on two combination seed customer criterion for the capacitated vehicle routing problem

AU - Alssager, Mansour

AU - Ali Othman, Zulaiha

AU - Ayob, Masri

PY - 2017

Y1 - 2017

N2 - The heuristic method is a well-known constructive method for initialize trail quality solutions in capacitated vehicle routing problem. Cheapest insertion heuristic is a popular construction heuristic known for being fast, producing decent solutions, simple to implement and easy to extend handling complicated constraints. However, in previous work, there was less focus on diverse initial quality solutions. Therefore, this study proposed an extension to the cheapest insertion heuristic which consider various combinations of seed customer criteria (the first customer inserted on a route) to preserve solutions diversification. Three seed customer criteria proposed which based on the combination of two criteria based on (farthest, nearest and random criteria). The best performing criteria selected and tested on benchmark dataset, later compared with Clarke and Wright saving heuristic. The results shown that the combination of (farthest and random) criteria obtained the best initial solution which preserve balance between the quality and diversity, with less time when compared to Clarke and wright saving heuristic. This approach is for generating diverse and quality starting solutions for the capacitated vehicle routing problem.

AB - The heuristic method is a well-known constructive method for initialize trail quality solutions in capacitated vehicle routing problem. Cheapest insertion heuristic is a popular construction heuristic known for being fast, producing decent solutions, simple to implement and easy to extend handling complicated constraints. However, in previous work, there was less focus on diverse initial quality solutions. Therefore, this study proposed an extension to the cheapest insertion heuristic which consider various combinations of seed customer criteria (the first customer inserted on a route) to preserve solutions diversification. Three seed customer criteria proposed which based on the combination of two criteria based on (farthest, nearest and random criteria). The best performing criteria selected and tested on benchmark dataset, later compared with Clarke and Wright saving heuristic. The results shown that the combination of (farthest and random) criteria obtained the best initial solution which preserve balance between the quality and diversity, with less time when compared to Clarke and wright saving heuristic. This approach is for generating diverse and quality starting solutions for the capacitated vehicle routing problem.

KW - Capacitated vehicle

KW - Initial solution construction

KW - Insertion heuristic

KW - Routing problem

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

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

U2 - 10.18517/ijaseit.7.1.1792

DO - 10.18517/ijaseit.7.1.1792

M3 - Article

VL - 7

SP - 207

EP - 214

JO - International Journal on Advanced Science, Engineering and Information Technology

JF - International Journal on Advanced Science, Engineering and Information Technology

SN - 2088-5334

IS - 1

ER -