IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v183y2007i3p1280-1294.html
   My bibliography  Save this article

A dynamic adaptive local search algorithm for the circular packing problem

Author

Listed:
  • Hifi, M.
  • M'Hallah, R.

Abstract

No abstract is available for this item.

Suggested Citation

  • Hifi, M. & M'Hallah, R., 2007. "A dynamic adaptive local search algorithm for the circular packing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1280-1294, December.
    • Handle: RePEc:eee:ejores:v:183:y:2007:i:3:p:1280-1294
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00304-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Hifi, Mhand & Paschos, Vangelis Th. & Zissimopoulos, Vassilis, 2004. "A simulated annealing approach for the circular cutting problem," European Journal of Operational Research, Elsevier, vol. 159(2), pages 430-448, December.
    2. George, John A. & George, Jennifer M. & Lamar, Bruce W., 1995. "Packing different-sized circles into a rectangular container," European Journal of Operational Research, Elsevier, vol. 84(3), pages 693-712, August.
    3. Wang, P. Y. & Wascher, G., 2002. "Cutting and packing," European Journal of Operational Research, Elsevier, vol. 141(2), pages 239-240, September.
    4. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    5. Wang, Huaiqing & Huang, Wenqi & Zhang, Quan & Xu, Dongming, 2002. "An improved algorithm for the packing of unequal circles within a larger containing circle," European Journal of Operational Research, Elsevier, vol. 141(2), pages 440-453, September.
    6. Bischoff, E. E. & Wascher, G., 1995. "Cutting and packing," European Journal of Operational Research, Elsevier, vol. 84(3), pages 503-505, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. I Al-Mudahka & M Hifi & R M'Hallah, 2011. "Packing circles in the smallest circle: an adaptive hybrid algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 1917-1930, November.
    2. Zeng, Zhizhong & Yu, Xinguo & He, Kun & Huang, Wenqi & Fu, Zhanghua, 2016. "Iterated Tabu Search and Variable Neighborhood Descent for packing unequal circles into a circular container," European Journal of Operational Research, Elsevier, vol. 250(2), pages 615-627.
    3. Josef Kallrath & Joonghyun Ryu & Chanyoung Song & Mokwon Lee & Deok-Soo Kim, 2021. "Near optimal minimal convex hulls of disks," Journal of Global Optimization, Springer, vol. 80(3), pages 551-594, July.
    4. Lai, Xiangjing & Hao, Jin-Kao & Yue, Dong & Lü, Zhipeng & Fu, Zhang-Hua, 2022. "Iterated dynamic thresholding search for packing equal circles into a circular container," European Journal of Operational Research, Elsevier, vol. 299(1), pages 137-153.
    5. Ryu, Joonghyun & Lee, Mokwon & Kim, Donguk & Kallrath, Josef & Sugihara, Kokichi & Kim, Deok-Soo, 2020. "VOROPACK-D: Real-time disk packing algorithm using Voronoi diagram," Applied Mathematics and Computation, Elsevier, vol. 375(C).

    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. Castillo, Ignacio & Kampas, Frank J. & Pintér, János D., 2008. "Solving circle packing problems by global optimization: Numerical results and industrial applications," European Journal of Operational Research, Elsevier, vol. 191(3), pages 786-802, December.
    2. Ronald E. Giachetti & Jean Carlo Sanchez, 2009. "A model to design recreational boat mooring fields," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(2), pages 158-174, March.
    3. Fu, Zhanghua & Huang, Wenqi & Lü, Zhipeng, 2013. "Iterated tabu search for the circular open dimension problem," European Journal of Operational Research, Elsevier, vol. 225(2), pages 236-243.
    4. K A Dowsland & M Gilbert & G Kendall, 2007. "A local search approach to a circle cutting problem arising in the motor cycle industry," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 429-438, April.
    5. W Q Huang & Y Li & H Akeb & C M Li, 2005. "Greedy algorithms for packing unequal circles into a rectangular container," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 539-548, May.
    6. T. Kubach & A. Bortfeldt & H. Gehring, 2009. "Parallel greedy algorithms for packing unequal circles into a strip or a rectangle," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 17(4), pages 461-477, December.
    7. Reinaldo Morabito & Vitória Pureza, 2010. "A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem," Annals of Operations Research, Springer, vol. 179(1), pages 297-315, September.
    8. Morabito, Reinaldo & Belluzzo, Luciano, 2007. "Optimising the cutting of wood fibre plates in the hardboard industry," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1405-1420, December.
    9. Cherri, Adriana Cristina & Arenales, Marcos Nereu & Yanasse, Horacio Hideki & Poldi, Kelly Cristina & Gonçalves Vianna, Andréa Carla, 2014. "The one-dimensional cutting stock problem with usable leftovers – A survey," European Journal of Operational Research, Elsevier, vol. 236(2), pages 395-402.
    10. Hakim Akeb & Mhand Hifi, 2010. "A hybrid beam search looking-ahead algorithm for the circular packing problem," Journal of Combinatorial Optimization, Springer, vol. 20(2), pages 101-130, August.
    11. Hifi, Mhand & Yousef, Labib, 2019. "A local search-based method for sphere packing problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 482-500.
    12. López, C.O. & Beasley, J.E., 2016. "A formulation space search heuristic for packing unequal circles in a fixed size circular container," European Journal of Operational Research, Elsevier, vol. 251(1), pages 64-73.
    13. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    14. Francisco Trespalacios & Ignacio E. Grossmann, 2017. "Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem," Annals of Operations Research, Springer, vol. 258(2), pages 747-759, November.
    15. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    16. Anshu Ranjan & Pramod Khargonekar & Sartaj Sahni, 2017. "Offline first-fit decreasing height scheduling of power loads," Journal of Scheduling, Springer, vol. 20(5), pages 527-542, October.
    17. Russo, Mauro & Sforza, Antonio & Sterle, Claudio, 2013. "An improvement of the knapsack function based algorithm of Gilmore and Gomory for the unconstrained two-dimensional guillotine cutting problem," International Journal of Production Economics, Elsevier, vol. 145(2), pages 451-462.
    18. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
    19. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    20. Alfieri, Arianna & van de Velde, Steef & Woeginger, Gerhard J., 2007. "Roll cutting in the curtain industry, or: A well-solvable allocation problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1397-1404, December.

    More about this item

    Statistics

    Access and download statistics

    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:ejores:v:183:y:2007:i:3:p:1280-1294. 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.elsevier.com/locate/eor .

    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.