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

A global optimization algorithm for the three-dimensional packing problem

Author

Listed:
  • Faina, Loris

Abstract

No abstract is available for this item.

Suggested Citation

  • Faina, Loris, 2000. "A global optimization algorithm for the three-dimensional packing problem," European Journal of Operational Research, Elsevier, vol. 126(2), pages 340-354, October.
    • Handle: RePEc:eee:ejores:v:126:y:2000:i:2:p:340-354
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00292-1
    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. Gehring, H. & Menschner, K. & Meyer, M., 1990. "A computer-based heuristic for packing pooled shipment containers," European Journal of Operational Research, Elsevier, vol. 44(2), pages 277-288, January.
    2. Bischoff, Eberhard E. & Marriott, Michael D., 1990. "A comparative evaluation of heuristics for container loading," European Journal of Operational Research, Elsevier, vol. 44(2), pages 267-276, January.
    3. Faina, Loris, 1999. "An application of simulated annealing to the cutting stock problem," European Journal of Operational Research, Elsevier, vol. 114(3), pages 542-556, May.
    4. Haessler, Robert W. & Brian Talbot, F., 1990. "Load planning for shipments of low density products," European Journal of Operational Research, Elsevier, vol. 44(2), pages 289-299, January.
    5. Chen, C. S. & Lee, S. M. & Shen, Q. S., 1995. "An analytical model for the container loading problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 68-76, January.
    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. H-L Li & J-F Tsai & N-Z Hu, 2003. "A distributed global optimization method for packing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 419-425, April.
    2. Andreas Bortfeldt & Gerhard Wäscher, 2012. "Container Loading Problems - A State-of-the-Art Review," FEMM Working Papers 120007, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    3. Sciomachen, Anna & Tanfani, Elena, 2007. "A 3D-BPP approach for optimising stowage plans and terminal productivity," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1433-1446, December.
    4. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    5. Lorenzo Brunetta & Philippe Grégoire, 2005. "A General Purpose Algorithm for Three-Dimensional Packing," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 328-338, August.
    6. Hadj Salem, Khadija & Silva, Elsa & Oliveira, José Fernando & Carravilla, Maria Antónia, 2023. "Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry," European Journal of Operational Research, Elsevier, vol. 306(2), pages 549-566.
    7. Lim, A. & Rodrigues, B. & Wang, Y., 2003. "A multi-faced buildup algorithm for three-dimensional packing problems," Omega, Elsevier, vol. 31(6), pages 471-481, December.

    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. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    2. 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.
    3. Sciomachen, Anna & Tanfani, Elena, 2007. "A 3D-BPP approach for optimising stowage plans and terminal productivity," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1433-1446, December.
    4. Silva, Elsa & Ramos, António G. & Oliveira, José F., 2018. "Load balance recovery for multi-drop distribution problems: A mixed integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 62-75.
    5. Ambrosino, Daniela & Sciomachen, Anna & Tanfani, Elena, 2004. "Stowing a containership: the master bay plan problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(2), pages 81-99, February.
    6. Silvano Martello & David Pisinger & Daniele Vigo, 2000. "The Three-Dimensional Bin Packing Problem," Operations Research, INFORMS, vol. 48(2), pages 256-267, April.
    7. Kurt R. Heidelberg & Gregory S. Parnell & James E. Ames, 1998. "Automated air load planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(8), pages 751-768, December.
    8. Ramos, António G. & Silva, Elsa & Oliveira, José F., 2018. "A new load balance methodology for container loading problem in road transportation," European Journal of Operational Research, Elsevier, vol. 266(3), pages 1140-1152.
    9. Bischoff, E. E. & Ratcliff, M. S. W., 1995. "Issues in the development of approaches to container loading," Omega, Elsevier, vol. 23(4), pages 377-390, August.
    10. Pisinger, David, 2002. "Heuristics for the container loading problem," European Journal of Operational Research, Elsevier, vol. 141(2), pages 382-392, September.
    11. Lim, Andrew & Ma, Hong & Qiu, Chaoyang & Zhu, Wenbin, 2013. "The single container loading problem with axle weight constraints," International Journal of Production Economics, Elsevier, vol. 144(1), pages 358-369.
    12. Kim, Kap Hwan & Kim, Jae-Boum, 2002. "Determining load patterns for the delivery of assembly components under JIT systems," International Journal of Production Economics, Elsevier, vol. 77(1), pages 25-38, May.
    13. Leonardo Junqueira & Reinaldo Morabito & Denise Sato Yamashita, 2012. "MIP-based approaches for the container loading problem with multi-drop constraints," Annals of Operations Research, Springer, vol. 199(1), pages 51-75, October.
    14. Chen, C. S. & Lee, S. M. & Shen, Q. S., 1995. "An analytical model for the container loading problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 68-76, January.
    15. 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.
    16. Bischoff, E.E., 2006. "Three-dimensional packing of items with limited load bearing strength," European Journal of Operational Research, Elsevier, vol. 168(3), pages 952-966, February.
    17. Lim, A. & Rodrigues, B. & Wang, Y., 2003. "A multi-faced buildup algorithm for three-dimensional packing problems," Omega, Elsevier, vol. 31(6), pages 471-481, December.
    18. Thapatsuwan, Peeraya & Pongcharoen, Pupong & Hicks, Chris & Chainate, Warattapop, 2012. "Development of a stochastic optimisation tool for solving the multiple container packing problems," International Journal of Production Economics, Elsevier, vol. 140(2), pages 737-748.
    19. Alonso, M.T. & Alvarez-Valdes, R. & Iori, M. & Parreño, F. & Tamarit, J.M., 2017. "Mathematical models for multicontainer loading problems," Omega, Elsevier, vol. 66(PA), pages 106-117.
    20. Lorenzo Brunetta & Philippe Grégoire, 2005. "A General Purpose Algorithm for Three-Dimensional Packing," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 328-338, August.

    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:126:y:2000:i:2:p:340-354. 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.