Showing 1 - 10 of 44
Der Beitrag präsentiert einen hybriden genetischen Algorithmus für das Containerbeladeproblem mit quaderförmigen … unter Einbeziehung von Verfahren anderer Autoren belegen eine gute Performance des genetischen Algorithmus vor allem für …
Persistent link: https://www.econbiz.de/10005844620
Given a finite set of circles of different sizes we study the Strip Packing Problem (SPP) as well as the Knapsack Problem (KP). The SPP asks for a placement of all circles (without overlap) within a rectangular strip of fixed width so that the variable length of the strip is minimized. The KP...
Persistent link: https://www.econbiz.de/10005856271
The paper presents a genetic algorithm (GA) for the two-dimensional strip-packing problem (SPP) with rectangular shaped pieces. Both the non-guillotinable SPP and the guillotinable SPP can be tackled. The genetic algorithm has been derived from a GA that was proposed earlier for solving the...
Persistent link: https://www.econbiz.de/10005856272
In this contribution, a parallel hybrid local search algorithm for the three-dimensional container loading problem (CLP) is proposed. First a simulated annealing method for the CLP is developed, which is then combined with an existing tabu search algorithm to form a hybrid metaheuristic....
Persistent link: https://www.econbiz.de/10005856276
In diesem Bericht wird ein paralleler Tabu Search-Algorithmus (TSA) für das Containerbeladeproblem mit einem zu …
Persistent link: https://www.econbiz.de/10005856281
Given a finite set of spheres of different sizes we study the three-dimensional StripPacking Problem (3D-SPP) as well as the three-dimensional Knapsack Problem (3D-KP).The 3D-SPP asks for a placement of all spheres within a cuboidal strip of fixed width andheight so that the variable length of...
Persistent link: https://www.econbiz.de/10005870648
The capacitated vehicle routing problem with three‐dimensional loading constraints combinescapacitated vehicle routing and three‐dimensional loading with additional packing constraints whichconcern, for example, unloading operations. An efficient hybrid algorithm including a tabu...
Persistent link: https://www.econbiz.de/10009138325
The paper presents a tree search algorithm for the three-dimensional container loading problem(3D-CLP). The 3D-CLP is the problem of loading a subset of a given set of rectangularboxes into a rectangular container so that the packed volume is maximized. The method hastwo variants: the packing...
Persistent link: https://www.econbiz.de/10005867240
Given a set of rectangular pieces and a rectangular container, the two-dimensional knapsackproblem (2D-KP) consists of orthogonally packing a subset of the pieces within the container suchthat the sum of the values of the packed pieces is maximized. If the value of a piece is given by itsarea...
Persistent link: https://www.econbiz.de/10005867242
Persistent link: https://www.econbiz.de/10011521853