Applying DACS3 in the capacitated vehicle routing problem

Helmi Md Rais, Zulaiha Ali Othman, Abdul Razak Hamdan

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

1 Citation (Scopus)

Abstract

Ant Colony System (ACS) is a well known optimization algorithm to find a good route solution for logistics and transportation industries such as Traveling Salesman Problem (TSP) or Vehicle Routing Problem (VRP), for the company maximize the efficiency and resource. Several versions of Ant Colony Optimization (ACO) algorithms have been proposed which aim to achieve an optimum solution includes Dynamic Ant Colony System with Three Level Updates (DACS3). DACS3 is an enhancement of ACS which focuses on adding individual ant behavior. The algorithm works better in TSP solution. This research aims to see the performance of DACS3 in VRP domain. The result shows that DACS3 has achieved a better solution for most the datasets of Capacitated Vehicle Routing Problem (CVRP). Embedding a simple behavior of a single ant influences its achievement to reach an optimal distance and also can perform considerably faster compare to other algorithm in TSP and CVRP.

Original languageEnglish
Title of host publicationINFOS2010 - 2010 7th International Conference on Informatics and Systems
Publication statusPublished - 2010
Event2010 7th International Conference on Informatics and Systems, INFOS2010 - Cairo
Duration: 28 Mar 201030 Mar 2010

Other

Other2010 7th International Conference on Informatics and Systems, INFOS2010
CityCairo
Period28/3/1030/3/10

Fingerprint

Vehicle routing
Traveling salesman problem
Ant colony optimization
Logistics
Industry

Keywords

  • Ant Colony Optimization (ACO)
  • Capacitated Vehicle Routing Problem (CVRP)
  • Dynamic Ant Colony System with three level updates (DACS3)

ASJC Scopus subject areas

  • Information Systems

Cite this

Rais, H. M., Ali Othman, Z., & Hamdan, A. R. (2010). Applying DACS3 in the capacitated vehicle routing problem. In INFOS2010 - 2010 7th International Conference on Informatics and Systems [5461803]

Applying DACS3 in the capacitated vehicle routing problem. / Rais, Helmi Md; Ali Othman, Zulaiha; Hamdan, Abdul Razak.

INFOS2010 - 2010 7th International Conference on Informatics and Systems. 2010. 5461803.

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

Rais, HM, Ali Othman, Z & Hamdan, AR 2010, Applying DACS3 in the capacitated vehicle routing problem. in INFOS2010 - 2010 7th International Conference on Informatics and Systems., 5461803, 2010 7th International Conference on Informatics and Systems, INFOS2010, Cairo, 28/3/10.
Rais HM, Ali Othman Z, Hamdan AR. Applying DACS3 in the capacitated vehicle routing problem. In INFOS2010 - 2010 7th International Conference on Informatics and Systems. 2010. 5461803
Rais, Helmi Md ; Ali Othman, Zulaiha ; Hamdan, Abdul Razak. / Applying DACS3 in the capacitated vehicle routing problem. INFOS2010 - 2010 7th International Conference on Informatics and Systems. 2010.
@inproceedings{4e172cf10c3843c29a543c72ab7ff1b9,
title = "Applying DACS3 in the capacitated vehicle routing problem",
abstract = "Ant Colony System (ACS) is a well known optimization algorithm to find a good route solution for logistics and transportation industries such as Traveling Salesman Problem (TSP) or Vehicle Routing Problem (VRP), for the company maximize the efficiency and resource. Several versions of Ant Colony Optimization (ACO) algorithms have been proposed which aim to achieve an optimum solution includes Dynamic Ant Colony System with Three Level Updates (DACS3). DACS3 is an enhancement of ACS which focuses on adding individual ant behavior. The algorithm works better in TSP solution. This research aims to see the performance of DACS3 in VRP domain. The result shows that DACS3 has achieved a better solution for most the datasets of Capacitated Vehicle Routing Problem (CVRP). Embedding a simple behavior of a single ant influences its achievement to reach an optimal distance and also can perform considerably faster compare to other algorithm in TSP and CVRP.",
keywords = "Ant Colony Optimization (ACO), Capacitated Vehicle Routing Problem (CVRP), Dynamic Ant Colony System with three level updates (DACS3)",
author = "Rais, {Helmi Md} and {Ali Othman}, Zulaiha and Hamdan, {Abdul Razak}",
year = "2010",
language = "English",
isbn = "9789774033964",
booktitle = "INFOS2010 - 2010 7th International Conference on Informatics and Systems",

}

TY - GEN

T1 - Applying DACS3 in the capacitated vehicle routing problem

AU - Rais, Helmi Md

AU - Ali Othman, Zulaiha

AU - Hamdan, Abdul Razak

PY - 2010

Y1 - 2010

N2 - Ant Colony System (ACS) is a well known optimization algorithm to find a good route solution for logistics and transportation industries such as Traveling Salesman Problem (TSP) or Vehicle Routing Problem (VRP), for the company maximize the efficiency and resource. Several versions of Ant Colony Optimization (ACO) algorithms have been proposed which aim to achieve an optimum solution includes Dynamic Ant Colony System with Three Level Updates (DACS3). DACS3 is an enhancement of ACS which focuses on adding individual ant behavior. The algorithm works better in TSP solution. This research aims to see the performance of DACS3 in VRP domain. The result shows that DACS3 has achieved a better solution for most the datasets of Capacitated Vehicle Routing Problem (CVRP). Embedding a simple behavior of a single ant influences its achievement to reach an optimal distance and also can perform considerably faster compare to other algorithm in TSP and CVRP.

AB - Ant Colony System (ACS) is a well known optimization algorithm to find a good route solution for logistics and transportation industries such as Traveling Salesman Problem (TSP) or Vehicle Routing Problem (VRP), for the company maximize the efficiency and resource. Several versions of Ant Colony Optimization (ACO) algorithms have been proposed which aim to achieve an optimum solution includes Dynamic Ant Colony System with Three Level Updates (DACS3). DACS3 is an enhancement of ACS which focuses on adding individual ant behavior. The algorithm works better in TSP solution. This research aims to see the performance of DACS3 in VRP domain. The result shows that DACS3 has achieved a better solution for most the datasets of Capacitated Vehicle Routing Problem (CVRP). Embedding a simple behavior of a single ant influences its achievement to reach an optimal distance and also can perform considerably faster compare to other algorithm in TSP and CVRP.

KW - Ant Colony Optimization (ACO)

KW - Capacitated Vehicle Routing Problem (CVRP)

KW - Dynamic Ant Colony System with three level updates (DACS3)

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

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

M3 - Conference contribution

AN - SCOPUS:77953155946

SN - 9789774033964

BT - INFOS2010 - 2010 7th International Conference on Informatics and Systems

ER -