Suitability factor on the capacitated vehicle routing problem

Helmi Md Rais, Zulaiha Ali Othman, Abdul Razak Hamdan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Finding a good solution for logistics and transportation industries is a continuous effort to maximize the efficiencies especially on problem that relates to the industry such as Vehicle Routing Problem (VRP). One of the most popular solutions is using Ant Colony System (ACS) algorithm. Several versions of ACOs have been proposed which aim to achieve an optimum solution. A new variant of algorithm called Dynamic Ant Colony System with Three Level Updates (DACS3) has been developed which focuses on adding individual ant behavior. It has been applied in Capacitated Vehicle Routing Problem (CVRP). Therefore, this research aims to improve its solution by applying elitist ant concept, rearrange its selection of candidates and to include current status of vehicle capacity as part of its decision making. The result shows that DACS3 has achieve a better solution for most of the datasets. Applying elitist concept, rearrangement of candidate selection and vehicle capacity as part of its decision making can influence its achievement to reach an optimal distance.

Original languageEnglish
Title of host publicationProceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10
Pages794-799
Number of pages6
Volume2
DOIs
Publication statusPublished - 2010
Event2010 International Symposium on Information Technology, ITSim'10 - Kuala Lumpur
Duration: 15 Jun 201017 Jun 2010

Other

Other2010 International Symposium on Information Technology, ITSim'10
CityKuala Lumpur
Period15/6/1017/6/10

Fingerprint

Vehicle routing
Decision making
Logistics
Industry

Keywords

  • Ant Colony
  • Dynamic candidate
  • Optimization
  • Suitability factor
  • Vehicle Routing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Rais, H. M., Ali Othman, Z., & Hamdan, A. R. (2010). Suitability factor on the capacitated vehicle routing problem. In Proceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10 (Vol. 2, pp. 794-799). [5561552] https://doi.org/10.1109/ITSIM.2010.5561552

Suitability factor on the capacitated vehicle routing problem. / Rais, Helmi Md; Ali Othman, Zulaiha; Hamdan, Abdul Razak.

Proceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10. Vol. 2 2010. p. 794-799 5561552.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rais, HM, Ali Othman, Z & Hamdan, AR 2010, Suitability factor on the capacitated vehicle routing problem. in Proceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10. vol. 2, 5561552, pp. 794-799, 2010 International Symposium on Information Technology, ITSim'10, Kuala Lumpur, 15/6/10. https://doi.org/10.1109/ITSIM.2010.5561552
Rais HM, Ali Othman Z, Hamdan AR. Suitability factor on the capacitated vehicle routing problem. In Proceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10. Vol. 2. 2010. p. 794-799. 5561552 https://doi.org/10.1109/ITSIM.2010.5561552
Rais, Helmi Md ; Ali Othman, Zulaiha ; Hamdan, Abdul Razak. / Suitability factor on the capacitated vehicle routing problem. Proceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10. Vol. 2 2010. pp. 794-799
@inproceedings{e434084c4df1421e95ee0b2ff9b8313f,
title = "Suitability factor on the capacitated vehicle routing problem",
abstract = "Finding a good solution for logistics and transportation industries is a continuous effort to maximize the efficiencies especially on problem that relates to the industry such as Vehicle Routing Problem (VRP). One of the most popular solutions is using Ant Colony System (ACS) algorithm. Several versions of ACOs have been proposed which aim to achieve an optimum solution. A new variant of algorithm called Dynamic Ant Colony System with Three Level Updates (DACS3) has been developed which focuses on adding individual ant behavior. It has been applied in Capacitated Vehicle Routing Problem (CVRP). Therefore, this research aims to improve its solution by applying elitist ant concept, rearrange its selection of candidates and to include current status of vehicle capacity as part of its decision making. The result shows that DACS3 has achieve a better solution for most of the datasets. Applying elitist concept, rearrangement of candidate selection and vehicle capacity as part of its decision making can influence its achievement to reach an optimal distance.",
keywords = "Ant Colony, Dynamic candidate, Optimization, Suitability factor, Vehicle Routing",
author = "Rais, {Helmi Md} and {Ali Othman}, Zulaiha and Hamdan, {Abdul Razak}",
year = "2010",
doi = "10.1109/ITSIM.2010.5561552",
language = "English",
isbn = "9781424467181",
volume = "2",
pages = "794--799",
booktitle = "Proceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10",

}

TY - GEN

T1 - Suitability factor on the capacitated vehicle routing problem

AU - Rais, Helmi Md

AU - Ali Othman, Zulaiha

AU - Hamdan, Abdul Razak

PY - 2010

Y1 - 2010

N2 - Finding a good solution for logistics and transportation industries is a continuous effort to maximize the efficiencies especially on problem that relates to the industry such as Vehicle Routing Problem (VRP). One of the most popular solutions is using Ant Colony System (ACS) algorithm. Several versions of ACOs have been proposed which aim to achieve an optimum solution. A new variant of algorithm called Dynamic Ant Colony System with Three Level Updates (DACS3) has been developed which focuses on adding individual ant behavior. It has been applied in Capacitated Vehicle Routing Problem (CVRP). Therefore, this research aims to improve its solution by applying elitist ant concept, rearrange its selection of candidates and to include current status of vehicle capacity as part of its decision making. The result shows that DACS3 has achieve a better solution for most of the datasets. Applying elitist concept, rearrangement of candidate selection and vehicle capacity as part of its decision making can influence its achievement to reach an optimal distance.

AB - Finding a good solution for logistics and transportation industries is a continuous effort to maximize the efficiencies especially on problem that relates to the industry such as Vehicle Routing Problem (VRP). One of the most popular solutions is using Ant Colony System (ACS) algorithm. Several versions of ACOs have been proposed which aim to achieve an optimum solution. A new variant of algorithm called Dynamic Ant Colony System with Three Level Updates (DACS3) has been developed which focuses on adding individual ant behavior. It has been applied in Capacitated Vehicle Routing Problem (CVRP). Therefore, this research aims to improve its solution by applying elitist ant concept, rearrange its selection of candidates and to include current status of vehicle capacity as part of its decision making. The result shows that DACS3 has achieve a better solution for most of the datasets. Applying elitist concept, rearrangement of candidate selection and vehicle capacity as part of its decision making can influence its achievement to reach an optimal distance.

KW - Ant Colony

KW - Dynamic candidate

KW - Optimization

KW - Suitability factor

KW - Vehicle Routing

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

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

U2 - 10.1109/ITSIM.2010.5561552

DO - 10.1109/ITSIM.2010.5561552

M3 - Conference contribution

AN - SCOPUS:78049380828

SN - 9781424467181

VL - 2

SP - 794

EP - 799

BT - Proceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10

ER -