Learning with Delayed Rewards in Ant Systems for the Job-Shop Scheduling Problem

Authors:
Urszula Boryczka
Affiliations:
-
Venue:
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Year:
1998

Citing 2
Cited 0

A comparison of Q-learning and classifier systems

SAB94 Proceedings of the third international conference on Simulation of adaptive behavior : from animals to animats 3: from animals to animats 3
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We apply the idea of learning with delayed rewards to improve performance of the Ant System. We will mention different mechanisms of delayed rewards in the Ant Algorithm (AA). The AA for JSP was first applied in classical form by A. Colorni and M. Dorigo.We adapt an idea of an evolution of the algorithm itself using the methods of the learning process. We accentuate the co-operation and stigmergy effect in this algorithm. We propose the optimal values of the parameters used in this version of the AA, derived as a result of our experiments.