A new rank based version of the Ant System. A computational study.

Bullnheimer, Bernd and Hartl, Richard F. and Strauß, Christine (1997) A new rank based version of the Ant System. A computational study. Working Papers SFB "Adaptive Information Systems and Modelling in Economics and Management Science", 1. SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, Vienna.

[img]
Preview
PDF
document.pdf

Download (244kB)

Abstract

The ant system is a new meta-heuristic for hard combinatorial optimization problems. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem (TSP), but has been also successfully applied to problems such as quadratic assignment, job-shop scheduling, vehicle routing and graph coloring.In this paper we introduce a new rank based version of the ant system and present results of a computational study, where we compare the ant system with simulated annealing and a genetic algorithm on several TSP instances. It turns out that our rank based ant system can compete with the other methods in terms of average behavior, and shows even better worst case behavior. (author's abstract)

Item Type: Paper
Keywords: ant system / metaheuristics / traveling salesman problem / combinatorial optimization
Divisions: Departments > Informationsverarbeitung u Prozessmanag. > Produktionsmanagement > Taudes
Departments > Finance, Accounting and Statistics > Statistics and Mathematics
Departments > Marketing > Service Marketing und Tourismus
Departments > Informationsverarbeitung u Prozessmanag. > Informationswirtschaft
Depositing User: Repository Administrator
Date Deposited: 22 Mar 2002 12:21
Last Modified: 22 Oct 2019 00:41
URI: https://epub.wu.ac.at/id/eprint/616

Actions

View Item View Item

Downloads

Downloads per month over past year

View more statistics