Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Metaheuristics for large-scale instances of the linear ordering problem

Full text
Author(s):
Sakuraba, Celso S. [1] ; Ronconi, Debora P. [1] ; Birgin, Ernesto G. [2] ; Yagiura, Mutsunori [3]
Total Authors: 4
Affiliation:
[1] Univ Sao Paulo, Dept Prod Engn, Polytech Sch, BR-05508070 Sao Paulo - Brazil
[2] Univ Sao Paulo, Inst Math & Stat, Dept Comp Sci, BR-05508090 Sao Paulo - Brazil
[3] Nagoya Univ, Grad Sch Informat Sci, Dept Comp Sci & Math Informat, Nagoya, Aichi 4648603 - Japan
Total Affiliations: 3
Document type: Journal article
Source: EXPERT SYSTEMS WITH APPLICATIONS; v. 42, n. 9, p. 4432-4442, JUN 1 2015.
Web of Science Citations: 2
Abstract

This paper presents iterated local search and great deluge trajectory metaheuristics for the linear ordering problem (LOP). Both metaheuristics are based on the TREE local search method introduced in Sakuraba and Yagiura (2010) that is the only method ever applied to a set of large-sized instances that are in line with the scale of nowadays real applications. By providing diversification and intensification features, the introduced methods improve all best known solutions of the large-sized instances set. Extensive numerical experiments show that the introduced methods are capable of tackling sparse and dense large-scale instances with up to 8000 vertices and 31,996,000 edges in a reasonable amount of time; while they also performs well in practice when compared with other state-of-the-art methods in a benchmark with small and medium-scale instances. (C) 2015 Elsevier Ltd. All rights reserved. (AU)

FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
Grantee:Francisco Louzada Neto
Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
FAPESP's process: 10/08434-1 - Non-Exact Optimization Algorithms for Sequencing Problems
Grantee:Celso Satoshi Sakuraba
Support Opportunities: Scholarships in Brazil - Post-Doctoral
FAPESP's process: 13/05475-7 - Computational methods in optimization
Grantee:Sandra Augusta Santos
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 10/10133-0 - Cutting, packing, lot-sizing and scheduling problems and their integration in industrial and logistics settings
Grantee:Reinaldo Morabito Neto
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science
Grantee:Carlos Eduardo Ferreira
Support Opportunities: Research Projects - Thematic Grants