# Comparison Of Metaheuristics

J. Silberholz, B. Golden

Published 2010 · Computer Science

Metaheuristics are truly diverse in nature—under the overarching theme of performing operations to escape local optima, algorithms as different as ant colony optimization, tabu search, harmony search, and genetic algorithms have emerged. Due to the unique functionality of each type of metaheuristic, comparison of metaheuristics is in many ways more difficult than other algorithmic comparisons. In this chapter, we discuss techniques for meaningful comparison of metaheuristics. We discuss how to create and classify instances in a new testbed and how to make sure other researchers have access to the problems for future metaheuristic comparisons. Further, we discuss the disadvantages of large parameter sets and how to measure complicating parameter interactions in a metaheuristic’s parameter space. Last, we discuss how to compare metaheuristics in terms of both solution quality and runtime.

This paper references

10.7551/mitpress/3615.003.0021

Twelve ways to fool the masses when giving performance results on parallel computers

D. Bailey (1991)

Algorithms and solutions to multi-level vehicle routing problems

I. Chao (1993)

An algorithm for the vehicle d ispatching problem

N. Christofides (1969)

A bran ch-and-cut algorithm for the symmetric generalized traveling salesman problem

M. Fischetti (1997)

10.1007/978-3-662-03315-9

Genetic Algorithms + Data Structures = Evolution Programs

Z. Michalewicz (1996)

A tabu search heuri stic for the undirected selective travelling salesman problem

M. Gendreau (1998)

10.1287/inte.20.4.74

Tabu Search: A Tutorial

F. Glover (1990)

10.1093/biomet/33.4.305

THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTS

R. Plackett (1946)

Ph

李幼升 (1989)

10.1287/ijoc.3.4.376

TSPLIB - A Traveling Salesman Problem Library

G. Reinelt (1991)

10.1198/tech.2006.s372

The Design and Analysis of Experiments

Margaret J. Robertson (1953)

Four-space visualization of 4d objects

Steve Hollasch (1991)

Understanding Interactions among Genetic Algorithm Parameters

K. Deb (1998)

Twelve Ways to Fool the Masses When Giving Performance Results on Parallel Computers

A. Davison (1995)

10.1023/A:1026569813391

Using Experimental Design to Find Effective Parameter Settings for Heuristics

S. Coy (2001)

10.1016/S0377-2217(99)00485-3

Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem

S. Hartmann (2000)

The design of optimum multifac orial experiments

R. Plackett (1946)

10.1007/BFb0056912

Parameter-Free Genetic Algorithm Inspired by "Disparity Theory of Evolution"

H. Sawai (1998)

A one-parameter geneti c algorithm for the minimum labeling spanning tree problem

Y. Xiong (2005)

An effective genetic algorit hm for the minimum-label spanning tree problem

J. Nummela (2006)

10.1287/ijoc.8.3.318

Use of Representative Operation Counts in Computational Testing of Algorithms

R. Ahuja (1996)

10.1057/palgrave.jors.2602603

The capacitated team orienteering and profitable tour problems

C. Archetti (2009)

10.1109/TEVC.2004.840145

A one-parameter genetic algorithm for the minimum labeling spanning tree problem

Yupei Xiong (2005)

10.1016/j.cor.2008.11.013

Design and analysis of stochastic local search for the multiobjective traveling salesman problem

L. Paquete (2009)

The split delivery vehicl e routing problem: Applications, algorithms, test problems, and computational results

S. Chen (2007)

10.1287/opre.45.3.378

A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem

M. Fischetti (1997)

10.1016/j.cor.2005.10.015

A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem

F. Li (2007)

10.1287/ijoc.1040.0123

The Multilevel Capacitated Minimum Spanning Tree Problem

Ioannis Gamvros (2006)

10.1016/j.ejor.2005.12.008

Meta-Heuristics for Dynamic Lot Sizing: A Review and Comparison of Solution Approaches

R. Jans (2007)

Using artificial neural networks to solve generalized orienteering problems

Q Wang (1996)

The effective application o f a new approach to the generalized orienteering problem (2009). Accepted for publication

J. Silberholz (2009)

10.1002/NET.V49:4

The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results

Si Chen (2007)

10.1109/mci.2006.1597059

Evolutionary multi-objective optimization: a historical view of the field

C.A. Coello Coello (2006)

10.1145/376656.376823

Benchmarking Java against C and Fortran for scientific applications

J. Bull (2001)

Using artificial neural n etworks to solve generalized orienteering problems

Q. Wang (1996)

10.1007/s10732-009-9104-8

The effective application of a new approach to the generalized orienteering problem

John Silberholz (2010)

10.1016/j.cor.2003.10.002

Very large-scale vehicle routing: new test problems, algorithms, and results

F. Li (2005)

10.1145/141868.141871

Performance of various computers using standard linear equations software

J. Dongarra (1992)

10.1145/1830761.1830899

Ant colony optimization

M. López-Ibáñez (2004)

10.1057/jors.1969.75

An Algorithm for the Vehicle-dispatching Problem

Nicos Christofides (1969)

10.1145/1143997.1144097

An effective genetic algorithm for the minimum-label spanning tree problem

Jeremiah Nummela (2006)

10.1016/j.cor.2005.11.018

The open vehicle routing problem: Algorithms, large-scale test problems, and computational results

F. Li (2007)

Design and analysis of stocha stic local search for the multiobjective traveling salesman problem

L. Paquete (2009)

10.1016/S0377-2217(97)00289-0

A tabu search heuristic for the undirected selective travelling salesman problem

M. Gendreau (1998)

Experimental evaluation of s tate-of-the-art heuristics for the resource-constrained project scheduling problem

S. Hartmann (2000)

The multilevel ca pa itated minimum spanning tree problem

I. Gamvros (2006)

10.1287/trsc.30.4.379

A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem

J. Xu (1996)

This paper is referenced by

10.1007/S10696-016-9242-X

Determining departure times in dynamic and stochastic maritime routing and scheduling problems

Gregorio Tirado (2017)

10.1016/j.envsoft.2013.07.006

Integrated assessment model of society-biosphere-climate-economy-energy system

M. K. Akhtar (2013)

10.1080/18756891.2014.966992

A Self-Adaptive Heuristic Algorithm for Combinatorial Optimization Problems

Cigdem Alabas-Uslu (2014)

10.1007/S40092-014-0066-6

The application of fuzzy Delphi and fuzzy inference system in supplier ranking and selection

Farzad Tahriri (2014)

10.1109/SPEC.2017.8333647

Population-based metaheuristics in microgrids applications

Yamisleydi Salgueiro-Sicilia (2017)

10.3233/IDT-150245

Novel metaheuristic optimization strategies for plug-in hybrid electric vehicles: A holistic review

I. Rahman (2016)

10.11591/ijeecs.v11.i1.pp121-128

Hybrid Artificial Neural Network with Meta-heuristics for Grid-Connected Photovoltaic System Output Prediction

Norfarizani Nordin (2018)

An Empirical Performance Comparison of Meta-heuristic Algorithms for School Bus Routing Problem

Sherehe Semba (2019)

What Works Best When? A Framework for Systematic Heuristic Evaluation

Iain Dunning (2015)

Automated Airspace Sectorization by Genetic Algorithm

M. Sergeeva (2017)

10.4018/jamc.2010100104

DIMMA: A Design and Implementation Methodology for Metaheuristic Algorithms - A Perspective from Software Development

Masoud Yaghini (2010)

10.1007/s10479-017-2509-0

A survey of the standard location-routing problem

M. Schneider (2017)

10.1016/j.eswa.2013.11.029

Vehicle routing problem with a heterogeneous fleet and time windows

Jun Jiang (2014)

10.1109/SMC.2016.7844391

Study on the impact of the NS in the performance of meta-heuristics in the TSP

André Soares Santos (2016)

10.1007/978-981-13-1936-5_10

Performance Evaluation of Crow Search Algorithm on Capacitated Vehicle Routing Problem

K. M. Dhanya (2018)

10.1155/2018/8072621

The Influence of Problem Specific Neighborhood Structures in Metaheuristics Performance

Andre Serra e Santos (2018)

10.5120/IJAIS12-450678

A Comparative Study of Simulated Annealing and Genetic Algorithm for Solving the Travelling Salesman Problem

A. P. Adewole (2012)

10.1007/978-3-319-53480-0_71

Evaluation of the Simulated Annealing and the Discrete Artificial Bee Colony in the Weight Tardiness Problem with Taguchi Experiments Parameterization

André Soares Santos (2016)

COMPARISON OF META-HEURISTIC ALGORITHMS FOR SOLVING MACHINING OPTIMIZATION PROBLEMS

Miloš Madi (2013)

10.1007/s00521-019-04575-1

A new algorithm for normal and large-scale optimization problems: Nomadic People Optimizer

Sinan Q. Salih (2019)

Balancing Accuracy and Complexity in Optimisation Models of Distributed Energy Systems and Microgrids: A Review

Ishanki A. De Mel (2020)

10.1155/2014/179085

Multiobjective Fuzzy Mixed Assembly Line Sequencing Optimization Model

Farzad Tahriri (2014)

PORTFOLIO MANAGEMENT USING PROSPECT THEORY : COMPARING GENETIC ALGORITHMS AND PARTICLE SWARM OPTIMIZATION

Metodi Quantitativi (2018)

10.1016/J.TRE.2013.11.003

A bi-level Voronoi diagram-based metaheuristic for a large-scale multi-depot vehicle routing problem

Wei Tu (2014)

10.1016/j.ejor.2014.08.030

A survey of variants and extensions of the location-routing problem

Michael Drexl (2015)

10.3390/SU9101857

Optimizing Green Computing Awareness for Environmental Sustainability and Economic Security as a Stochastic Optimization Problem

E. Okewu (2017)

10.1109/TEVC.2013.2281527

Grammatical Evolution Hyper-Heuristic for Combinatorial Optimization Problems

Nasser R. Sabar (2013)

10.1155/2014/505207

Fuzzy Mixed Assembly Line Sequencing and Scheduling Optimization Model Using Multiobjective Dynamic Fuzzy GA

Farzad Tahriri (2014)

Heuristic and Meta-Heuristic Algorithms and Their Relevance to the Real World: A Survey

Sachin A. Desale (2015)

Distance-constrained vehicle routing problem: exact and approximate solution (mathematical programming)

S. Almoustafa (2013)

10.1007/s11590-010-0203-0

A genetic local search algorithm with a threshold accepting mechanism for solving the runway dependent aircraft landing problem

Yu-Hsin Liu (2011)

10.1007/s00521-019-04132-w

A conceptual comparison of several metaheuristic algorithms on continuous optimisation problems

A. Ezugwu (2019)

See more