Constructing test cases for partitioning heuristics
IEEE Transactions on Computers
The visual display of quantitative information
The visual display of quantitative information
Envisioning information
On the complexity of test case generation for NP-hard problems
Information Processing Letters
Guidelines for reporting results of computational experiments. Report of the ad hoc committee
Mathematical Programming: Series A and B
Visualization of natural phenomena
Visualization of natural phenomena
A test problem generator for the Steiner problem in graphs
ACM Transactions on Mathematical Software (TOMS)
Generating hard and diverse test sets for NP-hard graph problems
Discrete Applied Mathematics
The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis
Journal of the ACM (JACM)
On Reporting Computational Experiments with Mathematical Software
ACM Transactions on Mathematical Software (TOMS)
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Design and Analysis of Experiments
Design and Analysis of Experiments
A scatter search-based heuristic to locate capacitated transshipment points
Computers and Operations Research
Interactive product catalogue with user preference tracking
International Journal of Web and Grid Services
Minimizing makespan in two-stage hybrid cross docking scheduling problem
Computers and Operations Research
A Study on the Short-Term Prohibition Mechanisms in Tabu Search
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
An improved small-sample statistical test for comparing the success rates of evolutionary algorithms
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Mixed models for the analysis of local search components
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
The influence of data implementation in the performance of evolutionary algorithms
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Probabilistic performance profiles for the experimental evaluation of stochastic algorithms
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem
Knowledge-Based Systems
A multi-agent system to assist with property valuation using heterogeneous ensembles of fuzzy models
KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part I
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem
INFORMS Journal on Computing
Problem reduction heuristic for the 0-1 multidimensional knapsack problem
Computers and Operations Research
Local search heuristics for the multidimensional assignment problem
Journal of Heuristics
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Expert Systems with Applications: An International Journal
Fleet maintenance scheduling with an ant colony system approach
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Scalable grid resource allocation for scientific workflows using hybrid metaheuristics
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
An ACO algorithm for the most probable explanation problem
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
LTL logistics networks with differentiated services
Computers and Operations Research
A benchmarking framework for simulation-based optimization of environmental models
Environmental Modelling & Software
Computers and Industrial Engineering
International Journal of Applied Metaheuristic Computing
Concave minimum cost network flow problems solved with a colony of ants
Journal of Heuristics
Entropy-based adaptive range parameter control for evolutionary algorithms
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Automating the evaluation of planning systems
AI Communications
| Hi-index | 0.00 |
Heuristic optimization algorithms seek good feasible solutions to optimization problems in circumstances where the complexities of the problem or the limited time available for solution do not allow exact solution. Although worst case and probabilistic analysis of algorithms have produced insight on some classic models, most of the heuristics developed for large optimization problem must be evaluated empirically—by applying procedures to a collection of specific instances and comparing the observed solution quality and computational burden.This paper focuses on the methodological issues that must be confronted by researchers undertaking such experimental evaluations of heuristics, including experimental design, sources of test instances, measures of algorithmic performance, analysis of results, and presentation in papers and talks. The questions are difficult, and there are no clear right answers. We seek only to highlight the main issues, present alternative ways of addressing them under different circumstances, and caution about pitfalls to avoid.