figshare
Browse

File(s) under permanent embargo

An agent-based approach to knapsack optimization problems

conference contribution
posted on 2007-01-01, 00:00 authored by Sergey PolyakovskiySergey Polyakovskiy, Rym M'Hallah
This paper proposes a new artificial intelligence framework that solves knapsack related problems (a class of complex combinatorial optimization problems). This framework, which is pseudo-parallel and stochastic, uses an agent based system to approximately solve the optimization problem. The system consists of active agents interacting in real time. They mimic the behavior of the parameters of the optimization problem while being individually driven by their own parameters, decision process, and fitness assessment. The application of the framework to the two-dimensional guillotine bin packing problem demonstrates its effectiveness both in terms of solution quality and run time.

History

Volume

4570

Pagination

1098-1107

Location

Kyoto, Japan

Start date

2007-06-26

End date

2007-06-29

ISSN

0302-9743

eISSN

1611-3349

ISBN-13

978-3-540-73322-5

Language

English

Publication classification

E1.1 Full written paper - refereed

Editor/Contributor(s)

Okuno HG, Ali M

Title of proceedings

New Trends in Applied Artificial Intelligence. IEA/AIE 2007

Event

20th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems

Publisher

Springer

Place of publication

Berlin, Germany

Series

Lecture Notes in Artificial Intelligence

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC