Ant system for Job-shop scheduling

Authors

  • A. Colorni Dipartimento di Elettronica e Informazione, Politecnico di Milano
  • M. Dorigo Progetto di Intelligenza Artificiale e Robotica, Dipartimento di Elettronica e Informazione, Politecnico di Milano and Université Libre de Bruxelles
  • V. Maniezzo Joint Research Center, EC, Ispra Sita and Progetto di Intelligenza Artificiale e Robotica, Dipartimento di Elettronica e Informazione, Politecnico di Milano
  • M. Trubian Centro di Teoria dei Sistemi, Dipartimento di Elettronica e Informazione, Politecnico di Milano

Abstract

The study of natural processes has inspired several heuristic optimization algorithms which have proved to be very effective in combinatorial optimization. In this paper we show how a new heuristic called ant system, in which the search task is distributed over manysimple, loosely interacting agents, can be successfully applied to find good solutions of job-shop scheduling problems.

Downloads

Published

1995-01-01

How to Cite

Colorni, A., Dorigo, M., Maniezzo, V., & Trubian, M. (1995). Ant system for Job-shop scheduling. JORBEL - Belgian Journal of Operations Research, Statistics, and Computer Science, 34(1), 39–53. Retrieved from https://www.orbel.be/jorbel/index.php/jorbel/article/view/169

Issue

Vol. 34 No. 1 (1994)

Section

Articles