An agent-based approach to the two-dimensional guillotine bin packing problem

European Journal of Operational Research

Volumn 192, Issue 3, 2009, Pages 767-781

  Polyakovsky, Sergey ^a   M'Hallah, Rym ^b  

^a Birsk Branch of Federal State Budgetary Educational Establishment of Higher Education Bashkir State University   (Russian Federation)

^b KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Agent based systems; Artificial intelligence; Cutting and packing; Heuristics; Two dimensional bin packing

Indexed keywords

AGENTS; COMPUTER NETWORKS; FINANCIAL DATA PROCESSING; TWO DIMENSIONAL;

AGENT-BASED SYSTEMS; ARTIFICIAL INTELLIGENCE; CUTTING AND PACKING; HEURISTICS; TWO-DIMENSIONAL BIN PACKING;

PROBLEM SOLVING;

EID: 51649108070     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.10.020     Document Type: Article

References (27)

1. Beasley J.E. A population heuristic for constrained two-dimensional non-guillotine cutting. European Journal of Operational Research 156 (2004) 601-627
2. Berkey J.O., and Wang P.Y. Two-dimensional finite bin packing algorithms. Journal of the Operational Research Society 38 (1987) 423-429
3. Binkley K.B., and Hagiwara M. Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic. European Journal of Operational Research 183 (2006) 1230-1248
4. Chung F.K.R., Garey M.R., and Johnson D.S. On packing two-dimensional bins. SIAM Journal of Algebraic and Discrete Methods 3 (1982) 66-76
5. Correa J.R. Near-optimal solutions to two-dimensional bin packing with 90° rotations. Electronic Notes in Discrete Mathematics 18 (2004) 89-95
6. Correa J.R. Resource augmentation in two-dimensional packing with orthogonal rotations. Operations Research Letters 34 (2006) 85-93
7. Dell Amico M., Martello S., and Vigo D. A lower bound for the non-oriented two-dimensional bin packing problem. Discrete Applied Mathematics 118 (2002) 13-24
8. Dowsland K. Some experiments with simulated annealing techniques for packing problems. European Journal of Operational Research 68 (1993) 389-399
9. Faero O., Pisinger D., and Zachariasen M. Guided local search for the three-dimensional bin packing problem. INFORMS Journal on Computing 15 (2003) 267-283
10. Fekete S.P., and Schepers J. A general framework for bounds for higher-dimensional orthogonal packing problems. Mathematical Methods of Operations Research 60 (2004) 311-329
11. FIPA Interaction Protocol Specification. .
12. Hopper E., and Turton B.C.H. An empirical investigation of metaheuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research 128 (2001) 34-57
13. Lodi A., Martello S., and Vigo D. Neighborhood search algorithm for the guillotine non-oriented two-dimensional bin packing problem. In: Voss S., Martello S., Osman I.H., and Roucairol C. (Eds). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization (1998), Kluwer Academic Publishers, Boston 125-139
14. Lodi A., Martello S., and Vigo D. Approximation algorithms for the oriented two-dimensional bin packing problem. European Journal of Operational Research 112 (1999) 158-166
15. Lodi A., Martello S., and Vigo D. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing 11 (1999) 345-357
16. Lodi A., Martello S., and Vigo D. Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics 123 (2002) 379-396
17. Lodi A., Martello S., and Vigo D. Two-dimensional packing problems: A survey. European Journal of Operational Research 141 (2002) 241-252
18. Martello S., and Vigo D. Exact solution of the two-dimensional finite bin packing problem. Management Science 44 (1998) 388-399
19. Mes M., van der Heijden M., and van Harten A. Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems. European Journal of Operational Research 181 (2007) 59-75
20. Mukhacheva E.A., Valeeva A.F., Kartak V.M., and Filippova A.S. Models for orthogonal packing and cutting problems: An analytical review. Application Journal of Information Technologies 5 (2004) 1-17
21. S.I. Parinov, Toward a theory and agent based model of the networked economy, 1999. .
22. S. Polyakovsky, R. M'Hallah, An agent-based approach to knapsack optimization problems, in: H.G. Okuno, A. Moonis (Eds.), Lecture Notes in Artificial Intelligence, vol. 4570, 2007, pp. 1098-1107.
23. Puchinger J., and Raidl G.R. Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research 183 (2006) 1304-1327
24. Schneider W. Trim-loss minimization in a crepe-rubber mill: Optimal solution versus heuristic in the 2(3)-dimensional case. European Journal of Operational Research 34 (1998) 273-281
25. Stoyan Y.G. Mathematical methods for geometric design. Advances in CAD/CAM: Proceeding PROLAMAT'82, Leningrad, USSR, 16-18 May 1982 (2003), North Holland 67-86
26. Vasko F.G., Wolf F.E., and Stott K.L. A practical solution to a fuzzy two-dimensional cutting stock problem. Fuzzy Sets and Systems 29 (1989) 259-275
27. Wäscher G., Haussner H., and Schumann H. An improved typology of cutting and packing problems. European Journal of Operational Research 183 (2007) 1109-1130