Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6897134 | European Journal of Operational Research | 2015 | 18 Pages |
Abstract
In this paper we review and propose different adaptations of the GRASP metaheuristic to solve multiobjective combinatorial optimization problems. In particular, we describe several alternatives to specialize the construction and improvement components of GRASP when two or more objectives are considered. GRASP has been successfully coupled with Path Relinking for single-objective optimization. Moreover, we propose different hybridizations of GRASP and Path Relinking for multiobjective optimization. We apply the proposed GRASP with Path Relinking variants to two combinatorial optimization problems, the biobjective orienteering problem and the biobjective path dissimilarity problem. We report on empirical tests with 70 instances and 30 algorithms, that show that the proposed heuristics are competitive with the state-of-the-art methods for these problems.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Rafael MartÃ, Vicente Campos, Mauricio G.C. Resende, Abraham Duarte,