Relevant bibliographies by topics / Constrained cutting / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Constrained cutting.

Dissertations / Theses on the topic 'Constrained cutting'

Author: Grafiati
Published: 6 September 2023

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

Select a source type:

Consult the top 19 dissertations / theses for your research on the topic 'Constrained cutting.'

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

Oberholzer, Jan Adriaan. "Implementing artificial intelligence search methods to solve constrained two-dimensional guillotine-cut cutting stock problems / by Jan Adriaan Oberholzer." Thesis, North-West University, 2003. http://hdl.handle.net/10394/392.

Full text
Abstract:
The main focus of this thesis will be on the constrained two dimensional guillotine-cut cuffing stock (C2DGC) problem. Stock cutting involves the process of cutting certain small demand items from a larger object. During this process, waste material is generated, which is called trim loss. The cutting stock problem presents itself in many industrial processes where the cutting of material is concerned, for instance the cutting of wood in the furniture industry, the cutting of glass and plastic sheets in the glass industry, the cutting of paper in the cardboard industry and the cutting of steel
APA, Harvard, Vancouver, ISO, and other styles
2

Cardozo, Arteaga Carmen. "Optimisation of power system security with high share of variable renewables : Consideration of the primary reserve deployment dynamics on a Frequency Constrained Unit Commitment model." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLC024/document.

Full text
Abstract:
Le placement de production (UC pour unit commitment) est une famille de problèmes d'optimisation qui déterminent l’état et la puissance de consigne des groupes de production pour satisfaire la demande électrique à moindre coût. Traditionnellement, une contrainte de sûreté détermine un certain volume de capacité raccordée disponible, appelé la réserve, destinée à gérer l'incertitude. Néanmoins, dans les petits systèmes la contrainte de réserve fixe peut entraîner dans certains cas une violation du critère N-1 bien que le volume de réserve minimale soit respecté. Plus récemment, la part croissan
APA, Harvard, Vancouver, ISO, and other styles
3

Soberanis, Policarpio Antonio. "Risk optimization with p-order conic constraints." Diss., University of Iowa, 2009. https://ir.uiowa.edu/etd/437.

Full text
Abstract:
My dissertation considers solving of linear programming problems with p-order conic constraints that are related to a class of stochastic optimization models with risk objective or constraints that involve higher moments of loss distributions. The general proposed approach is based on construction of polyhedral approximations for p-order cones, thereby approximating the non-linear convex p-order conic programming problems using linear programming models. It is shown that the resulting LP problems possess a special structure that makes them amenable to efficient decomposition techniques. The de
APA, Harvard, Vancouver, ISO, and other styles
4

Vitor, Fabio Torres. "Improving the solution time of integer programs by merging knapsack constraints with cover inequalities." Thesis, Kansas State University, 2015. http://hdl.handle.net/2097/19226.

Full text
Abstract:
Master of Science<br>Department of Industrial and Manufacturing Systems Engineering<br>Todd Easton<br>Integer Programming is used to solve numerous optimization problems. This class of mathematical models aims to maximize or minimize a cost function restricted to some constraints and the solution must be integer. One class of widely studied Integer Program (IP) is the Multiple Knapsack Problem (MKP). Unfortunately, both IPs and MKPs are NP-hard, potentially requiring an exponential time to solve these problems. Utilization of cutting planes is one common method to improve the solution time of
APA, Harvard, Vancouver, ISO, and other styles
5

Yahiaoui, Ala-Eddine. "Selective vehicle routing problem : cluster and synchronization constraints." Thesis, Compiègne, 2018. http://www.theses.fr/2018COMP2449/document.

Full text
Abstract:
Le problème de tournées de véhicules (Vehicle Routing Problem - VRP) est un problème d'optimisation combinatoire utilisé généralement pour modéliser et résoudre des différents problèmes rencontrés dans les systèmes logistiques et de transport. Dans cette thèse, nous nous sommes intéressés à l'étude et la résolution d'une classe de problèmes du VRP appelée les problèmes de courses d'orientation (Team Orienteering Problem - TOP). Dans cette catégorie de problèmes, il est a priori impossible de visiter tous les clients en raison de ressources limitées. On associe plutôt un profit à chaque client
APA, Harvard, Vancouver, ISO, and other styles
6

Carvalho, Alexandre Augusto Martins. "Proposta metodologica para racionalização de ociosidade fabril /." Guaratinguetá, 2019. http://hdl.handle.net/11449/182420.

Full text
Abstract:
Orientador: Marcos Valerio Ribeiro<br>Resumo: Ambientes industriais são altamente competitivos. Fatores como a agilidade, a flexibilidade, a prestação de serviços, a qualidade e preços são as vantagens competitivas procuradas pelas organizações. Neste cenário, as otimizações propostas que abordam tais fatores são de particular interesse para o planejamento de processos. O procedimento proposto tratado é o resultado líquido direto e o aumento da competitividade no mercado de uma determinada empresa, visando que sua estrutura financeira seja a mais saudável possível. Este trabalho tem como objet
APA, Harvard, Vancouver, ISO, and other styles
7

Hellman, Fredrik. "Towards the Solution of Large-Scale and Stochastic Traffic Network Design Problems." Thesis, Uppsala University, Department of Information Technology, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-130013.

Full text
Abstract:
<p>This thesis investigates the second-best toll pricing and capacity expansion problems when stated as mathematical programs with equilibrium constraints (MPEC). Three main questions are rised: First, whether conventional descent methods give sufficiently good solutions, or whether global solution methods are to prefer. Second, how the performance of the considered solution methods scale with network size. Third, how a discretized stochastic mathematical program with equilibrium constraints (SMPEC) formulation of a stochastic network design problem can be practically solved. An attempt to ans
APA, Harvard, Vancouver, ISO, and other styles
8

Abrantes, Ricardo Luiz de Andrade. "Problemas de corte com sobras aproveitáveis e eliminação de simetrias." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-16122012-183550/.

Full text
Abstract:
No presente trabalho estudamos duas variações do problema de empacotamento de itens retangulares idênticos, permitindo rotações de 90 graus, em um poliedro. Uma variação consiste em encontrar a maior quantidade de itens retangulares idênticos que podem ser empacotados em um poliedro. A outra consiste em encontrar o poliedro de um determinado tipo com menor área para empacotar uma quantidade fixa de itens retangulares idênticos. Desenvolvemos restrições de eliminação de simetrias para estes problemas, o que tornou a resolução dos mesmos mais eficiente, por métodos do tipo branch-&-bound.
APA, Harvard, Vancouver, ISO, and other styles
9

Hokama, Pedro Henrique Del Bianco 1986. "O problema do caixeiro viajante com restrições de empacotamento tridimensional." [s.n.], 2011. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275722.

Full text
Abstract:
Orientador: Flávio Keidi Miyazawa<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-19T18:16:55Z (GMT). No. of bitstreams: 1 Hokama_PedroHenriqueDelBianco_M.pdf: 1340789 bytes, checksum: b5cc3f26e41b90afabdfac5c7a33bf05 (MD5) Previous issue date: 2011<br>Resumo: Nesta dissertação de mestrado apresentamos um método exato para o Problema do Caixeiro Viajante com Restrições de Empacotamento Tridimensional, que combina o Problema do Caixeiro Viajante o Problema de Empacotamento Tridimensional com Restrição de Ordem. Nest
APA, Harvard, Vancouver, ISO, and other styles
10

Mesyagutov, Marat. "Exact Approaches for Higher-Dimensional Orthogonal Packing and Related Problems." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-137905.

Full text
Abstract:
NP-hard problems of higher-dimensional orthogonal packing are considered. We look closer at their logical structure and show that they can be decomposed into problems of a smaller dimension with a special contiguous structure. This decomposition influences the modeling of the packing process, which results in three new solution approaches. Keeping this decomposition in mind, we model the smaller-dimensional problems in a single position-indexed formulation with non-overlapping inequalities serving as binding constraints. Thus, we come up with a new integer linear programming model, which we su
APA, Harvard, Vancouver, ISO, and other styles
11

Melega, Gislaine Mara [UNESP]. "Problema integrado de dimensionamento de lotes e corte de estoque: modelagem matemática e métodos de solução." Universidade Estadual Paulista (UNESP), 2017. http://hdl.handle.net/11449/150002.

Full text
Abstract:
Submitted by GISLAINE MARA MELEGA null (gis_laine_m@hotmail.com) on 2017-03-27T18:20:11Z No. of bitstreams: 1 TESE_Gislaine Melega_Matemática.pdf: 2710288 bytes, checksum: 9c3a4e388e7584cf0423182dcfdcced8 (MD5)<br>Approved for entry into archive by Luiz Galeffi (luizgaleffi@gmail.com) on 2017-03-29T19:23:05Z (GMT) No. of bitstreams: 1 melega_gm_dr_sjrp.pdf: 2710288 bytes, checksum: 9c3a4e388e7584cf0423182dcfdcced8 (MD5)<br>Made available in DSpace on 2017-03-29T19:23:05Z (GMT). No. of bitstreams: 1 melega_gm_dr_sjrp.pdf: 2710288 bytes, checksum: 9c3a4e388e7584cf0423182dcfdcced8 (MD5) Pr
APA, Harvard, Vancouver, ISO, and other styles
12

Yang, Ching-Hang, and 楊靖航. "An Exact Algorithm for Constrained Two-Dimensional Cutting Problems." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/16368522931165429755.

Full text
Abstract:
碩士<br>明志科技大學<br>工業工程與管理研究所<br>99<br>The two-dimensional cutting stock problem consists of cutting a rectangular plate into specified smaller rectangular pieces, so that the objective function is optimized. This problem is also classified as NP-hard. In practical, raw material utilization has always been an important factor for the cutting industry, therefore, efficient use of the minimum quantity of raw plate in cutting while meet the requirements of the smaller pieces has become more important. In this research, we have developed an integer nonlinear programming formulation for optimizing
APA, Harvard, Vancouver, ISO, and other styles
13

Hegde, Abhijit. "Mechanics of cutting in granular media." Thesis, 2021. https://etd.iisc.ac.in/handle/2005/5828.

Full text
Abstract:
Cutting is an important deformation process encountered during many instances in the engineering of infrastructure, such as trawling, trenching, and excavation. This thesis presents the results of an experimental program on the orthogonal cutting of granular materials, performed under plane strain conditions. The kinematics of granular materials, when subjected to large deformations, is understood through direct imaging and concomitant image analysis. Three suites of experiments were performed to understand the effects of boundary conditions, material systems, and other constraints on the mec
APA, Harvard, Vancouver, ISO, and other styles
14

Chien, Shang-bin, and 簡尚彬. "Improved Constraint Handling in Optimization of Steel Bar Cutting Plan." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/12120752119134800024.

Full text
Abstract:
碩士<br>國立臺灣科技大學<br>營建工程系<br>97<br>For many years, the construction industry has been regarded as one of the main developed industries in Taiwan. Since the construction market has been under recession in recent years, many construction companies face a decrease in profit due to not well-planned cost control. Therefore, contractors have seen the cost control as an important task. As the technology changes day by day, it is desired that the cost control may be improved using advanced optimization techniques. The purpose of this research is to minimize the total cost of cutting steel bar, in other
APA, Harvard, Vancouver, ISO, and other styles
15

Shi-XianSue and 蘇士賢. "Machining Path Planning with Physical Constraints Based on Spline Curve and Its Application for Laser Cutting." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/7sskme.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Picard, Paul. "Do visual quality objectives necessarily constrain timber harvest levels? : subtitle exploring the potential of partial cutting." Thesis, 2002. http://hdl.handle.net/2429/13378.

Full text
Abstract:
The present thesis is an attempt to identify possible win:win solutions to the apparent and widely reported conflict between aesthetics and the practice of timber harvesting in British Columbia (BC). The approach used is to review the literature on silvicultural systems, Visual Resource Management (VRM) as practiced in BC, public perceptions of various harvesting practices, the relationship between aesthetics and timber harvest levels, and on long term timber supply implications of proposed solutions in order to provide for a more complete picture. A series of short-term modelling exerci
APA, Harvard, Vancouver, ISO, and other styles
17

Yu-ChiehTsai and 蔡妤潔. "Combining Cutting Plane Method and Local Search to Solve a Two-Echelon Repairable Inventory System Problem Subject to Service Level Constraints." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/49997681980815168047.

Full text
Abstract:
碩士<br>國立成功大學<br>工業與資訊管理學系<br>103<br>We address a two-echelon spare parts repairable inventory system consisting of a central repair warehouse and some regional depots. The objective is to determine an (S-1, S) pair that minimizes a cost function, defined only in terms of holding costs, subject to the constraint that the average response time to each customer is below a threshold level. To avoid the mistakes resulting from the approximation and implausible assumptions in traditional methods, we propose an algorithm based on simulation instead of queueing theory. The R＆S procedure can be used to
APA, Harvard, Vancouver, ISO, and other styles
18

Riaz, Muhammad Waqas. "Two-Echelon Supply Chain Design for Spare Parts with Time Constraints." Thesis, 2013. http://hdl.handle.net/10012/7914.

Full text
Abstract:
We consider a single-part, two-echelon supply chain problem for spare parts. The network consists of a single manufacturing plant, a set of service centers (SCs) and a set of customers. Both echelons keep spare parts using the base-stock replenishment policy. The plant behaves as an M/M/1 queueing system and has limited production and storage capacity. Demand faced by each SC follows an independent Poisson process. The problem is to determine optimal location-allocation and optimal base-stock levels at both echelons while satisfying the target service levels and customer preferences of SCs. W
APA, Harvard, Vancouver, ISO, and other styles
19

Mesyagutov, Marat. "Exact Approaches for Higher-Dimensional Orthogonal Packing and Related Problems." Doctoral thesis, 2013. https://tud.qucosa.de/id/qucosa%3A27750.

Full text
Abstract:
NP-hard problems of higher-dimensional orthogonal packing are considered. We look closer at their logical structure and show that they can be decomposed into problems of a smaller dimension with a special contiguous structure. This decomposition influences the modeling of the packing process, which results in three new solution approaches. Keeping this decomposition in mind, we model the smaller-dimensional problems in a single position-indexed formulation with non-overlapping inequalities serving as binding constraints. Thus, we come up with a new integer linear programming model, which we s
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!

To the bibliography