Skip to main content
Log in

A tabu search algorithm for the pallet loading problem

  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract.

This paper presents a new heuristic algorithm for the pallet loading problem, the problem of packing the maximum number of identical rectangular boxes onto a rectangular pallet. The problem arises in distribution and logistics and has many practical applications. We have developed a tabu search algorithm based on new types of moves. Instead of moving individual boxes, we propose moving blocks, sets of boxes with the same orientation. We have tested our algorithm on the whole sets Cover I and Cover II, usually taken as a reference for this problem, and we obtain excellent results in very short computing times.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to R. Alvarez-Valdes.

Additional information

Correspondence to: R. Alvarez-Valdes

This paper has been partially supported by the Project PBC-02-002, Consejeria de Ciencia y Tecnologia, JCCM, the Spanish Ministry of Science and Technology, DPI2002-02553 and the Valencian Science and Technology Agency, GRUPOS03/174

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alvarez-Valdes, R., Parreño, F. & Tamarit, J.M. A tabu search algorithm for the pallet loading problem. OR Spectrum 27, 43–61 (2005). https://doi.org/10.1007/s00291-004-0183-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-004-0183-5

Keywords:

Navigation