Metaheuristics and Hybridization applied to the problem of template design (TDP)

Metaheurísticos e Hibridación aplicados al problema del diseño de plantillas (TDP)

Main Article Content

David Rodríguez-Rueda
Abstract

The template design problem (TDP) is a combinatorial problem that is difficult to attack and that presents a high number of symmetries that adds complexity to solution.  Several techniques have been proposed in the literature to optimize your solution, ranging from complete methods to stochastic methods. In this article we are proposing the use of hybrid techniques. We intend to use a hybrid integrative approach that combines neighborhood-based and population-based local search techniques set up a technique called Memetic algorithm. We will use local neighborhood-based searches as local improvement operators, which allow us to exploit search areas that are potential. The use of a genetic algorithm will contribute as a mechanism to perform the search space exploration. An empirical analysis that compares the performance of all methods (that is, basic or hybrid algorithms) in the optimization of the problem, allows us to comparethe proposal described with the results obtained in the existing scientific literature.

Keywords

Downloads

Download data is not yet available.

Article Details

References
Amaya J, Cotta C, Fernández Leiva AJ (2011). Memetic cooperative models for the tool switching problem. Memetic Computing 3:199–216.

Feng Y, Wang GG, Deb S, Lu M, Zhao XJ (2017). Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization. Neural Computing and Applications 28(7):1619–1634, DOI 10.1007/s00521-015-2135-1 , URL https://doi.org/10.1007/s00521-015-2135-1.

Flener P, Frisch AM, Hnich B, Kzltan Z, Miguel I, Walsh T (2001). Matrix modelling. In: In: Proc. of the CP-01 Workshop on Modelling and Problem Formulation. International Conference on the Principles and Practice of Constraint Programming, available from: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.5946.

Hart WE (1994). Adaptive global optimization with local search. PhD thesis, University of California.

Kasemset C, Chernsupornchai J, Pala-ud W (2015). Application of mfca in waste reduction: case study on a small textile factory in thailand. Journal of Cleaner Production 108, Part B:1342 – 1351, DOI http://dx.doi.org/10.1016/j.jclepro.2014.09.071 , URL http://www.sciencedirect.com/science/article/pii/S0959652614010105, material Flow Cost Accounting.

Kulkarni AJ, Shabir H (2016). Solving 0–1 knapsack problem using cohort intelligence algorithm. International Journal of Machine Learning and Cybernetics 7(3):427–441, DOI 10.1007/s13042-014-0272-y , URL https://doi.org/10.1007/s13042-014-0272-y.

Prestwich S, Tarim A, Hnich B (2006). Template design under demand uncertainty by integer linear local search. International Journal of Production Research, 44(22):4915–4928.

Proll L, Smith B (1998). Ilp and constraint programming approaches to a template design problem. INFORMS Journal of Computing 10(3):265–275.

Rodríguez D, Cotta C, Fernández-Leiva AJ (2010). Un problema de diseño de plantillas: Un enfoque metaheurístico basado en búsqueda local. In: et al VC (ed) Algoritmos Evolutivos y bioinspirados (MAEB2010), Garceta, Valencia, pp 743–750.

Rodríguez D, Cotta C, Fernández-Leiva AJ (2011). The template design problem: A perspective with metaheuristics. In: in Computer Science LN (ed) Eighth IMACS Seminar on Monte Carlo Methods, Walter de Gruyter, Borovets, Bulgaria, pp 181–191.

Wang LK, Shammas NK, Hung YT (2016). Waste Treatment in the Metal Manufacturing, Forming, Coating, and Finishing Industries. Advances in Industrial and Hazardous Wastes Treatment, CRC Press, URL https://books.google.co.ve/books?id=7s-H4q8ddlgC.
OJS System - Metabiblioteca |