Log in

Relevant bibliographies by topics / Bin packing / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Bin packing.

Dissertations / Theses on the topic 'Bin packing'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Bin packing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Burcea, Mihai. "Online dynamic bin packing." Thesis, University of Liverpool, 2014. http://livrepository.liverpool.ac.uk/2005382/.

Full text

Abstract:

In this thesis we study online algorithms for dynamic bin packing. An online algorithm is presented with input throughout time and must make irrevocable decisions without knowledge of future input. The classical bin packing problem is a combinatorial optimization problem in which a set of items must be packed into a minimum number of uniform-sized bins without exceeding their capacities. The problem has been studied since the early 1970s and many variants continue to attract researchers’ attention today. The dynamic version of the bin packing problem was introduced by Coffman, Garey and Johnso

APA, Harvard, Vancouver, ISO, and other styles

2

Nielsen, Torben Noerup. "Combinatorial Bin Packing Problems." Diss., The University of Arizona, 1985. http://hdl.handle.net/10150/187536.

Full text

Abstract:

In the past few years, there has been a strong and growing interest in evaluating the expected behavior of what we call combinatorial bin packing problems. A combinatorial bin packing problem consists of a number of items of various sizes and value ratios (value per unit of size) along with a collection of bins of fixed capacity into which the items are to be packed. The packing must be done in such a way that the sum of the sizes of the items into a given bin does not exceed the capacity of that bin. Moreover, an item must either be packed into a bin in its entirety or not at all: this "all o

APA, Harvard, Vancouver, ISO, and other styles

3

BALDI, MAURO MARIA. "Generalized Bin Packing Problems." Doctoral thesis, Politecnico di Torino, 2013. http://hdl.handle.net/11583/2507776.

Full text

Abstract:

Packing problems make up a fundamental topic of combinatorial optimization. Their importance is confirmed both by their wide range of scientific and technological applications they are able to address and by their theoretical implications. In fact, they are exploited in many fields such as computer science and technologies, industrial applications, transportation and logistics, and telecommunications. From a theoretical perspective, packing problems often appear as sub-problems in order to iteratively solve bigger problems. Although packing problems play a fundamental role in all these setting

APA, Harvard, Vancouver, ISO, and other styles

4

Ilicak, Isil. "Bi-objective Bin Packing Problems." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/2/1079987/index.pdf.

Full text

Abstract:

In this study, we consider two bi-objective bin packing problems that assign a number of weighted items to bins having identical capacities. Firstly, we aim to minimize total deviation over bin capacity and minimize number of bins. We show that these two objectives are conflicting. Secondly, we study the problem of minimizing maximum overdeviation and minimizing the number of bins. We show the similarities of these two problems to parallel machine scheduling problems and benefit from the results while developing our solution approaches. For both problems, we propose exact procedures that gener

APA, Harvard, Vancouver, ISO, and other styles

5

Lundanes, Petter Olsen. "Bin packing problem with order constraints." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-27334.

Full text

Abstract:

This paper presents an algorithm to solve a variant of the bin packing problem with additional constraints on the order of items. The performance of this algorithm is tested, both for optimal solutions and approximations given by early termination, and is found to be limited for optimal solutions, but fairly efficient for decent approximations.

APA, Harvard, Vancouver, ISO, and other styles

6

Khan, Arindam. "Approximation algorithms for multidimensional bin packing." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/54371.

Full text

Abstract:

The bin packing problem has been the corner stone of approximation algorithms and has been extensively studied starting from the early seventies. In the classical bin packing problem, we are given a list of real numbers in the range (0, 1], the goal is to place them in a minimum number of bins so that no bin holds numbers summing to more than 1. In this thesis we study approximation algorithms for three generalizations of bin packing: geometric bin packing, vector bin packing and weighted bipartite edge coloring. In two-dimensional (2-D) geometric bin packing, we are given a collection of re

APA, Harvard, Vancouver, ISO, and other styles

7

Shor, Peter Williston. "Random planar matching and bin packing." Thesis, Massachusetts Institute of Technology, 1985. https://hdl.handle.net/1721.1/128792.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.<br>Bibliography: leaves 123-124.<br>by Peter Williston Shor.<br>Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.

APA, Harvard, Vancouver, ISO, and other styles

8

Clautiaux, François. "New collaborative approaches for bin-packing problems." Habilitation à diriger des recherches, Université de Technologie de Compiègne, 2010. http://tel.archives-ouvertes.fr/tel-00749419.

Full text

Abstract:

Ce document décrit de nouvelles modélisations et approches de résolution que nous appliquons à des problèmes de découpe et de conditionnement. Nous étudions dans un premier temps plusieurs techniques de décomposition alliées à différentes méta-heuristiques basées sur des stratégies d'oscillation. Nous étudions ensuite le concept de fonctions dual-réalisables qui permettent d'obtenir des évaluations par défaut polynomiales pour des problèmes de conditionnement. Finalement, nous proposons des modèles originaux pour des problèmes de placement de rectangles. Nous utilisons ces modèles dans des mét

APA, Harvard, Vancouver, ISO, and other styles

9

Ben, Mohamed Ahmed Mohamed Abdellahi. "Résolution approchée du problème de bin-packing." Le Havre, 2009. http://www.theses.fr/2009LEHA0031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Pasha, Arfath. "Geometric bin packing algorithm for arbitrary shapes." [Gainesville, Fla.] : University of Florida, 2003. http://purl.fcla.edu/fcla/etd/UFE0000907.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Sadones, Sylvie. "A new two-phase heuristic for two-dimensional rectangular bin-packing and strip-packing /." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Braithwaite, Todd Arthur. "Two-dimensional bin packing, innovations and statistical analysis." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ30932.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Souissi, Salma. "Problème du Bin Packing probabiliste à une dimension." Versailles-St Quentin en Yvelines, 2006. http://www.theses.fr/2006VERS0052.

Full text

Abstract:

Le Problème de Bin Packing Probabiliste (PBPP) tient compte de la disparition de certains objets après avoir été placés dans les boîtes. Le problème consiste à réarranger les objets restants en utilisant la solution a priori. L’arrangement initial est effectué en utilisant l’heuristique Next Fit Decreasing (NFD). Nous considérons deux stratégies de résolution: la stratégie de redistribution suivant NFD et la stratégie a priori. Dans la première, l’algorithme Next Fit est appliqué à la nouvelle liste. Dans la seconde, des groupes successives de boîtes sont réarrangés d’une façon optimale. Dans

APA, Harvard, Vancouver, ISO, and other styles

14

Pietrobuoni, Enrico <1986&gt. "Two-Dimensional Bin Packing Problem with Guillotine Restrictions." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amsdottorato.unibo.it/6810/1/PhD_Pietrobuoni.pdf.

Full text

Abstract:

This thesis, after presenting recent advances obtained for the two-dimensional bin packing problem, focuses on the case where guillotine restrictions are imposed. A mathematical characterization of non-guillotine patterns is provided and the relation between the solution value of the two-dimensional problem with guillotine restrictions and the two-dimensional problem unrestricted is being studied from a worst-case perspective. Finally it presents a new heuristic algorithm, for the two-dimensional problem with guillotine restrictions, based on partial enumeration, and computationally evaluate

APA, Harvard, Vancouver, ISO, and other styles

15

Pietrobuoni, Enrico <1986&gt. "Two-Dimensional Bin Packing Problem with Guillotine Restrictions." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amsdottorato.unibo.it/6810/.

Full text

Abstract:

This thesis, after presenting recent advances obtained for the two-dimensional bin packing problem, focuses on the case where guillotine restrictions are imposed. A mathematical characterization of non-guillotine patterns is provided and the relation between the solution value of the two-dimensional problem with guillotine restrictions and the two-dimensional problem unrestricted is being studied from a worst-case perspective. Finally it presents a new heuristic algorithm, for the two-dimensional problem with guillotine restrictions, based on partial enumeration, and computationally evaluate

APA, Harvard, Vancouver, ISO, and other styles

16

Matkevičius, Audrius. "Vienmačio supjaustymo uždaviniai." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2005. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2005~D_20050609_143028-57047.

Full text

Abstract:

The purpose of bin packing is the effective apportionment of smaller elements in the bigger ones. The bin packing is being analysed in managment, computers, mathematics and researches of operations. The quality of the heuristic structural algorithm and time have been analysed in the work (the percent of the used material and the quality of the received waste). The results of the researches show that non-sorted bin packing algorithms cut better than bin packing sorted algorithms but the time of cutting grows longer when the number of finished products grow longer.

APA, Harvard, Vancouver, ISO, and other styles

17

Han, Xin. "Online and approximation algorithms for bin-packing and knapsack problems." 京都大学 (Kyoto University), 2007. http://hdl.handle.net/2433/135979.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Junqueira, Nenina Marcia Pereira. "Algoritmos aproximados para solucionar o problema de Bin Packing unidimensional." Instituto Tecnológico de Aeronáutica, 2007. http://www.bd.bibl.ita.br/tde_busca/arquivo.php?codArquivo=375.

Full text

Abstract:

Este trabalho apresenta um estudo sobre a razão assintótica de pior caso para alguns algoritmos aproximados utilizados para solucionar o problema de Bin Packing unidimensional ( BPP). Este é um problema clássico de otimização combinatória que serve de modelo para uma série de problemas que ocorrem no mundo real. No BPP, dada uma lista com n itens de tamanhos no intervalo (0,

APA, Harvard, Vancouver, ISO, and other styles

19

Ongkunaruk, Pornthipa. "Asymptotic Worst-Case Analyses for the Open Bin Packing Problem." Diss., Virginia Tech, 2005. http://hdl.handle.net/10919/30105.

Full text

Abstract:

The open bin packing problem (OBPP) is a new variant of the well-known bin packing problem. In the OBPP, items are packed into bins so that the total content before the last item in each bin is strictly less than the bin capacity. The objective is to minimize the number of bins used. The applications of the OBPP can be found in the subway station systems in Hong Kong and Taipei and the scheduling in manufacturing industries. We show that the OBPP is NP-hard and propose two heuristic algorithms instead of solving the problem to optimality. We propose two offline algorithms in which the informat

APA, Harvard, Vancouver, ISO, and other styles

20

Qiao, Wenxin. "An algorithm for crew scheduling problem with bin packing features." College Park, Md.: University of Maryland, 2008. http://hdl.handle.net/1903/8818.

Full text

Abstract:

Thesis (M.S.) -- University of Maryland, College Park, 2008.<br>Thesis research directed by: Dept. of Civil and Environmental Engineering . Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

21

Sim, Kevin. "Novel hyper-heuristics applied to the domain of bin packing." Thesis, Edinburgh Napier University, 2014. http://researchrepository.napier.ac.uk/Output/7563.

Full text

Abstract:

Principal to the ideology behind hyper-heuristic research is the desire to increase the level of generality of heuristic procedures so that they can be easily applied to a wide variety of problems to produce solutions of adequate quality within practical timescales. This thesis examines hyper-heuristics within a single problem domain, that of Bin Packing where the benefits to be gained from selecting or generating heuristics for large problem sets with widely differing characteristics is considered. Novel implementations of both selective and generative hyper-heuristics are proposed. The forme

APA, Harvard, Vancouver, ISO, and other styles

22

Ancora, Gabriele <1993&gt. "The three-dimensional single-bin-size bin packing problem: combining metaheuristic and machine learning approaches." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2022. http://amsdottorato.unibo.it/10476/1/tesiFrontespizioOK.pdf.

Full text

Abstract:

The Three-Dimensional Single-Bin-Size Bin Packing Problem is one of the most studied problem in the Cutting & Packing category. From a strictly mathematical point of view, it consists of packing a finite set of strongly heterogeneous “small” boxes, called items, into a finite set of identical “large” rectangles, called bins, minimizing the unused volume and requiring that the items are packed without overlapping. The great interest is mainly due to the number of real-world applications in which it arises, such as pallet and container loading, cutting objects out of a piece of material and pack

APA, Harvard, Vancouver, ISO, and other styles

23

Brohm, Michael. "Analysis of Bin-packing algorithms used for steel beam cut optimazation." Thesis, University West, Department of Technology, Mathematics and Computer Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:hv:diva-558.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Jing, Chen. "Studies on Approximation Algorithms for Bin-Packing and Train Delivery Problems." 京都大学 (Kyoto University), 2016. http://hdl.handle.net/2433/215691.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Khanafer, Ali. "Algorithmes pour des problèmes de bin packing mono- et multi-objectif." Thesis, Lille 1, 2010. http://www.theses.fr/2010LIL10088/document.

Full text

Abstract:

Le problème de bin packing consiste à déterminer le nombre minimum de conteneurs (bins) nécessaires pour ranger un ensemble d’objets. Ce problème NP- complet fait depuis de nombreuses années l’objet de multiples travaux de recherche, théoriques et pratiques. On le retrouve entre autres dans l’industrie de découpe de tissu, de l’acier, de bois et de verre. La littérature sur le problème de bin packing est riche et les algorithmes et approches de résolution sont très diverses. Cependant, les solutions proposées par ces algorithmes peuvent ne pas être utiles quand on traite des problèmes industri

APA, Harvard, Vancouver, ISO, and other styles

26

Ortmann, Frank. "Heuristics for offline rectangular packing problems." Thesis, Stellenbosch : University of Stellenbosch, 2010. http://hdl.handle.net/10019.1/3992.

Full text

Abstract:

Thesis (PhD (Logistics))--University of Stellenbosch, 2010.<br>ENGLISH ABSTRACT: Packing problems are common in industry and there is a large body of literature on the subject. Two packing problems are considered in this dissertation: the strip packing problem and the bin packing problem. The aim in both problems is to pack a speci ed set of small items, the dimensions of which are all known prior to packing (hence giving rise to an o ine problem), into larger objects, called bins. The strip packing problem requires packing these items into a single bin, one dimension of which is unbounde

APA, Harvard, Vancouver, ISO, and other styles

27

Lemos, Felipe Kesrouani. "Problema de programação de uma operação de empacotamento não-guilhotinado em ambiente de máquina única, minimizando custos de matéria-prima e desvio de datas: formulação e solução heurística." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/3/3136/tde-11072014-121631/.

Full text

Abstract:

A presente pesquisa tem como objetivo estudar a integração entre dois temas clássicos da literatura de pesquisa operacional e gestão de operações: problemas de corte e empacotamento; e problemas de programação da produção. Ainda que sejam duas áreas intensamente exploradas e pesquisadas, e, ainda, que seja uma situação facilmente encontrada em sistemas de produção reais, abordagens de ambos problemas de forma coordenada ainda carecem de maiores pesquisas. Neste trabalho é feita uma revisão de ambos temas, com foco em problemas de bin packing e programação em ambiente de máquina única com objet

APA, Harvard, Vancouver, ISO, and other styles

28

Aquino, Henrique Otávio Queiroz de. "Uma aplicação do algoritmo genético construtivo ao problema de "BIN-PACKING" unidimensional." Instituto Nacional de Pesquisas Espaciais (INPE), 1998. http://urlib.net/sid.inpe.br/mtc-m18@80/2009/05.14.19.18.

Full text

Abstract:

Esta dissertação de mestrado tem como objetivo aplicar um método heurístico denominado Algoritmo Genético Construtivo (AGC), ao Problema de Bin Packing Unidimensional (PBP). Verificamos que através da heurística podemos gerar, combinar e selecionar uma população de esquemas (blocos construtivos) do problema, de modo que se consiga construir uma solução ótima ou, ao menos, se aproximar do menor número de caixas (bins) para distribuir e empacotar cada unidade de vários itens dados. O processo parte de uma população inicial de esquemas, através da distribuição aleatória de itens em uma certa quan

APA, Harvard, Vancouver, ISO, and other styles

29

Milevičius, Vilimantas. "Dėžių pakavimo su papildomu apribojimu optimizavimo algoritmo sudarymas ir tyrimas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2007. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2007~D_20070816_144408-66957.

Full text

Abstract:

Šio darbo tikslas – sukurti trimačių dėžių su papildomu orientacijos erdvėje apribojimu pakavimo optimizavimo algoritmą, o realizavus jį programinėmis priemonėmis – ištirti jo efektyvumą su atsitiktinai sugeneruotų kraunamų dėžių rinkiniais ir prie skirtingų algoritmo veikimo parametrų. Taip pat sukurti ir pakavimo optimizavimo sprendinio vizualizavimo trimatėje erdvėje programinę įrangą.<br>Presented work covers one of the most complex areas of combinatorial optimization – three dimensional bin packing problem. Solution methods of this problem are applied in the real world from logistics, pac

APA, Harvard, Vancouver, ISO, and other styles

30

Ataki, Adel. "Wetting of structured packing elements CFD and Experiment /." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=981239463.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Želvytė, Lina. "3D objektų pakavimo metodai ir programinė įranga." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2004. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2004~D_20040525_175607-32032.

Full text

Abstract:

The essence of 3D object packing problem is to load a set of distinct boxes with given dimensions in containers to maximize volume utilization. The goal of this research is to support with algorithmic techniques the design of package layouts that meet the functional relationships between the parts and match market needs including cost, safety, comfort, as well as economic and environmental aspects. An analysis of 3D object packing algorithms, created by foreign authors, and commercial three-dimensional pallet packing software packages was performed in this work; also methods’ advantages and di

APA, Harvard, Vancouver, ISO, and other styles

32

Heydrich, Sandy [Verfasser], and Rob van [Akademischer Betreuer] Stee. "A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem / Sandy Heydrich ; Betreuer: Rob van Stee." Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2018. http://d-nb.info/1164012193/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Fischer, Carsten Oliver [Verfasser]. "New Results on the Probabilistic Analysis of Online Bin Packing and its Variants / Carsten Oliver Fischer." Bonn : Universitäts- und Landesbibliothek Bonn, 2019. http://d-nb.info/120172791X/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Casazza, Marco. "Algorithms for Optimization Problems with Fractional Resources." Thesis, Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCD048/document.

Full text

Abstract:

Dans cette thèse nous considérons une classe de problèmes d’optimisation ayant une particularité : des décisions à la fois discrètes et continues doivent être prises simultanément. Ces problèmes se posent dans de nombreuses applications pratiques, comme par exemple dans les réseaux de télécommunications à large bande passante et dans les problèmes de transport écologique, où les ressources disponibles peuvent être très légèrement consommées ou réparties. Ces problèmes se sont avérés être plus difficiles à résoudre que leurs homologues purement discrets. Des méthodes efficaces pour la résolutio

APA, Harvard, Vancouver, ISO, and other styles

35

Clautiaux, François. "Bornes inférieures et méthodes exactes pour le problème de bin packing en deux dimensions avec orientation fixe." Phd thesis, Université de Technologie de Compiègne, 2005. http://tel.archives-ouvertes.fr/tel-00749411.

Full text

Abstract:

Notre problème consiste à déterminer le nombre de grands rectangles identiques nécessaires pour ranger une liste de rectangles sans modifier leur orientation. Nous proposons des méthodes pour calculer des bornes inférieures pour ce problème, essentiellement basée sur le concept de fonctions dual-réalisables. Nous proposons aussi deux méthodes exactes de type énumératives. L'une permet de déterminer si un ensemble de rectangles peut être contenu dans un rectangle unique. Elle repose sur une nouvelle relaxation du problème. La deuxième méthode permet de résoudre le problème général de bin packin

APA, Harvard, Vancouver, ISO, and other styles

36

El, Hayek Joseph. "Le problème de bin-packing en deux-dimensions, le cas non-orienté : résolution approchée et bornes inférieures." Phd thesis, Université de Technologie de Compiègne, 2006. http://tel.archives-ouvertes.fr/tel-00158728.

Full text

Abstract:

Notre travail porte sur le problème de bin-packing qui consiste à déterminer le nombre minimum de grands rectangles (bins) nécessaires pour ranger un ensemble de petits rectangles (objets). Ce problème d'optimisation combinatoire est NP-difficile au sens fort. Nous proposons des prétraitements des objets permettant la valorisation des espaces perdus dans les bins et la diminution de la taille du problème à résoudre. Nous proposons une nouvelle méthode d'évaluation de bornes inférieures tenant compte de la possibilité de tourner les objets de 90 degrés. Nous procédons à une résolution approchée

APA, Harvard, Vancouver, ISO, and other styles

37

Loh, Kok-Hua. "Weight annealing heuristics for solving bin packing and other combinatorial optimization problems concepts, algorithms and computational results /." College Park, Md. : University of Maryland, 2006. http://hdl.handle.net/1903/3980.

Full text

Abstract:

Thesis (Ph. D.) -- University of Maryland, College Park, 2006.<br>Thesis research directed by: Business and Management. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

38

ALVIM, ADRIANA CESARIO DE FARIA. "A HYBRID IMPROVEMENT HEURISTICS FOR THE BIN PACKING PROBLEM AND ITS APPLICATION TO THE PROBLEM OF TASK SCHEDULING." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2003. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4364@1.

Full text

Abstract:

CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>A principal contribuição desta tese consiste no desenvolvimento de uma heurística híbrida, robusta e eficiente, para o problema de empacotamento unidimensional. A heurística proposta utiliza os seguintes componentes: limites inferiores e superiores do número de caixas; reduções; abordagem dual para a obtenção de soluções iniciais; heurísticas para redistribuição dos pesos; e busca tabu. O outro objetivo desta tese é a aplicação desta heurística para a solução do problema de escalonamento em processadores paralelos idênti

APA, Harvard, Vancouver, ISO, and other styles

39

Ražas, Artūras. "Dėžių pakavimo trimatėje erdvėje algoritmas ir jo taikymas logistikos uždaviniams spręsti." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2006. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20060531_104235-31546.

Full text

Abstract:

Whether you are in industrial manufacturing striving to optimize your supply chain, international or domestic carrier committed to lower your operational costs, retailer dedicated to run your distribution network more efficiently, or anywhere else where the words "cargo", "freight", "shipment" are in your business language, automated load planning and optimization will significantly improve your business process. While the concept of computerized simulation of 3D load building is not new, with some companies offering software solutions for "virtual" loading, no one has a single product that is

APA, Harvard, Vancouver, ISO, and other styles

40

Asgeirsson, Agni. "On-line algorithms for bin-covering problems with known item distributions." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/53413.

Full text

Abstract:

This thesis focuses on algorithms solving the on-line Bin-Covering problem, when the items are generated from a known, stationary distribution. We introduce the Prospect Algorithm. The main idea behind the Prospect Algorithm is to use information on the item distribution to estimate how easy it will be to fill a bin with small overfill as a function of the empty space left in it. This estimate is then used to determine where to place the items, so that all active bins either stay easily fillable, or are finished with small overfill. We test the performance of the algorithm by simulation, and

APA, Harvard, Vancouver, ISO, and other styles

41

Tuenter, Hans J. H. "Worst-case bounds for bin-packing heuristics with applications to the duality gap of the one-dimensional cutting stock problem." Thesis, University of Birmingham, 1997. http://etheses.bham.ac.uk//id/eprint/266/.

Full text

Abstract:

The thesis considers the one-dimensional cutting stock problem, the bin-packing problem, and their relationship. The duality gap of the former is investigated and a characterisation of a class of cutting stock problems with the next round-up property is given. It is shown that worst-case bounds for bin-packing heuristics can be and are best expressed in terms of the linear programming relaxation of the corresponding cutting stock problem. The concept of recurrency is introduced for a bin-packing heuristic, which allows a more natural derivation of a measure for the worst-case behaviour. The id

APA, Harvard, Vancouver, ISO, and other styles

42

Sannia, Giacomo. "Ottimizzazione di un sistema di pallettizzazione. Il caso IRSAP." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020.

Find full text

Abstract:

Il processo di pallettizzazione dei prodotti all'interno delle realtà industriali è stato riconosciuto negli ultimi decenni come un valore aggiunto se ottimizzato al meglio. Più i prodotti sono disposti in modo ordinato e stabile sui bancali, più la saturazione volumetrica cresce e ciò che ne consegue è una riduzione del numero di pallet totali necessari. Allo stesso tempo ottimizzare il processo di pallettizzazione coinvolge anche l'aspetto dei tempi richiesti da tutte le operazioni collegate; spesso molte realtà industriali presentano sprechi e attività non necessarie che allungano inutilmen

APA, Harvard, Vancouver, ISO, and other styles

43

Klement, Nathalie. "Planification et affectation de ressources dans les réseaux de soin : analogie avec le problème du bin packing, proposition de méthodes approchées." Thesis, Clermont-Ferrand 2, 2014. http://www.theses.fr/2014CLF22517/document.

Full text

Abstract:

Les travaux de thèse présentés s’intéressent à l’optimisation des systèmes hospitaliers. Une solution existante est la mutualisation de ressources au sein d’un même territoire. Cela peut passer par différentes formes de coopération dont la Communauté Hospitalière de Territoire. Différents problèmes sont définis en fonction du niveau de décision : stratégique, tactique ou opérationnel ; et du niveau de modélisation : macroscopique, mesoscopique et microscopique. Des problèmes de dimensionnement, de planification et d’ordonnancement peuvent être considérés. Nous définissons notamment le problème

APA, Harvard, Vancouver, ISO, and other styles

44

Silva, Raquel Akemi Okuno Kitazume da. "Empacotamento de itens irregulares considerando balanceamento da carga." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-05102017-170921/.

Full text

Abstract:

O problema de empacotamento de itens irregulares com balanceamento da carga é encontrado no carregamento de aviões, caminhões e navios. O objetivo é empacotar itens irregulares utilizando o menor número de recipientes possível de forma que os recipientes estejam balanceados, que os itens não se sobreponham e estejam inteiramente contidos no recipiente. Neste trabalho, propomos três heurísticas bases com três variações cada para o problema com recipientes retangulares e irregulares. As heurísticas utilizam abordagens diferentes para representar os itens e para fazer o balanceamento. Uma das heu

APA, Harvard, Vancouver, ISO, and other styles

45

Pereira, Robson Edvaldo da Silva. "Álgebra linear: secções cônicas e aplicações." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55136/tde-25092017-161410/.

Full text

Abstract:

Neste trabalho desenvolvemos o estudo da álgebra linear, secções cônicas e aplicações. Apresentamos os conceitos mais importantes da álgebra linear, estudando os espaços vetorias, subespaços vetoriais, matriz de mudança de base, transformações lineares e produto interno. O principal resultado do trabalho é o teorema espectral que fornece ferramentas para se estudar as secções cônicas não elementares, ou seja, aquelas nas quais uma parábola, elipse ou hipérbole são apresentadas com seus eixos não paralelos aos eixos coordenados do plano cartesiano. Uma vez de posse deste teorema é mostrado um p

APA, Harvard, Vancouver, ISO, and other styles

46

Antomarchi, Anne-Lise. "Conception et pilotage d'un atelier intégrant la fabrication additive." Thesis, Université Clermont Auvergne‎ (2017-2020), 2019. http://www.theses.fr/2019CLFAC035/document.

Full text

Abstract:

La fabrication additive est un domaine en plein essor. Cependant, les industriels sont aujourd’hui dans une phase d’interrogation sur l’utilisation de ce procédé dans le cadre d’une production de masse. La problématique posée dans le cadre de ces travaux de recherche est : Comment rendre viable, industriellement, le procédé de fusion sur lit de poudre ? Nos travaux abordent la conception et le pilotage d’ateliers intégrant la fabrication additive et le processus complet d’obtention de la pièce selon les trois niveaux de décision : stratégique, tactique et opérationnel. D’un point du vue straté

APA, Harvard, Vancouver, ISO, and other styles

47

Bouzoubaa, Yahya. "Méthodes exactes et heuristiques pour l’optimisation de l’agencement d’un logement : application aux situations de handicap." Thesis, Université de Lorraine, 2017. http://www.theses.fr/2017LORR0369/document.

Full text

Abstract:

Le volet applicatif de cette thèse porte sur l'agencement d'un logement destiné à une personne en situation de handicap. L'agencement désigne le choix de la position, de la forme et des dimensions des pièces, des portes et des couloirs. L'agencement est généralement élaboré par un architecte, dans le respect d'un nombre si élevé de contraintes qu'il lui est difficile de parvenir qu'il parvienne à toutes les satisfaire : il y a d'abord des contraintes architecturales évidentes : non recouvrement des pièces, largeur suffisante des couloirs, accessibilité à tout point du lieu à partir de tout aut

APA, Harvard, Vancouver, ISO, and other styles

48

Atchukatla, Mahammad suhail. "Algorithms for efficient VM placement in data centers : Cloud Based Design and Performance Analysis." Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-17221.

Full text

Abstract:

Content: Recent trends show that cloud computing adoption is continuously increasing in every organization. So, demand for the cloud datacenters tremendously increases over a period, resulting in significantly increased resource utilization of the datacenters. In this thesis work, research was carried out on optimizing the energy consumption by using packing of the virtual machines in the datacenter. The CloudSim simulator was used for evaluating bin-packing algorithms and for practical implementation OpenStack cloud computing environment was chosen as the platform for this research. Objecti

APA, Harvard, Vancouver, ISO, and other styles

49

Deutgen, Caroline, and Nils Forsberg. "Planeringsprogram för kassettlastningen på SCA Sourcing & Logistics AB i Umeå : Ett planeringsprogram baserat på heuristiska Bin Packing-algoritmer och dagens manuella planeringsmetoder." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-136386.

Full text

Abstract:

SCA Sourcing & Logistics i Umeå är ett transport- och logistikföretag som utgör en del av SCA Forest Products. Logistikföretaget transporterar bland annat kraftlinerrullar med roro-fartyg till terminaleri norra Europa. Inför varje fartygsresa utförs en planering där varje kraftlinerrulle tilldelas en godsbärare som kallas kassett. Planeringen utförs idag manuellt vilket tar lång tid, gör den svår att i efterhand anpassa efter olika önskemål och kan leda till vissa säkerhetsrisker då godset ska lastas. Vid en annan terminal i Sundsvall som också tillhör SCA Sourcing & Logistics används

APA, Harvard, Vancouver, ISO, and other styles

50

Lemaire, Pierre. "Rangement d'objets multiboîtes : modèles et algorithmes." Phd thesis, Université Joseph Fourier (Grenoble), 2004. http://tel.archives-ouvertes.fr/tel-00006893.

Full text

Abstract:

Un objet multiboîte est composé de plusieurs parties identiques qui doivent être rangées dans des boîtes différentes. La hauteur d'une boîte est alors la somme des hauteurs des objets qu'elle contient. Ce concept généralise et englobe de nombreux problèmes de la littérature de la recherche opérationnelle.<br /><br />Une classification de ces modèles est proposée. Les bases théoriques sont posées. En particulier, la complexité pour les principaux types d'objets et objectifs est déterminée.<br /><br />Une étude détaillée est effectuée lorsque les objets ont des largeurs constantes et que l'on ve

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!