Iterated local search for the linear ordering problem Report as inadecuate




Iterated local search for the linear ordering problem - Download this document for free, or read online. Document in PDF available to download.

Shulamith S. Bastiani Medina ;International Journal of Combinatorial Optimization Problems and Informatics 2012, 3 1

Author: Guadalupe Castilla Valdez

Source: http://www.redalyc.org/articulo.oa?id=265224466003


Teaser



International Journal of Combinatorial Optimization Problems and Informatics E-ISSN: 2007-1558 editor@ijcopi.org International Journal of Combinatorial Optimization Problems and Informatics México Castilla Valdez, Guadalupe; Bastiani Medina, Shulamith S. Iterated Local search for the Linear Ordering Problem International Journal of Combinatorial Optimization Problems and Informatics, vol.
3, núm.
1, eneroabril, 2012, pp.
12-20 International Journal of Combinatorial Optimization Problems and Informatics Morelos, México Available in: http:--www.redalyc.org-articulo.oa?id=265224466003 How to cite Complete issue More information about this article Journals homepage in redalyc.org Scientific Information System Network of Scientific Journals from Latin America, the Caribbean, Spain and Portugal Non-profit academic project, developed under the open access initiative © International Journal of Combinatorial Optimization Problems and Informatics, Vol.
3, No.
1, Jan-April 2012, pp.
12-20.
ISSN: 2007-1558. Iterated Local search for the Linear Ordering Problem Guadalupe Castilla Valdez, Shulamith S.
Bastiani Medina Instituto Tecnológico de Ciudad Madero, México. gpe_cas@yahoo.com.mx, b_shulamith@hotmail.com Abstract.
This paper addresses the linear ordering problem, which has been solved using different metaheuristics approaches.
These algorithms have the common problem of finding a proper balance of the intensification and diversification processes; in this work we propose an iterated local search in which it is incorporated a Becker heuristic strategy for constructing the initial solution, and a search strategy as perturbation process, achieving a better balance between intensification and diversification.
The proposed algorithm obtained an improvement greater than 90%, decreasing the average percentage error respect the state of art ILS algorithm.
The Wilcoxon nonparametric statistical test shows that the proposed algorithm significantly outperforms the iterate...





Related documents