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

Some experiments with simulated annealing techniques for packing problems

Author

Listed:
  • Dowsland, Kathryn A.

Abstract

No abstract is available for this item.

Suggested Citation

  • Dowsland, Kathryn A., 1993. "Some experiments with simulated annealing techniques for packing problems," European Journal of Operational Research, Elsevier, vol. 68(3), pages 389-399, August.
    • Handle: RePEc:eee:ejores:v:68:y:1993:i:3:p:389-399
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(93)90195-S
    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.

    Citations

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


    Cited by:

    1. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," 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. 22(4), pages 729-753, December.
    2. Song, X. & Chu, C.B. & Nie, Y.Y. & Bennell, J.A., 2006. "An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1870-1889, December.
    3. Lins, Lauro & Lins, Sostenes & Morabito, Reinaldo, 2002. "An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container," European Journal of Operational Research, Elsevier, vol. 141(2), pages 421-439, September.
    4. Dimitris Fouskakis & David Draper, 2002. "Stochastic Optimization: a Review," International Statistical Review, International Statistical Institute, vol. 70(3), pages 315-349, December.
    5. Ozdamar, Linet & Birbil, Sevket Ilker, 1998. "Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions," European Journal of Operational Research, Elsevier, vol. 110(3), pages 525-547, November.
    6. Oluf Faroe & David Pisinger & Martin Zachariasen, 2003. "Guided Local Search for the Three-Dimensional Bin-Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 267-283, August.
    7. Goncalves, Jose Fernando, 2007. "A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1212-1229, December.
    8. Vahrenkamp, Richard, 1996. "Random search in the one-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 95(1), pages 191-200, November.
    9. Welch, S. B. & Salhi, S., 1997. "The obnoxious p facility network location problem with facility interaction," European Journal of Operational Research, Elsevier, vol. 102(2), pages 302-319, October.
    10. Leung, T. W. & Chan, Chi Kin & Troutt, Marvin D., 2003. "Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 145(3), pages 530-542, March.
    11. Hopper, E. & Turton, B. C. H., 2001. "An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem," European Journal of Operational Research, Elsevier, vol. 128(1), pages 34-57, January.
    12. M Kumral & P A Dowd, 2005. "A simulated annealing approach to mine production scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 922-930, August.
    13. Kenmochi, Mitsutoshi & Imamichi, Takashi & Nonobe, Koji & Yagiura, Mutsunori & Nagamochi, Hiroshi, 2009. "Exact algorithms for the two-dimensional strip packing problem with and without rotations," European Journal of Operational Research, Elsevier, vol. 198(1), pages 73-83, October.
    14. 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.
    15. C.K.Y. Lin & Haley, K. B. & Sparks, C., 1995. "A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems," European Journal of Operational Research, Elsevier, vol. 83(2), pages 330-346, June.
    16. Polyakovsky, Sergey & M'Hallah, Rym, 2009. "An agent-based approach to the two-dimensional guillotine bin packing problem," European Journal of Operational Research, Elsevier, vol. 192(3), pages 767-781, February.
    17. David Pisinger & Mikkel Sigurd, 2007. "Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 36-51, February.
    18. A Ghanmi & R H A D Shaw, 2008. "Modelling and analysis of Canadian Forces strategic lift and pre-positioning options," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1591-1602, December.
    19. Dowsland, Kathryn A. & Soubeiga, Eric & Burke, Edmund, 2007. "A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation," European Journal of Operational Research, Elsevier, vol. 179(3), pages 759-774, June.
    20. Wei, Lijun & Oon, Wee-Chong & Zhu, Wenbin & Lim, Andrew, 2011. "A skyline heuristic for the 2D rectangular packing and strip packing problems," European Journal of Operational Research, Elsevier, vol. 215(2), pages 337-346, December.
    21. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2019. "Dynamic pricing for vehicle ferries: Using packing and simulation to optimize revenues," European Journal of Operational Research, Elsevier, vol. 273(1), pages 288-304.
    22. Defu Zhang & Lijun Wei & Stephen C. H. Leung & Qingshan Chen, 2013. "A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 332-345, May.
    23. Heckmann, Ralf & Lengauer, Thomas, 1998. "Computing closely matching upper and lower bounds on textile nesting problems," European Journal of Operational Research, Elsevier, vol. 108(3), pages 473-489, August.
    24. Hugo Barros & Teresa Pereira & António G. Ramos & Fernanda A. Ferreira, 2021. "Complexity Constraint in the Distributor’s Pallet Loading Problem," Mathematics, MDPI, vol. 9(15), pages 1-20, July.
    25. Bouzid, Mouaouia Cherif & Salhi, Said, 2020. "Packing rectangles into a fixed size circular container: Constructive and metaheuristic search approaches," European Journal of Operational Research, Elsevier, vol. 285(3), pages 865-883.

    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:68:y:1993:i:3:p:389-399. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.