An agent-based approach to knapsack optimization problems

Authors:
Sergey Polyakovsky;Rym M'Hallah
Affiliations:
Department of Computer Science and Robotics, Ufa State Aviation Technical University, Ufa, Russia;Department of Statistics and Operations Research, Kuwait University, Safat, Kuwait
Venue:
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Year:
2007

Citing 3
Cited 1

Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

INFORMS Journal on Computing
Agent-based approach to solving difficult scheduling problems

IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems

An intelligent framework to online bin packing in a just-in-time environment

IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.