TITLE

BOOSTING THE PERFORMANCE OF METAHEURISTICS FOR THE MINLA PROBLEM USING A MORE DISCRIMINATING EVALUATION FUNCTION

AUTHOR(S)
Rodriguez-Tello, Eduardo; Jin-Kao Hao; Romero-Monsivais, Hillel
PUB. DATE
January 2015
SOURCE
Tehnicki vjesnik / Technical Gazette;Jan/Feb2015, Vol. 22 Issue 1, p11
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This paper investigates the role of evaluation function used by metaheuristics for solving combinatorial optimization problems. Evaluation function (EF) is a key component of any metaheuristic algorithm and its design directly influences the performance of such an algorithm. However, the design of more discriminating EFs is somewhat overlooked in the literature. We present in this work the first in-depth analysis of the conventional EF for the Minimum Linear Arrangement (MinLA) problem. The results from this study highlighted its potential drawbacks and led to useful insight and information which guided us to design a new more discerning EF. Its practical usefulness was assessed within three different algorithms: a parameter-free Steepest Descent, an Iterated Local Search and a Tabu Search. The analysis of the data produced by these comparisons showed that the performance of the three adopted approaches could be boosted by using the proposed more discriminating EF.
ACCESSION #
101407363

 

Related Articles

  • Traveling Transportation Problem Optimization by Adaptive Current Search Method. Suwannarongsri, Supaporn; Tika Bunnag; Waraporn Klinbun // International Journal of Modern Education & Computer Science;May2014, Vol. 6 Issue 5, p33 

    The adaptive current search (ACS) is one of the novel metaheuristic optimization search techniques proposed for solving the combinatorial optimization problems. This paper aimed to present the application of the ACS to optimize the real-world traveling transportation problems (TTP) of a specific...

  • USING COLUMN GENERATION TO COMPUTE LOWER BOUND SETS FOR BI-OBJECTIVE COMBINATORIAL OPTIMIZATION PROBLEMS. SARPONG, BOADU MENSAH; ARTIGUES, CHRISTIAN; JOZEFOWIEZ, NICOLAS // RAIRO -- Operations Research;Jul2015, Vol. 49 Issue 3, p527 

    We discuss the use of column generation in a bi-objective setting. Just as in single objective combinatorial optimization, the role of column generation in the bi-objective setting is to compute dual bounds (i.e. lower bounds for minimization problems and upper bounds for maximization problems)...

  • Landscape analysis and efficient metaheuristics for solving the n-queens problem. Masehian, Ellips; Akbaripour, Hossein; Mohabbati-Kalejahi, Nasrin // Computational Optimization & Applications;Dec2013, Vol. 56 Issue 3, p735 

    The n-queens problem is a classical combinatorial optimization problem which has been proved to be NP-hard. The goal is to place n non-attacking queens on an n× n chessboard. In this paper, two single-solution-based (Local Search (LS) and Tuned Simulated Annealing (SA)) and two...

  • Multiple parameter control for ant colony optimization applied to feature selection problem. Wang, Gang; Chu, HaiCheng; Zhang, Yuxuan; Chen, Huiling; Hu, Weitong; Li, Ying; Peng, XuJun // Neural Computing & Applications;Oct2015, Vol. 26 Issue 7, p1693 

    The ant colony optimization algorithm (ACO) was initially developed to be a metaheuristic for combinatorial optimization problem. In scores of experiments, it is confirmed that the parameter settings in ACO have direct effects on the performance of the algorithm. However, few studies have...

  • Parallel Methods of Solving of Supply Problem Using Ant Colony Optimization. Piecka, Stanislav // Information Sciences & Technologies: Bulletin of the ACM Slovaki;Mar2013, Vol. 5 Issue 1, p1 

    Presented work focuses on solving of the vehicle routing problem, which is considered as a basic supply problem. The main motivation is to achieve high quality solutions of the vehicle routing problem in the shortest possible time. It tries to achieve this goal via parallelization of the ant...

  • On Metaheuristic Optimization Motivated by the Immune System. Elettreby, Mohammed Fathy; Ahmed, Elsayd; Khenous, Houari Boumedien // Applied Mathematics;Jan2014, Vol. 5 Issue 2, p318 

    In this paper, we modify the general-purpose heuristic method called extremal optimization. We compare our results with the results of Boettcher and Percus [1]. Then, some multiobjective optimization problems are solved by using methods motivated by the immune system.

  • Bacterial Foraging Optimization Algorithm for assembly line balancing. Atasagun, Yakup; Kara, Yakup // Neural Computing & Applications;Jul2014, Vol. 25 Issue 1, p237 

    Assembly line balancing is the problem of assigning tasks to workstations by optimizing a performance measure while satisfying precedence relations between tasks and cycle time restrictions. Many exact, heuristic and metaheuristic approaches have been proposed for solving simple straight and...

  • A Simulated Annealing approach for solving Minimum Manhattan Network Problem. Ferdous, S. M.; Das, Anindya // International Journal of Computer Applications;Jul2014, Vol. 98, p1 

    In this paper we address the Minimum Manhattan Network (MMN) problem. It is an important geometric problem with vast applications. As it is an NP-complete discrete combinatorial optimization problem we employ a simple metaheuristic namely Simulated Annealing. We have also developed benchmark...

  • Solving the n-Queens Problem Using a Tuned Hybrid Imperialist Competitive Algorithm. Masehian, Ellips; Akbaripour, Hossein; Mohabbati-Kalejahi, Nasrin // International Arab Journal of Information Technology (IAJIT);Nov2014, Vol. 11 Issue 6, p550 

    The n-queens problem is a classical combinatorial optimization problem which has been proved to be NP-hard. The goal is to place n non-attacking queens on an n x n chessboard. In this paper, the Imperialist Competitive Algorithm (ICA), which is a recent evolutionary metaheuristic method, has...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics