Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 7 of 7 for “"Container Loading Problem"”.
-
The three-dimensional container loading problem
This thesis investigates the three-dimensional container loading problem. We review all literatures published in this area, and explain our unique problem raised from an industry partner. As constructive heuristic remains uncontrollable to us, we design improvement algorithms both to and not to …
-
Skruzdžių kolonijos algoritmas jūrinių konteinerių krovos optimizavimui /
… ant colony algorithm is developed to solve sea container loading problem. The randomized pheromone limitation and elite ant strategy aims to reduce the stagnation of the ant paths and increase the likelihood of different path choices, thus improving the efficiency of the algorithm. The …
-
Three-dimensional Bin Packing in Mixed-case Palletization
The Three Dimensional Bin Packing Problem (3DBPP) is within one of the broad categories of the Bin Packing Problem. The other broad categories include the One Dimensional and the Two Dimensional Bin Packing Problem. As we live in a three dimensional world, the 3DBPP can model a variety of real …
-
Desenvolvimento de um modelo computacional heurístico para carregamentode cargas semi-homogêneas em contêineres de 40 pés
… um modelo computacional heurístico para o Container Loading Problem (CLP), destinado à alocação de cargas semi-homogêneas retangulares em contêineres de 40 pés, considerando restrições operacionais da logística de uma indústria. A pesquisa identifica um cenário de baixa ocupação volumétrica …
-
Optimization of marine container loading /
… for packing boxes of different sizes into one container. The essence of the procedure is to generate a set of towers, which consist of different boxes, using a genetic algorithm, and then place these towers on the floor of a container, also using a genetic algorithm. Several heuristic …
-
Problemas de corte: métodos exactos y aproximados para formulaciones mono y multi-objetivo
Los problemas de corte y empaquetado son una familia de problemas de optimización combinatoria que han sido ampliamente estudiados en numerosas áreas de la industria y la investigación, debido a su relevancia en una enorme variedad de aplicaciones reales. Son problemas que surgen en muchas …
-
Shipping Configuration Optimization with Topology-Based Guided Local Search for Irregular Shaped Shipments
Manufacturer that uses containers to ship products always works to optimize the space inside the containers. Container loading problems (CLP) are widely encountered in forms of raw material flow and handling, product shipments, warehouse management, facility floor planning, as well as strip-packing …