IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v392y2013i20p5074-5088.html
   My bibliography  Save this article

An emergent computation approach to the problem of polygon layout with performance constraints

Author

Listed:
  • Huang, Zhendong
  • Xiao, Renbin

Abstract

We address the two-dimensional satellite irregular polygons layout problem (TDSIPLP). By mapping the layout problem to a physical system, we present a self-organization emergence algorithm (SEA) based on a multi-agent system (MAS). SEA uses information on the local energy of agents and neighborhood rules to guide interactions between the agents and the environment. System self-organization evolves at a microcosmic level and eventually yields a layout that meets the performance constraints for a satellite. Experiments show that SEA can provide much better performance than other optimization techniques, such as generalized simulated annealing (GSA).

Suggested Citation

  • Huang, Zhendong & Xiao, Renbin, 2013. "An emergent computation approach to the problem of polygon layout with performance constraints," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(20), pages 5074-5088.
  • Handle: RePEc:eee:phsmap:v:392:y:2013:i:20:p:5074-5088
    DOI: 10.1016/j.physa.2013.05.043
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437113004858
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2013.05.043?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chen, Yong & Zhang, Pan, 2006. "Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 371(2), pages 627-632.
    2. Chen, Yu-Wang & Zhu, Yao-Jia & Yang, Gen-Ke & Lu, Yong-Zai, 2011. "Improved extremal optimization for the asymmetric traveling salesman problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(23), pages 4459-4465.
    3. Bennell, Julia A. & Oliveira, Jose F., 2008. "The geometry of nesting problems: A tutorial," European Journal of Operational Research, Elsevier, vol. 184(2), pages 397-415, January.
    4. Tsallis, Constantino & Stariolo, Daniel A., 1996. "Generalized simulated annealing," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 233(1), pages 395-406.
    5. Zeng, Guo-Qiang & Lu, Yong-Zai & Mao, Wei-Jie & Chu, Jian, 2010. "Study on probability distributions for evolution in modified extremal optimization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(9), pages 1922-1930.
    6. Chen, Yu-Wang & Lu, Yong-Zai & Chen, Peng, 2007. "Optimization with extremal dynamics for the traveling salesman problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 385(1), pages 115-123.
    7. Argollo de Menezes, M. & Lima, A.R., 2003. "Using entropy-based methods to study general constrained parameter optimization problems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 323(C), pages 428-434.
    8. Burke, E.K. & Hellier, R.S.R. & Kendall, G. & Whitwell, G., 2007. "Complete and robust no-fit polygon generation for the irregular stock cutting problem," European Journal of Operational Research, Elsevier, vol. 179(1), pages 27-49, May.
    9. Mosetti, Giancarlo & Jug, Giancarlo & Scalas, Enrico, 2007. "Power laws from randomly sampled continuous-time random walks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 375(1), pages 233-238.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chen, Yu-Wang & Zhu, Yao-Jia & Yang, Gen-Ke & Lu, Yong-Zai, 2011. "Improved extremal optimization for the asymmetric traveling salesman problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(23), pages 4459-4465.
    2. Juan Lu & Chengyi Ou & Chen Liao & Zhenkun Zhang & Kai Chen & Xiaoping Liao, 2021. "Formal modelling of a sheet metal smart manufacturing system by using Petri nets and first-order predicate logic," Journal of Intelligent Manufacturing, Springer, vol. 32(4), pages 1043-1063, April.
    3. Qiang Luo & Yunqing Rao, 2022. "Improved Sliding Algorithm for Generating No-Fit Polygon in the 2D Irregular Packing Problem," Mathematics, MDPI, vol. 10(16), pages 1-18, August.
    4. Leao, Aline A.S. & Toledo, Franklina M.B. & Oliveira, José Fernando & Carravilla, Maria Antónia & Alvarez-Valdés, Ramón, 2020. "Irregular packing problems: A review of mathematical models," European Journal of Operational Research, Elsevier, vol. 282(3), pages 803-822.
    5. J A Bennell & J F Oliveira, 2009. "A tutorial in irregular shape packing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 93-105, May.
    6. Alvarez-Valdes, R. & Martinez, A. & Tamarit, J.M., 2013. "A branch & bound algorithm for cutting and packing irregularly shaped pieces," International Journal of Production Economics, Elsevier, vol. 145(2), pages 463-477.
    7. Chehrazad, Sahar & Roose, Dirk & Wauters, Tony, 2022. "A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation," European Journal of Operational Research, Elsevier, vol. 300(3), pages 809-826.
    8. Jäck, Christian & Gönsch, Jochen, 2024. "How to load your auto carrier. A hybrid packing approach for the auto-carrier loading problem," European Journal of Operational Research, Elsevier, vol. 315(3), pages 1167-1181.
    9. Igor Kierkosz & Maciej Łuczak, 2019. "A one-pass heuristic for nesting problems," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 29(1), pages 37-60.
    10. Qin, Yichen & Ng, Kam K.H., 2023. "Analysing the impact of collaborations between airlines and maintenance service company under MRO outsourcing mode: Perspective from airline's operations," Journal of Air Transport Management, Elsevier, vol. 109(C).
    11. Eunice López-Camacho & Gabriela Ochoa & Hugo Terashima-Marín & Edmund Burke, 2013. "An effective heuristic for the two-dimensional irregular bin packing problem," Annals of Operations Research, Springer, vol. 206(1), pages 241-264, July.
    12. E. K. Burke & R. S. R. Hellier & G. Kendall & G. Whitwell, 2010. "Irregular Packing Using the Line and Arc No-Fit Polygon," Operations Research, INFORMS, vol. 58(4-part-1), pages 948-970, August.
    13. Miguel Santoro & Felipe Lemos, 2015. "Irregular packing: MILP model based on a polygonal enclosure," Annals of Operations Research, Springer, vol. 235(1), pages 693-707, December.
    14. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.
    15. Akang Wang & Christopher L. Hanselman & Chrysanthos E. Gounaris, 2018. "A customized branch-and-bound approach for irregular shape nesting," Journal of Global Optimization, Springer, vol. 71(4), pages 935-955, August.
    16. Rubenthaler, Sylvain & Rydén, Tobias & Wiktorsson, Magnus, 2009. "Fast simulated annealing in with an application to maximum likelihood estimation in state-space models," Stochastic Processes and their Applications, Elsevier, vol. 119(6), pages 1912-1931, June.
    17. Nascimento, Paulo Jorge & Silva, Cristóvão & Antunes, Carlos Henggeler & Moniz, Samuel, 2024. "Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems," European Journal of Operational Research, Elsevier, vol. 317(1), pages 92-110.
    18. Moriguchi, Kai & Ueki, Tatsuhito & Saito, Masashi, 2020. "Establishing optimal forest harvesting regulation with continuous approximation," Operations Research Perspectives, Elsevier, vol. 7(C).
    19. Fabbri, Ricardo & Gonçalves, Wesley N. & Lopes, Francisco J.P. & Bruno, Odemir M., 2012. "Multi-q pattern analysis: A case study in image classification," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(19), pages 4487-4496.
    20. A. S. Santos & A. M. Madureira & M. L. R. Varela, 2018. "The Influence of Problem Specific Neighborhood Structures in Metaheuristics Performance," Journal of Mathematics, Hindawi, vol. 2018, pages 1-14, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:392:y:2013:i:20:p:5074-5088. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.