Designing and reporting on computational experiments with heuristic methods

DOI10.1007/BF02430363zbMath0853.68154MaRDI QIDQ1922625

Mauricio G. C. Resende, William R. jun. Stewart, Richard S. Barr, Bruce L. Golden, James P. Kelly

Publication date: 1 September 1996

Published in: Journal of Heuristics (Search for Journal in Brave)

zbMATH Keywords

computational testingtest heuristic method

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (50)

Best practices for comparing optimization algorithms ⋮ Global optimization using \(q\)-gradients ⋮ Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date ⋮ Developing effective meta-heuristics for a probabilistic location model via experimental design ⋮ Machine scheduling performance with maintenance and failure ⋮ Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems ⋮ Simulation of stochastic demand data streams for network revenue management problems ⋮ A comparative study on multiobjective metaheuristics for solving constrained in-core fuel management optimisation problems ⋮ Cárnico-ICSPEA2--A metaheuristic co-evolutionary navigator for a complex co-evolutionary farming system ⋮ Approximate dynamic programming for the military inventory routing problem ⋮ Metaheuristics: A bibliography ⋮ New variable-length data compression scheme for solution representation of meta-heuristics ⋮ Tabu search for the BWC problem ⋮ Heuristic optimisation in financial modelling ⋮ A multilevel evaluation method for heuristics with an application to the VRPTW ⋮ An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows ⋮ Research trends in combinatorial optimization ⋮ Adaptive feasible and infeasible tabu search for weighted vertex coloring ⋮ Solving the continuous flow-shop scheduling problem by metaheuristics. ⋮ Benchmarking nonlinear optimization software in technical computing environments ⋮ What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO ⋮ A self-adaptive chaotic differential evolution algorithm using gamma distribution for unconstrained global optimization ⋮ Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem ⋮ How to assess and report the performance of a stochastic algorithm on a benchmark problem: \textit{mean} or \textit{best} result on a number of runs? ⋮ Review on nature-inspired algorithms ⋮ Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives ⋮ On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation ⋮ Internal model control design based on approximation of linear discrete dynamical systems ⋮ Group-scheduling problems in electronics manufacturing ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints ⋮ Experimental analysis of approximation algorithms for the vertex cover and set covering problems ⋮ Core instances for testing: a case study ⋮ On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem ⋮ A comparison of complete global optimization solvers ⋮ Designing data warehouses for equipment management system with genetic algorithms ⋮ Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints ⋮ Lasso solution strategies for the vehicle routing problem with pickups and deliveries ⋮ New Rollout Algorithms for Combinatorial Optimization Problems ⋮ Metaheuristics—the metaphor exposed ⋮ A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems ⋮ Comparative Analysis of Constraint Handling Techniques Based on Taguchi Design of Experiments ⋮ Towards a theory of practice in metaheuristics design: A machine learning perspective ⋮ Decomposition methods for large job shops ⋮ COCO: a platform for comparing continuous optimizers in a black-box setting ⋮ Simulated annealing based artificial bee colony algorithm for global numerical optimization ⋮ Reproducible Econometric Simulations ⋮ A tabu search heuristic and adaptive memory procedure for political districting ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis ⋮ A tabu search algorithm for assigning teachers to courses.

Uses Software

• TSPLIB
• DIMACS
• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple heuristic for the p-centre problem
• A comparison of heuristics and relaxations for the capacitated plant location problem
• ``Neural computation of decisions in optimization problems
• Experimentation in optimization
• Evaluating mathematical programming techniques. Proceedings of a Conference Held at the National Bureau of Standards, Boulder, Colorado, January 5-6, 1981
• A collection of test problems for constrained global optimization algorithms
• Simulated annealing and tabu search in the long run: A comparison on QAP tasks
• Tabu search performance on the symmetric travelling salesman problem
• Greedy randomized adaptive search procedures
• Heuristic methods and applications: A categorized survey
• Testing heuristics: We have it all wrong
• Large-scale controlled rounding using tabu search with strategic oscillation
• A Best Possible Heuristic for the k-Center Problem
• Generating Travelling-Salesman Problems with Known Optimal Tours
• Accelerated branch exchange heuristics for symmetric traveling salesman problems
• Worst-Case Analysis of Heuristic Algorithms
• TSPLIB—A Traveling Salesman Problem Library
• Tabu Search—Part I
• Cell suppression: Disclosure protection for sensitive tabular data
• Neural Networks for Selective Vehicle Routing Heuristics
• A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Development of a Parametric Generating Procedure for Integer Programming Test Problems
• A critical review of comparisons of mathematical programming algorithms and software (1953-1977)
• Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions
• Network Reoptimization Algorithms: A Statistically Designed Comparison
• Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
• Needed: An Empirical Science of Algorithms
• A Computational Study of Local Search Algorithms for Job Shop Scheduling
• An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions
• A GRASP for graph planarization
• Nelder-Mead Simplex Modifications for Simulation Optimization
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Feature Article—Toward an Experimental Method for Algorithm Simulation
• The Traveling-Salesman Problem and Minimum Spanning Trees
• A Simplex Method for Function Minimization
• The traveling-salesman problem and minimum spanning trees: Part II
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Designing and reporting on computational experiments with heuristic methods