liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Towards an Ant Colony Optimization Algorithm for the Two-stage Knapsack Problem
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
2011 (English)In: Proceedings of the 7th ALIO/EURO Workshop on Applied Combinatorial Optimization / [ed] Ana Viana, A. Miguel Gomes, Joao Pedro Pedroso, Maria Teresa Costa, 2011, 27-27 p.Conference paper (Refereed)
Abstract [en]

We propose an Ant-Colony-Optimization algorithm for the Two-Stage Knapsack problem (TSKP) with discretely distributed weights. Three heuristic utility measures are proposed and compared. We argue why for the proposed measures it is more efficient to place pheromone on arcs instead of vertices or edges of the complete search graph. Numerical tests show that the algorithm is able to find near optimal or even optimal solutions after a relatively small number of generated solutions.

Place, publisher, year, edition, pages
2011. 27-27 p.
Keyword [en]
Two-stage model, Knapsack problem, Ant-Colony optimization, Meta-heuristic, Utility ratio
National Category
Computer Science
URN: urn:nbn:se:liu:diva-74519OAI: diva2:486472
7th ALIO/EURO Workshop on Applied Combinatorial Optimization
Available from: 2012-01-30 Created: 2012-01-30 Last updated: 2012-02-07

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Kosuch, Stefanie
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 7 hits
ReferencesLink to record
Permanent link

Direct link