A GRASP approach to the container-loading problem

The container-loading problem aims to determine the arrangement of items in a container. We present GRMODGRASP, a new algorithm for the CLP based on the GRASP (greedy randomized adaptive search procedure) paradigm. We evaluate GRMODGRASP'S performance in terms of volume use and load stability a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE intelligent systems Ročník 20; číslo 4; s. 50 - 57
Hlavní autoři: Moura, A., Oliveira, J.F.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Los Alamitos IEEE 01.07.2005
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
cargo stability
Cargos
container-loading problem
Containers
Efficiency
GRASP (greedy randomized adaptive search procedure)
Heuristic
Logistics
Mathematical problems
Road transportation
Shipping
Stability
Volume
ISSN:1541-1672, 1941-1294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The container-loading problem aims to determine the arrangement of items in a container. We present GRMODGRASP, a new algorithm for the CLP based on the GRASP (greedy randomized adaptive search procedure) paradigm. We evaluate GRMODGRASP'S performance in terms of volume use and load stability and by comparing it with nine well-known algorithms. Our approach produces solutions that surpass other approaches' solutions in terms of volume use and cargo stability.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1541-1672
1941-1294
DOI:10.1109/MIS.2005.57