Constraints in container loading – A state-of-the-art review

Bortfeldt, Andreas; Wäscher, Gerhard

doi:10.1016/j.ejor.2012.12.006

Cited by 287 publications

(184 citation statements)

References 130 publications

Supporting

Mentioning

178

Contrasting

Unclassified

Order By: Relevance

“…The basic geometric feasibility conditions are: [6] • the small items are positioned within the container,…”

Section: Introductionmentioning

confidence: 99%

“…The Container Loading Problem algorithms are responsible for assigning threedimensional small items to three-dimensional rectangular large objects (i.e., truck, containers, pallet). Its aim is to hold the basic geometric feasibility conditions and reach the defined problem specific objective function [6].…”

Section: Introductionmentioning

confidence: 99%

“…Generally it is responsible for assigning strongly heterogeneous items into a minimum number of containers. In the case of warehouses, Bin Packing algorithms are used, for example, when the customer order has to be separated to ULs, because of, for example, a large quantity order or a high number of items [6].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Necessity and complexity of order picking routing optimisation based on pallet loading features

Bódis

Botzheim

Földesi

2017

Acta Universitatis Sapientiae, Informatica

View full text Add to dashboard Cite

Abstract. Order picking is the most labour-intensive and costly activity of warehouses. The main challenges of its improvement are the synchronisation of warehouse layout, storage assignment policy, routing, zoning, and batching. Furthermore, the competitiveness of the warehouse depends on how it adapts to the unique customer demands and product parameters and the changes. The operators usually have to manage the picking sequence based on best practices taking into consideration the product stacking factors and minimising the lead time. It is usually necessary to support the operators by making effective decisions. Researchers of the pallet loading problem, bin packing problem, and order picking optimisation provide a wide horizon of solutions but their results are rarely synchronised. Necessity and complexity of OPRO based on PLF 163The research defines the order picking routing problem based on Pallet Loading Feature (PLF). It describes measurement and product stacking rule evaluation methods to highlight when the PLF based optimisation is necessary. The paper shows that in order picking problems based on PLF, the number of combinations a brute-force search algorithm has to examine grows exponentially, which highlights the importance of meta-heuristic optimisation. The study describes a Simulated Annealing algorithm for order picking based on PLF.

show abstract

“…The basic geometric feasibility conditions are: [6] • the small items are positioned within the container,…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Necessity and complexity of order picking routing optimisation based on pallet loading features

Bódis

Botzheim

Földesi

2017

Acta Universitatis Sapientiae, Informatica

View full text Add to dashboard Cite

show abstract

“…Many practical constraints in air cargo industry are mathematically formulated in their paper. More definition and review of constraints used so far in container loading problem especially in air cargo industry can be found in [22] …”

Section: Literature Reviewmentioning

confidence: 99%

Air Cargo Loading Management System for Logistics Forwarders

2016

International Conference on Urban Planning, Transport and Construction Engineering (ICUPTCE-16) Jan. 2-3, 2016 Pattaya (Thailan

View full text Add to dashboard Cite

show abstract

“…[3] makes a state-of-the-art review about the container loading problem: the bin packing problem can be used to pack a set of cargo into a minimum number of containers. It can also be used to solve assembly line balancing problems [4] or multiprocessor scheduling problems [5].…”

Section: Introductionmentioning

confidence: 99%

An Analogy between Bin Packing Problem and Permutation Problem: A New Encoding Scheme

Gourgand

Grangeon

Klement

2014

Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications

View full text Add to dashboard Cite

Part 2: Knowledge Discovery and SharingInternational audienceThe bin packing problem aims to pack a set of items in a minimum number of bins, with respect to the size of the items and capacity of the bins. This is an NP-hard problem. Several approach methods have been developed to solve this problem. In this paper, we propose a new encoding scheme which is used in a hybrid resolution: a metaheuristic is matched with a list algorithm (Next Fit, First Fit, Best Fit) to solve the bin packing problem. Any metaheuristic can be used but in this paper, our proposition is implemented on a single solution based metaheuristic (stochastic descent, simulated annealing, kangaroo algorithm). This hybrid method is tested on literature instances to ensure its good results

show abstract

Constraints in container loading – A state-of-the-art review

Cited by 287 publications

References 130 publications

Necessity and complexity of order picking routing optimisation based on pallet loading features

Necessity and complexity of order picking routing optimisation based on pallet loading features

Air Cargo Loading Management System for Logistics Forwarders

An Analogy between Bin Packing Problem and Permutation Problem: A New Encoding Scheme

Contact Info

Product

Resources

About