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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berkey, J.O., Wang, P.Y.: Two-dimensional finite bin packing algorithms. Journal of the Operational Research Society 38, 423–429 (1987)
Mukhacheva, E.A., Valeeva, A.F., Kartak, V.M., Filippova, A.S.: Models and methods for orthogonal packing and cutting problems: analytical review. Application to Journal of Information Technologies 5, 1–17 (2004)
FIPA Request Interaction Protocol Specification, http://www.fipa.org/specs
Jedrzejowicz, J., Jedrzejowicz, P.: Agent-Based Approach to Solving Difficult Scheduling Problems. In: Ali, M., Dapoigny, R. (eds.) IEA/AIE 2006. LNCS (LNAI), vol. 4031, pp. 24–33. Springer, Heidelberg (2006)
Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing 11, 345–357 (1999)
Martello, S., Vigo, D.: Exact solution of the two-dimensional finite bin packing problem. Management Science 44, 388–399 (1998)
Parinov, S.I.: Toward a theory and agent based model of the networked economy (July 1999), http://rvles.ieie.nsc.ru/parinov/theory/eng/index.htm
Parunak, H.V.D.: Agents in Overalls: Experiences and Issues in the Development and Deployment of Industrial Agent-Based Sytems, Intern. J. of Cooperative Information Systems 9(3), 209–228 (2000)
Polyakovsky, S., M’Hallah, R.: An agent-based approach to the two-dimensional guillotine bin packing problem. European Journal of Operational Research (submitted 2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Polyakovsky, S., M’Hallah, R. (2007). An Agent-Based Approach to Knapsack Optimization Problems. In: Okuno, H.G., Ali, M. (eds) New Trends in Applied Artificial Intelligence. IEA/AIE 2007. Lecture Notes in Computer Science(), vol 4570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73325-6_110
Download citation
DOI: https://doi.org/10.1007/978-3-540-73325-6_110
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73322-5
Online ISBN: 978-3-540-73325-6
eBook Packages: Computer ScienceComputer Science (R0)