Title: Fast permutation learning
Authors: Wauters, Tony ×
Verbeeck, Katja
De Causmaecker, Patrick
Vanden Berghe, Greet #
Issue Date: 16-Jan-2012
Publisher: Springer
Host Document: LION 6 proceedings vol:LNCS 7219 pages:292-306
Series Title: Lecture notes in computer science
Conference: Learning and Intelligent OptimizatioN Conference edition:6 location:Paris, France date:16-20 January 2012
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.
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Technologiecluster Computerwetenschappen
Computer Science Technology TC, Technology Campuses Ghent and Aalst
Computer Science, Campus Kulak Kortrijk
Informatics Section
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.