Experimental evaluation of heuristic optimization algorithms: A tutorial

Journal of Heuristics

Volumn 7, Issue 3, 2001, Pages 261-304

  Rardin, Ronald L ^a   Uzsoy, Reha ^a  

^a SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

Author keywords

Computational experiments; Heuristic optimization

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC METHODS; NUMERICAL ANALYSIS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING;

COMPUTATIONAL EXPERIMENTS; HEURISTIC OPTIMIZATION;

ALGORITHMS;

EID: 0035335852     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011319115230     Document Type: Article

References (79)

1. Use of representative operation counts in computational testing of algorithms
2. Generating travelling salesman problems with known optimal tour length
3. Heuristic procedures for scheduling job families with setups and due dates
4. Minimizing maximum lateness with job families
5. Designing and reporting on computational experiments with heuristic methods
6. Reporting computational experiments with parallel algorithms: Issues, measures and experts opinions
7. A stochastic method for global optimization
8. The asymptotic probabilistic behaviour of quadratic sum assignment problems
9. Asymptotic methods in the probablistic analysis of sequencing and packing heuristics
10. Experimental results on the crossover point in satisfiability problems
11. On reporting computational experiments with mathematical software
12. Estimating optimal solutions for large combinatorial problems
13. Benchmarks for shop scheduling problems
14. Using confidence limits for the global optimal in combinatorial optimization
15. Planning in a flexible semiconductor manufacturing environment
16. Probabilistic learning combinations of local job-shop scheduling rules
17. Limiting forms of the frequency distribution of the largest or smallest member of a sample
18. The bottleneck traveling salesman problem: Algorithms and probabilistic analysis
19. Using a hybrid of exact and genetic algorithms to design survivable networks
20. A statistical approach to the TSP
21. Point estimation of a global optimum for large combinatorial problems
22. Interval estimation of a global optimum for large combinatorial problems
23. Experimentation in optimization
24. Empirical evaluation of heuristics
25. Comparing systems via simulation
26. Bounds on multiprocessor timing anomalies
27. Computational testing: Why, how and how much
28. On the symmetric traveling salesman problem I: Inequalities
29. Polyhedral aspects of the traveling salesman problem I: Theory
30. Generating experimental data for scheduling problems
31. Single machine scheduling with batch set-up times to minimize maximum lateness
32. Multivariate composite distributions for Co-efficients in synthetic optimization problems
33. The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance
34. Needed: An empirical science of algorithms
35. Testing heuristics: We have it all wrong
36. Guidelines for reporting results of computational experiments: Report of the ad hoc committee
37. Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane
38. A test problem generator for the Steiner problem in graphs
39. A heuristic method of assembly line balancing
40. Machine-component grouping in production flow analysis: An approach using a rank order clustering algorithm
41. Monte Carlo estimation in complex optimization problems
42. Constructing test cases for partitioning heuristics
43. Guidelines for reporting computational results in IIE transactions
44. Sequencing by enumerative methods
45. Controlled experimental design for statistical comparison of integer programming algorithms
46. An effective heuristic method for the travelling salesman problem
47. Combinatorial programming, satistical optimization and the optimal transportation network
48. Towards an experimental method for algorithm simulation
49. Hard and easy distributions of SAT problems
50. On the complexity of scheduling with batch setup times
51. On the performance of heuristics on finite and infinite fractal instances of the euclidean traveling salesman problem
52. Integrating interval estimates of global optima and local search methods for combinatorial optimization problems
53. Invariant problem statistics and generated data validation: Symmetric traveling salesman problems
54. Partial polyhedral description and generation of discrete optimization problems with known optima
55. Test problems for computational experiments-issues and techniques
56. Analysis of a random cut test instance generator for the TSP
57. On the complexity of test case generation for NP-hard problems
58. Test case construction for the vertex cover problem
59. Generating hard and diverse test sets for NP-hard graph problems
60. Reporting the precision of simulation experiments
61. Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine
62. Optimal number of digits to report
63. Computational experience with some nonlinear optimization algorithms for deriving maximum likelihood estimates for three parameter Weibull distribution
64. A simulation study of some simple estimators of the three-parameter Weibull distribution
65. Heuristic methods and applications: A categorized survey
66. A good simple percentile estimator of the Weibull shape parameter for use when all three parameters are unknown
67. Measuring the quality of approximate solutions to zero-one programming problems