Academic literature on the topic 'Cutting stock problem Mathematical models'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Cutting stock problem Mathematical models.'
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.
Journal articles on the topic "Cutting stock problem Mathematical models"
Poltroniere, Sônia Cristina, Silvio Alexandre Araujo, and Kelly Cristina Poldi. "Optimization of an Integrated Lot Sizing and Cutting Stock Problem in the Paper Industry." TEMA (São Carlos) 17, no. 3 (December 20, 2016): 305. http://dx.doi.org/10.5540/tema.2016.017.03.0305.
Full textFarley, Alan A. "Mathematical Programming Models for Cutting-Stock Problems in the Clothing Industry." Journal of the Operational Research Society 39, no. 1 (January 1988): 41. http://dx.doi.org/10.2307/2581997.
Full textFarley, Alan A. "Mathematical Programming Models for Cutting-Stock Problems in the Clothing Industry." Journal of the Operational Research Society 39, no. 1 (January 1988): 41–53. http://dx.doi.org/10.1057/jors.1988.6.
Full textDelorme, Maxence, Manuel Iori, and Silvano Martello. "Bin packing and cutting stock problems: Mathematical models and exact algorithms." European Journal of Operational Research 255, no. 1 (November 2016): 1–20. http://dx.doi.org/10.1016/j.ejor.2016.04.030.
Full textPoldi, Kelly Cristina, and Silvio Alexandre de Araujo. "Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem." Annals of Operations Research 238, no. 1-2 (January 18, 2016): 497–520. http://dx.doi.org/10.1007/s10479-015-2103-2.
Full textWang, Fu-Kwun, and Feng-Tai Liu. "Flexible Stock Allocation and Trim Loss Control for Cutting Problem in the Industrial-Use Paper Production." Mathematical Problems in Engineering 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/521386.
Full textSá Santos, José Victor, and Napoleão Nepomuceno. "Computational Performance Evaluation of Column Generation and Generate-and-Solve Techniques for the One-Dimensional Cutting Stock Problem." Algorithms 15, no. 11 (October 25, 2022): 394. http://dx.doi.org/10.3390/a15110394.
Full textLi, Yan Cang, Juan Juan Suo, and Shu Jing Zhou. "Improved ACO for Dimensional Cutting-Stock Problem." Applied Mechanics and Materials 26-28 (June 2010): 277–80. http://dx.doi.org/10.4028/www.scientific.net/amm.26-28.277.
Full textArenales, Marcos Nereu, Adriana Cristina Cherri, Douglas N. do Nascimento, and Andréa Vianna. "A NEW MATHEMATICAL MODEL FOR THE CUTTING STOCK/LEFTOVER PROBLEM." Pesquisa Operacional 35, no. 3 (December 2015): 509–22. http://dx.doi.org/10.1590/0101-7438.2015.035.03.0509.
Full textSugi, Masao, Yusuke Shiomi, Tsuyoshi Okubo, Kazuyoshi Inoue, and Jun Ota. "A Solution for 2D Rectangular Cutting Stock Problems with 3-Stage Guillotine-Cutting Constraint." International Journal of Automation Technology 4, no. 5 (September 5, 2010): 461–68. http://dx.doi.org/10.20965/ijat.2010.p0461.
Full textDissertations / Theses on the topic "Cutting stock problem Mathematical models"
Wong, Chun Chuen. "Graph approach modeling and optimal heuristics for the one-dimensional cutting and packing problems." HKBU Institutional Repository, 2002. http://repository.hkbu.edu.hk/etd_ra/444.
Full textHallbäck, Sofia, and Ellen Paulsson. "Reducing waste with an optimized trimming model in production planning." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-173253.
Full textMarciniuk, Fernanda Ledo. "Uma aplicação do algoritmo colonia de formigas no problema de corte ordenado." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306264.
Full textDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica
Made available in DSpace on 2018-08-15T18:13:59Z (GMT). No. of bitstreams: 1 Marciniuk_FernandaLedo_M.pdf: 1221484 bytes, checksum: b1408936331c027b4c3cc1129bc0105a (MD5) Previous issue date: 2010
Resumo: O problema de corte de estoque ordenado, um problema relativamente novo na literatura, e uma adaptação do problema de corte de estoque tradicional onde algumas restrições quanto a limitação do numero de ordens de produção em processamento são adicionadas. Esta dissertação tem como objetivo estudar uma nova abordagem deste problema utilizando uma aplicação da metaheurística colônia de formigas. Esta metaheurística utiliza os princípios de auto-organização de uma população de formigas visando a resolução de problemas de otimização combinatorial
Abstract: The Ordered Cutting Stock Problem (OCSP), a relatively recent problem in technical literarture, is a variant of the more well-known Cutting Stock Problem (CSP). This variant includes some new constraints in the mathematical formulation, regarding the number of production orders being processed simultaneously. This work studies a new approach to solve the OCSP, applying the Ant Colony Optimization (ACO) metaheurisitic. This metaheuristic is based in the self-organizing principles that govern ant population's behaviour, solving combinatorial optimization problems
Mestrado
Pesquisa Operacional
Mestre em Matemática Aplicada
Coutinho, Maiko Willian. "O problema de corte de estoque e aplicações /." São José do Rio Preto, 2019. http://hdl.handle.net/11449/191339.
Full textResumo: A Matemática está constantemente presente em nosso cotidiano, sendo ferramenta importante para uma melhor compreensão do mundo e facilitadora dos processos de tomada de decisão. Neste sentido, o trabalho com resolução de problemas ao longo da formação escolar básica faz-se extremamente necessário. Inserida neste contexto, a modelagem matemática é uma ferramenta que permite uma melhor leitura e um tratamento mais adequado do problema. Essa dissertação aborda, inicialmente, conceitos básicos relativos ao Problema de Corte de Estoque e a sua modelagem matemática, com ênfase na definição dos padrões de corte. Posteriormente, é discutido o método branch-and-bound, utilizado na resolução de problemas de otimização linear inteira, como é o caso do problema de corte. Por m, são propostas duas situações-problema, que consideram aplicações do Problema de Corte, para serem trabalhados com alunos do Ensino Médio, considerando os conceitos matemáticos assimilados previamente.
Abstract: Mathematics is constantly present in our daily lives, being an important tool for a bet ter understanding of the world and facilitating decision making processes. In this sense, problem-solving work throughout basic school education is extremely necessary. In this context, mathematical modeling is a tool that allows a better reading and a better treat ment of the problem. This dissertation initially addresses the basic concepts related to the Cutting Stock Problem and the mathematical modeling for the one-dimensional case, with emphasis on the de nition of the cutting patterns. Subsequently, the Branch-and-bound method, used in solving Integer Linear Programming Problems, such as the cutting pro blem, is discussed. Finally, problem situations are proposed, which consider applications of the Cutting Stock Problem, to be worked with high school students, emphasizing the previously assimilated mathematical concepts.
Mestre
Ravelo, Santiago Valdes. "Modelos matemáticos e algoritmos para problemas combinatórios." Universidade Federal de Goiás, 2011. http://repositorio.bc.ufg.br/tede/handle/tede/5354.
Full textApproved for entry into archive by Erika Demachki (erikademachki@gmail.com) on 2016-03-17T17:35:15Z (GMT) No. of bitstreams: 2 Dissertação - Santiago Valdés Ravelo - 2011.pdf: 730949 bytes, checksum: 92c89c8c1f240082004834898896b9ba (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Made available in DSpace on 2016-03-17T17:35:15Z (GMT). No. of bitstreams: 2 Dissertação - Santiago Valdés Ravelo - 2011.pdf: 730949 bytes, checksum: 92c89c8c1f240082004834898896b9ba (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2011-02-18
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
This work considers three relevant NP-hard problems. The firstone is the one-dimensional cutting stock problem in which the non-used material in the cutting patterns may be used in the future. For this problem we analyze the existing mathematical models, propose new models, design a heuristic and two metaheuristic approaches, being their performances improved by using parallel programming, and solve instances, practical and randomly generated, from the literature. The computational experiments were quite good for all tested instances. The second problem we consider is the stable roommates problem (a variant of the stable matching problem). For this we give two mathematical programming models, sequential and parallel implementations of a Tabu Search, and a Branch-andBound. Also, we report computational experiments to instances of the problem. The last problem we consider is the compartmentalized knapsack problem (a generalization of the knapsack problem) for which we analyze a quadratic integer model and give a linear integer model. We design a greedy heuristic and a GRASP algorithm, that uses path-relinking, and solve randomly generated instances. All parallel implementations use Graphics Processing Units (GPUs).
Este trabalho considera três problemas, NP-difíceis, relevantes de estudo em otimização combinatória. O primeiro deles é o problema de corte uni-dimensional de objetos, onde o material não usado pelos padrões de corte pode ser usado no futuro. Para este problema analisamos os modelos matemáticos existentes, propomos novos modelos, projetamos uma heurística construtiva e duas metaheurísticas, sendo seus desempenhos melhorados com programação paralela, e resolvemos instâncias, práticas e aleatórias, encontradas na literatura; sendo os experimentos computacionais muito bons para todas as intânciastestadas.Osegundoproblemaqueconsideramoséoproblemadoscompanheiros estáveis (stable roommates problem), uma variante do problema de emparelhamento estável (stable matching problem). Para este propomos dois modelos matemáticos, uma implementação sequencial e uma paralela de uma Tabu Search, e um Branch-andBound. Também reportamos experimentos computacionais para instâncias do problema. O último problema considerado é o da mochila compartimentada (uma generalização do problema clássico da mochila), para o qual analisamos uma modelagem quadrática inteira e propomos um modelo linear inteiro; também projetamos uma heurística gulosa, um algoritmo GRASP, que usa path-relinking, e resolvemos intâncias geradas aleatóriamente. Todas as implementações em paralelo usam unidades de processamento gráfico (Graphics Processing Units, GPUs).
Yu-ChingLiu and 劉育青. "Using Mathematical Programming and Heuristic Methods to Solve the Cutting Stock Problem for Bias Product." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/15669696690420369037.
Full text國立成功大學
工業與資訊管理學系專班
98
The cutting stock problem (CSP) was classified to NP-Hard problem. Most scholars used the mathematical with heuristic methods to solve rectangle space cutting problem. In TFT-LCD industrial, some high polymer film need be used with angle in inlayer. To achieve the customer request, the material need be cut with angle and that will cause some useless triangle part. We not found any paper discuss about the bias product cutting problem as our searching. This paper will use mathematical with heuristic methods to solve bias product cutting problem. We will show the mathematical model of the bias product cutting process by guillotine, before to construct mathematical programming model. After the mathematical model constructed, the basic yield and basic pattern will defined. In order to get higher yield, we try to use four kinds of heuristic methods to fill the available product in useless space and to verify the best one. In this paper, we used real order data that got from a polarizer maker to verify our model. We suggested using Best Fit (BF) heuristic methods to solve the problem and approved our methods could help to get more usage part than the original polarizer maker. By the research result, also suggest controlling material width、material width quantity and calculating volume of orders to get more benefit.
Books on the topic "Cutting stock problem Mathematical models"
Archibald, T. W. An optimal policy for a two depot inventory problem with stock transfer. Edinburgh: University of Edinburgh, Management School, 1994.
Find full textInstituti i Informatikës dhe Matematikës së Aplikuar (Akademia e Shkencave e RSH), ed. Përmbledhje punimesh në informatikë dhe matematikë të aplikuar. Tiranë: Republika e Shqipërisë Akademia e Shkencave, Instituti i Informatikës dhe Matematikës së Aplikuar, 1995.
Find full textBook chapters on the topic "Cutting stock problem Mathematical models"
Nickels, W. "A Knowledge-Based System for Integrated Solving Cutting Stock Problems and Production Control in the Paper Industry." In Mathematical Models for Decision Support, 471–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/978-3-642-83555-1_28.
Full textRipatti, Artem V., and Vadim M. Kartak. "Sensitive Instances of the Cutting Stock Problem." In Mathematical Optimization Theory and Operations Research, 80–87. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58657-7_9.
Full textRipatti, Artem V., and Vadim M. Kartak. "Bounds for Non-IRUP Instances of Cutting Stock Problem with Minimal Capacity." In Mathematical Optimization Theory and Operations Research, 79–85. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-33394-2_7.
Full textQu, Shengyuan, Zhongwen Luo, Zhen Wang, and Hongzhou Wang. "Forest Benefit-Rotation Model Considering Carbon Sequestration, Ecological and Social Benefits." In Advances in Transdisciplinary Engineering. IOS Press, 2022. http://dx.doi.org/10.3233/atde220298.
Full textGönül Sezer, Eylül Damla, and Duygun Fatih Demirel. "Examining the Effects of Mucilage in the Marmara Sea on Fisheries, Tourism, and Maritime Transportation via the System Dynamics Approach." In Handbook of Research on Water Sciences and Society, 101–22. IGI Global, 2022. http://dx.doi.org/10.4018/978-1-7998-7356-3.ch005.
Full textConference papers on the topic "Cutting stock problem Mathematical models"
Lazoglu, Ismail, and Yusuf Altintas. "Prediction of Tool and Chip Temperature in Continuous Metal Cutting and Milling." In ASME 2000 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2000. http://dx.doi.org/10.1115/imece2000-1895.
Full textРязанов, С., S. Ryazanov, Михаил Решетников, and Mihail Reshetnikov. "Geometrical Model of the Manufacturing Surface of the Equivalent Working Surface of the Fine Tooth Dolbyak." In 29th International Conference on Computer Graphics, Image Processing and Computer Vision, Visualization Systems and the Virtual Environment GraphiCon'2019. Bryansk State Technical University, 2019. http://dx.doi.org/10.30987/graphicon-2019-1-196-200.
Full textBerezkin, Vladimir, Anar Sharifov, Elena Khatmullina, Evgeniy Yudin, and Ildus Khatmullin. "A Tool and Mathematical Model for Estimation of Wells Initial Water-Cut and Residual Oil Reserves on Large-Sized Oil Fields." In SPE Annual Caspian Technical Conference. SPE, 2021. http://dx.doi.org/10.2118/207076-ms.
Full textBerezkin, Vladimir, Anar Sharifov, Elena Khatmullina, Evgeniy Yudin, and Ildus Khatmullin. "A Tool and Mathematical Model for Estimation of Wells Initial Water-Cut and Residual Oil Reserves on Large-Sized Oil Fields." In SPE Annual Caspian Technical Conference. SPE, 2021. http://dx.doi.org/10.2118/207076-ms.
Full textLortz, Wolfgang, and Radu Pavel. "Advanced Modeling of Drilling – Realistic Process Mechanics Leading to Helical Chip Formation." In ASME 2021 16th International Manufacturing Science and Engineering Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/msec2021-63790.
Full text