On the pheromone update rules of ant colony optimization approaches for the job shop scheduling problem

DSpace/Manakin Repository

On the pheromone update rules of ant colony optimization approaches for the job shop scheduling problem

Show full item record


Title: On the pheromone update rules of ant colony optimization approaches for the job shop scheduling problem
Author: Hoang, Huan Xuan
Abstract: Abstract: Ant Colony Optimization (ACO) system is an intelligent multi-agent system of the interacting artificial ants to solve the combinatorial optimization problems. Applying ACO approach in the typical NP-hard problem like job shop scheduling (JSS) problem is still an impressive and attractive challenge with the community. This paper proposes two improvements of ACO algorithm based on the convergence property of pheromone trails. Our improvements are better in both terms of accuracy and running time than the state-of-the-art Max-Min ant system by the simulation with the standard data sets. ?? 2008 Springer Berlin Heidelberg.
URI: http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/4616
Date: 2008

Files in this item

Files Size Format View
414.pdf 47.60Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record

Search DSpace


Advanced Search

Browse

My Account