Suitability Factor on the Capacitated Vehicle Routing Problem

Md Rais, Helmi and Ali Othman, Zulaiha and Hamdan, Abdul Razak (2010) Suitability Factor on the Capacitated Vehicle Routing Problem. In: The 4th International Symposium on Information Technology (ITSim 2010).

[img] PDF - Published Version
Restricted to Registered users only



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.

Item Type:Conference or Workshop Item (Paper)
Subjects:T Technology > T Technology (General)
Departments / MOR / COE:Departments > Computer Information Sciences
ID Code:2815
Deposited By: Mr. Helmi Md Rais
Deposited On:21 Sep 2010 00:34
Last Modified:19 Jan 2017 08:24

Repository Staff Only: item control page

Document Downloads

More statistics for this item...