A Hybrid Genetic Algorithm for Packing in 3D with Deepest Bottom Left with Fill Method

Karabulut, Korhan; İnceoğlu, Mustafa Murat

doi:10.1007/978-3-540-30198-1_45

Cited by 49 publications

(23 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As packing heuristic, we use the same approach as in Krebs and Ehmke (2021), which is based on the deepest-bottom-left-fill (DBLF) algorithm proposed by Karabulut and İnceoğlu (2005). The algorithm is detailed in Alg.…”

Section: Packing Heuristicmentioning

confidence: 99%

Advanced loading constraints for 3D vehicle routing problems

2021

View full text Add to dashboard Cite

Given automated order systems, detailed characteristics of items and vehicles enable the detailed planning of deliveries including more efficient and safer loading of distribution vehicles. Many vehicle routing approaches ignore complex loading constraints. This paper focuses on the comprehensive evaluation of loading constraints in the context of combined Capacitated Vehicle Routing Problem and 3D Loading (3L-CVRP) and its extension with time windows (3L-VRPTW). To the best of our knowledge, this paper considers the currently largest number of loading constraints meeting real-world requirements and reducing unnecessary loading efforts for both problem variants. We introduce an approach for the load bearing strength of items ensuring a realistic load distribution between items. Moreover, we provide a new variant for the robust stability constraint enabling better performance and higher stability. In addition, we consider axle weights of vehicles to prevent overloaded axles for the first time for the 3L-VRPTW. Additionally, the reachability of items, balanced loading and manual unloading of items are taken into account. All loading constraints are implemented in a deepest-bottom-left-fill algorithm, which is embedded in an outer adaptive large neighbourhood search tackling the Vehicle Routing Problem. A new set of 600 instances is created, published and used to evaluate all loading constraints in terms of solution quality and performance. The efficiency of the hybrid algorithm is evaluated by three well-known instance sets. We outperform the benchmarks for most instance sets from the literature. Detailed results and the implementation of loading constraints are published online.

show abstract

Section: Packing Heuristicmentioning

confidence: 99%

Advanced loading constraints for 3D vehicle routing problems

2021

View full text Add to dashboard Cite

show abstract

“…Огляд робіт, присвячених роз в'я занню тривимірних задач упаковки, свідчить, що дослідники використовують велику кількість різноманітних методів. Ці методи можна розпо-ділити на такі групи: евристичні методи [4][5][6][7]; традиційні методи оптимізації [8,9]; змішані підходи [10,11]. В них використовують евристики і методи нелінійної оптимізації.…”

Section: молоді вченіunclassified

Mathematical and computer modelling of optimiza-tion 3D packing problem

Chugay¹

2020

Visn. Nac. Akad. Nauk Ukr.

View full text Add to dashboard Cite

“…This heuristic has gained its popularity in various works e.g. [6,25,26]. This heuristic always searches for a space with the minimal x (deepest) coordinate to place the current item.…”

Section: Online Packing Heuristicmentioning

confidence: 99%