0000000001035161

AUTHOR

Antonio Martinez-sykora

showing 3 related works from this author

Constructive procedures to solve 2-dimensional bin packing problems with irregular pieces and guillotine cuts

2015

Abstract This paper presents an approach for solving a new real problem in cutting and packing. At its core is an innovative mixed integer programme model that places irregular pieces and defines guillotine cuts. The two-dimensional irregular shape bin packing problem with guillotine constraints arises in the glass cutting industry, for example, the cutting of glass for conservatories. Almost all cutting and packing problems that include guillotine cuts deal with rectangles only, where all cuts are orthogonal to the edges of the stock sheet and a maximum of two angles of rotation are permitted. The literature tackling packing problems with irregular shapes largely focuses on strip packing i…

Mathematical optimizationInformation Systems and ManagementBin packing problemStrategy and ManagementManagement Science and Operations ResearchComputer Science::Computational GeometryHybrid algorithmConstructiveBinPacking problemsCutting stock problemRectangleInteger (computer science)Mathematics
researchProduct

The Steiner Traveling Salesman Problem and its extensions

2019

Abstract This paper considers the Steiner Traveling Salesman Problem, an extension of the classical Traveling Salesman Problem on an incomplete graph where not all vertices have demand. Some extensions including several depots or location decisions are introduced, modeled and solved. A compact integer linear programming formulation is proposed for each problem, where the routes are represented with two-index decision variables, and parity conditions are modeled using cocircuit inequalities. Exact branch-and-cut algorithms are developed for all formulations. Computational results obtained confirm the good performance of the algorithms. Instances with up to 500 vertices are solved optimally.

Discrete mathematics050210 logistics & transportation021103 operations researchInformation Systems and ManagementGeneral Computer ScienceComputer science05 social sciences0211 other engineering and technologies02 engineering and technologyManagement Science and Operations ResearchTravelling salesman problemIndustrial and Manufacturing EngineeringGraphVertex (geometry)Modeling and Simulation0502 economics and businessInteger programmingBranch and cutMathematicsofComputing_DISCRETEMATHEMATICSEuropean Journal of Operational Research
researchProduct

Matheuristics for the irregular bin packing problem with free rotations

2017

[EN] We present a number of variants of a constructive algorithm able to solve a wide variety of variants of the Two-Dimensional Irregular Bin Packing Problem (2DIBPP). The aim of the 2DIBPP is to pack a set of irregular pieces, which may have concavities, into stock sheets (bins) with fixed dimensions in such a way that the utilization is maximized. This problem is inspired by a real application from a ceramic company in Spain. In addition, this problem arises in other industries such as the garment industry or ship building. The constructive procedure presented in this paper allows both free orientation for the pieces, as in the case of the ceramic industry, or a finite set of orientation…

Mathematical optimization021103 operations researchInformation Systems and ManagementGeneral Computer ScienceBin packing problemESTADISTICA E INVESTIGACION OPERATIVA0211 other engineering and technologies02 engineering and technologyManagement Science and Operations ResearchStrip packingTwo-dimensional irregular bin packingConstructiveIndustrial and Manufacturing EngineeringBinCutting and packingSet packingCutting stock problemModeling and Simulation0202 electrical engineering electronic engineering information engineeringInteger Programing020201 artificial intelligence & image processingFree rotationFinite setMathematics
researchProduct