Fast permutation learning

Authors:
Tony Wauters;Katja Verbeeck;Patrick De Causmaecker;Greet Vanden Berghe
Affiliations:
CODeS Group, KAHO Sint-Lieven, Gent, Belgium;CODeS Group, KAHO Sint-Lieven, Gent, Belgium;CODeS Group, K.U. Leuven Campus Kortrijk, Kortrijk, Belgium;CODeS Group, KAHO Sint-Lieven, Gent, Belgium
Venue:
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Year:
2012

Citing 5
Cited 0

Learning automata: an introduction

Learning automata: an introduction
Fast probabilistic modeling for combinatorial optimization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Networks of Learning Automata: Techniques for Online Stochastic Optimization

Networks of Learning Automata: Techniques for Online Stochastic Optimization
Learning Permutations with Exponential Weights

The Journal of Machine Learning Research
A game theoretic approach to decentralized multi-project scheduling

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Permutations occur in a great variety of optimization problems, such as routing, scheduling and assignment problems. The present paper introduces the use of learning automata for the online learning of good quality permutations. Several centralized and decentralized methods using individual and common rewards are presented. The performance, memory requirement and scalability of the presented methods is analyzed. Results on well known benchmark problems show interesting properties. It is also demonstrated how these techniques are successfully applied to multi-project scheduling problems.