• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • 1
  • 1
  • Tagged with
  • 4
  • 4
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Solving a highly constrained multi-level container loading problem from practice

Olsson, Jonas January 2017 (has links)
The container loading problem considered in this thesis is to determine placements of a set of packages within one or multiple shipping containers. Smaller packages are consolidated on pallets prior to being loaded in the shipping containers together with larger packages. There are multiple objectives which may be summarized as fitting all the packages while achieving good stability of the cargo as well as the shipping containers themselves. According to recent literature reviews, previous research in the field have to large extent been neglecting issues relevant in practice. Our real-world application was developed for the industrial company Atlas Copco to be used for sea container shipments at their Distribution Center (DC) in Texas, USA. Hence all applicable practical constraints faced by the DC operators had to be treated properly. A high variety in sizes, weights and other attributes such as stackability among packages added complexity to an already challenging combinatorial problem. Inspired by how the DC operators plan and perform loading manually, the batch concept was developed, which refers to grouping of boxes based on their characteristics and solving subproblems in terms of partial load plans. In each batch, an extensive placement heuristic and a load plan evaluation run iteratively, guided by a Genetic Algorithm (GA). In the placement heuristic, potential placements are evaluated using a scoring function considering aspects of the current situation, such as space utilization, horizontal support and heavier boxes closer to the floor. The scoring function is weighted by coefficients corresponding to the chromosomes of an individual in the GA population. Consequently, the fitness value of an individual in the GA population is the rating of a load plan. The loading optimization software has been tested and successfully implemented at the DC in Texas. The software has been proven capable of generating satisfactory load plans within acceptable computation times, which has resulted in reduced uncertainty and labor usage in the loading process. Analysis using real sea container shipments shows that the GA is able to tune the scoring coefficients to suit the particular problem instance being solved.
2

Nutzbarmachung des Potentials naturfaserbasierter, ressourcenschonender Werkstoffe als Leichtbau- bzw. Konstruktionsmaterial [Präsentationsfolien]

Kuntzsch, Timo, Miletzky, Frank 20 December 2016 (has links) (PDF)
Motivation - Neue Anwendungen für cellulosische Fasern z.B. in 3D-Verpackungslösungen, im Leichtbau oder in Konstruktionswerkstoffen - Technologisch effiziente Herstellbarkeit wird gefordert (z.B. integriertes Umformen und Fügen) - Verfügbarkeit geeigneter Simulationswerkzeuge unabdingbar (z.B. mittels FE-Analyse)
3

Nutzbarmachung des Potentials naturfaserbasierter, ressourcenschonender Werkstoffe als Leichtbau- bzw. Konstruktionsmaterial [Präsentationsfolien]

Kuntzsch, Timo, Miletzky, Frank January 2016 (has links)
Motivation - Neue Anwendungen für cellulosische Fasern z.B. in 3D-Verpackungslösungen, im Leichtbau oder in Konstruktionswerkstoffen - Technologisch effiziente Herstellbarkeit wird gefordert (z.B. integriertes Umformen und Fügen) - Verfügbarkeit geeigneter Simulationswerkzeuge unabdingbar (z.B. mittels FE-Analyse)
4

3D Printable Designs of Rigid and Deformable Models

Yao, Miaojun January 2017 (has links)
No description available.

Page generated in 0.0333 seconds