SciELO - Scientific Electronic Library Online

 
vol.16 issue1Numerical Infinite Series Solution of the Ground-Return Pollaczek IntegralDetermining Parameters for Images Amplification by Pulses Interpolation author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Ingeniería, investigación y tecnología

Print version ISSN 1405-7743

Abstract

GRACIA, María D.; MAR-ORTIZ, Julio  and  LAUREANO-CASANOVA, Oscar. A Computational Analysis of the Traveling Salesman and Cutting Stock Problems. Ing. invest. y tecnol. [online]. 2015, vol.16, n.1, pp.59-70. ISSN 1405-7743.

The aim of this article is to perform a computational study to analyze the impact of formulations, and the solution strategy on the algorithmic performance of two classical optimization problems: the traveling salesman problem and the cutting stock problem. In order to assess the algorithmic performance on both problems three dependent variables were used: solution quality, computing time and number of iterations. The results are useful for choosing the solution approach to each specific problem. In the STSP, the results demonstrate that the multistage decision formulation is better than the conventional formulations, by solving 90.47% of the instances compared with MTZ (76.19%) and DFJ (14.28%). The results of the CSP demonstrate that the cutting patterns formulation is better than the standard formulation with symmetry breaking inequalities, when the objective function is to minimize the loss of trim when cutting the rolls.

Keywords : integer programming; traveling salesman problem; cutting stock problem; problem formulations; optimization.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License