A flexible labour division approach to the polygon packing problem based on space allocation

This paper deals with the two-dimensional satellite module polygon packing problem. Based on the duality of material and space, it regards the polygon packing problem as a space allocation problem, which involves allocating the container space to the given polygons reasonably and efficiently. Ant colony’s labour division is essentially a kind of task allocation. Using this task allocation to achieve the space allocation in polygon packing problems, a flexible labour division approach (FLD) is proposed based on the response threshold model. According to the characteristics of space allocation in polygon packing problems, FLD designs three actions for polygons to occupy the container space. With the interaction between environmental stimulus and response threshold, each polygon takes an appropriate action to complete the space allocation and a layout that meets the requirements of satellite module layout is obtained. The results of standard test instances demonstrate the effectiveness of FLD when compared with self-organisation emergence algorithm. Moreover, experiments on the general polygon packing problem also show that FLD is competitive with other existing algorithms.

[1]  Ronald L. Rivest,et al.  Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[2]  Bernard Chazelle,et al.  The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation , 1983, IEEE Transactions on Computers.

[3]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[4]  G. Robinson.  Regulation of division of labor in insect societies. , 1992, Annual review of entomology.

[5]  Jacek Blazewicz,et al.  Using a tabu search approach for solving the two-dimensional irregular cutting problem , 1993, Ann. Oper. Res..

[6]  L. Fogel,et al.  European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 1996 .

[7]  Thomas Lengauer,et al.  A simulated annealing approach to the nesting problem in the textile manufacturing industry , 1995, Ann. Oper. Res..

[8]  E. Bonabeau,et al.  Quantitative study of the fixed threshold model for the regulation of division of labour in insect societies , 1996, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[9]  Hongfei Teng,et al.  An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles , 1999, Eur. J. Oper. Res..

[10]  K. Dowsland,et al.  A tabu thresholding implementation for the irregular stock cutting problem , 1999 .

[11]  Graham Kendall,et al.  Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem , 1999, Australian Joint Conference on Artificial Intelligence.

[12]  José Fernando Oliveira,et al.  TOPOS – A new constructive algorithm for nesting problems , 2000, OR Spectr..

[13]  Guy Theraulaz,et al.  Dynamic Scheduling and Division of Labor in Social Insects , 2000, Adapt. Behav..

[14]  Kathryn A. Dowsland,et al.  Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting , 2001, Manag. Sci..

[15]  Huaiqing Wang,et al.  An improved algorithm for the packing of unequal circles within a larger containing circle , 2002, Eur. J. Oper. Res..

[16]  Kathryn A. Dowsland,et al.  An algorithm for polygon placement using a bottom-left strategy , 2002, Eur. J. Oper. Res..

[17]  Wenqi Huang,et al.  A heuristic quasi-physical strategy for solving disks packing problem , 2002, Simul. Model. Pract. Theory.

[18]  Tai-Hsi Wu,et al.  Nesting of two-dimensional parts in multiple plates using hybrid algorithm , 2003 .

[19]  Jens Egeblad,et al.  Fast neighborhood search for two- and three-dimensional nesting problems , 2007, Eur. J. Oper. Res..

[20]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[21]  Wen-Chen Lee,et al.  A heuristic for nesting problems of irregular shapes , 2008, Comput. Aided Des..

[22]  Julia A. Bennell,et al.  The geometry of nesting problems: A tutorial , 2008, Eur. J. Oper. Res..

[23]  Toshihide Ibaraki,et al.  Solving the irregular strip packing problem via guided local search for overlap minimization , 2009, Int. Trans. Oper. Res..

[24]  Julia A. Bennell,et al.  A tutorial in irregular shape packing problems , 2009, J. Oper. Res. Soc..

[25]  Hiroshi Nagamochi,et al.  An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem , 2009, Discret. Optim..

[26]  Tao Zhen-wu.  Modeling and simulation of ant colony's labor division for virtual enterprises , 2009 .

[27]  Xiang Song,et al.  A beam search implementation for the irregular shape packing problem , 2010, J. Heuristics.

[28]  Wing-Keung Wong,et al.  A hybrid approach for packing irregular patterns using evolutionary strategies and neural network , 2010 .

[29]  X. Liu,et al.  Heuristic algorithm based on the principle of minimum total potential energy (HAPE): a new algorithm for nesting problems , 2011 .

[30]  Renbin Xiao,et al.  An intelligent approach to the irregular polygon layout problem based on adaptive artificial bee colony algorithm , 2012, Int. J. Comput. Appl. Technol..

[31]  Renbin Xiao,et al.  Modeling and Simulation of Ant Colony's Labor Division with Constraints for Task Allocation of Resilient Supply Chains , 2012, Int. J. Artif. Intell. Tools.

[32]  Stephen C. H. Leung,et al.  Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem , 2012, Comput. Oper. Res..

[33]  Renbin Xiao,et al.  Modeling of Ant Colony's Labor Division for the Multi-Project Scheduling Problem and Its Solution by PSO , 2012 .

[34]  Renbin Xiao,et al.  An emergent computation approach to the problem of polygon layout with performance constraints , 2013 .

[35]  Mohamed Kashkoush,et al.  A Particle Swarm Optimization Algorithm for a 2-D Irregular Strip Packing Problem , 2013 .

[36]  Javier de Lope Asiaín,et al.  Response threshold models and stochastic learning automata for self-coordination of heterogeneous multi-task distribution in multi-robot systems , 2013, Robotics Auton. Syst..

[37]  Edmund K. Burke,et al.  An effective heuristic for the two-dimensional irregular bin packing problem , 2013, Annals of Operations Research.

[38]  Ahmed Elkeran,et al.  A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering , 2013, Eur. J. Oper. Res..

[39]  Plácido Rogério Pinheiro,et al.  Dealing with Nonregular Shapes Packing , 2014 .

[40]  Keping Long,et al.  Task coalition formation and self-adjustment in the wireless sensor networks , 2014, Int. J. Commun. Syst..

[41]  Miguel Cezar Santoro,et al.  Irregular packing: MILP model based on a polygonal enclosure , 2015, Ann. Oper. Res..

[42]  Maria Antónia Carravilla,et al.  Robust mixed-integer linear programming models for the irregular strip packing problem , 2016, Eur. J. Oper. Res..

[43]  Plácido Rogério Pinheiro,et al.  Approaches to Tackle the Nesting Problems , 2016, CSOC.

[44]  Plácido Rogério Pinheiro,et al.  Computer Integrated , 2015 .

[45]  Roman Senkerik,et al.  Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of the 5th Computer Science On-line Conference 2016 (CSOC2016), Vol 1 , 2016, CSOC.

[46]  Anupam Agrawal,et al.  Crowdsourcing solutions to 2D irregular strip packing problems from Internet workers , 2016 .

[47]  Maria Antónia Carravilla,et al.  A semi-continuous MIP model for the irregular strip packing problem , 2016 .

[48]  Thiago de Castro Martins,et al.  A pairwise exact placement algorithm for the irregular nesting problem , 2016, Int. J. Comput. Integr. Manuf..