Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search

References

• Adenso-Díaz B. Restricted neighborhood in the tabu search for the flowshop problem. Eur. J. Oper. Res. (1992) 62:27–37Crossref, Google Scholar
• Adenso-Díaz B. An SA/TS mixture algorithm for the scheduling tardiness problem. Eur. J. Oper. Res. (1996) 88:516–524Crossref, Google Scholar
• Adenso-Díaz B., Laguna M. A pseudo-greedy heuristic for the rectilinear Steiner problem. Internat. J. Oper. Quant. Management (2001) 7:105–118Google Scholar
• Amini M. M., Barr R. S. Network reoptimization algorithms: A statistically designed comparison. ORSA J. Comput. (1993) 5(4):395–409Link, Google Scholar
• Amini M. M., Racer M. A rigorous computational comparison of alternative solution methods for the generalized assignment problem. Management Sci. (1994) 40(7):868–890Link, Google Scholar
• Anderson A., Fraughnaugh K., Parker M., Ryan J. Path assignment for call routing: An application of tabu search. Ann. Oper. Res. (1993) 41:301–312Crossref, Google Scholar
• Barr R. S., Golden B. L., Kelly J. P., Resende M. G. C., Stewart W. R. Designing and reporting computational experiments with heuristic methods. J. Heuristics (1995) 1(1):9–32Crossref, Google Scholar
• Beasley J. E. A heuristic for Euclidean and rectilinear Steiner problems. Eur. J. Oper. Res. (1992) 58:284–292Crossref, Google Scholar
• Boctor F. F. A linear formulation of the machine-part cell formation problem. Internat. J. Production Res. (1991) 29(2):342–356Crossref, Google Scholar
• Coy S. P., Golden B. L., Runger G. C., Wasil E. A. Using experimental design to find effective parameter settings for heuristics. J. Heuristics (2001) 7(1):77–97Crossref, Google Scholar
• Crowder H. P., Dembo R. S., Mulvey J. M. Reporting computational experiments in mathematical programming. Math. Programming (1978) 15:316–329Crossref, Google Scholar
• DeJong K. A., Spears W. M. An analysis of the interacting roles of population size and crossover in genetic algorithms. Proceedings of the First Workshop on Parallel Problem Solving from Nature (1990) (Springer Verlag, New York) 38–47Google Scholar
• de Souza C. C., Ribeiro C. C. Heuristics for the minimum rectilinear Steiner tree problem: New algorithm and a computational study. Discrete Appl. Math. (1993) 45:205–220Crossref, Google Scholar
• Fink A., Voss S., Voss S., Woodruff D. HOTFRAME: A heuristic optimization framework. Optimization Software Class Libraries (2002) (Kluwer Academic Publishers, Boston, MA) 81–154Google Scholar
• Greenberg H. J. Computational testing: Why, how and how much. ORSA J. Comput. (1990) 2(1):94–97Link, Google Scholar
• Grefenstette J. J. Optimization of control parameters for genetic algorithms. IEEE Trans. Systems Man Cybernetics (1986) 16(1):122–128Crossref, Google Scholar
• Hedayat A. S., Sloane N. J. A., Stufken John. Orthogonal Arrays: Theory and Applications (1999) (Springer-Verlag, New York) Crossref, Google Scholar
• Hoaglin D. C., Andrews D. F. The reporting of computation-based results in statistics. Amer. Statistician (1975) 29(3):122–126Google Scholar
• Laguna M., Glover F. Bandwidth packing: A tabu search approach. Management Sci. (1993) 39(4):492–500Link, Google Scholar
• Laguna M., Barnes J. W., Glover F. Tabu search methods for a single machine scheduling problem. J. Intelligent Manufacturing (1991) 2:63–74Crossref, Google Scholar
• Lozano S., Adenso-Díaz B., Eguía I., Onieva L. A one-step tabu search algorithm for manufacturing cell design. J. Oper. Res. Soc. (1999) 50(5):509–516Crossref, Google Scholar
• Michalewicz Z.Genetic Algorithms + Data Structures = Evolution Programs (1994) 2nd extended ed.(Springer-Verlag, New York) Crossref, Google Scholar
• Montgomery D. C.Design and Analysis of Experiments (1997) 4th ed.(Wiley, New York) Google Scholar
• Neter J., Kutner M. H., Nachtsheim C. J., Wasserman W.Applied Linear Statistical Models (1996) (Irwin, Homewood, IL) Google Scholar
• Peace G. S.Taguchi Methods: A Hands-On Approach (1993) (Addison-Wesley, Reading, MA) Google Scholar
• Roy R. K.A Primer on the Taguchi Method (1990) (Van Nostrand Reinhold, New York) Google Scholar
• Singh N. Design of cellular manufacturing systems: An invited review. Eur. J. Oper. Res. (1993) 69:284–291Crossref, Google Scholar
• Sondergeld L.Performance Analysis Methods for Heuristic Search Optimization with an Application to Cooperative Agent Algorithms (2001) (Shaker, Aachen, Germany) Google Scholar
• Song A. A., Pattipati A. Design of process parameters using robust design techniques and multiple criteria optimization. IEEE Trans. Systems, Man, Cybernetics (1995) 25(11):1437–1446Crossref, Google Scholar
• Taguchi G.System of Experimental Design: Engineering Methods to Optimize Quality and Minimize Costs (1987) 1 and 2(UNIPUB/Kraus International Publications, White Plains, NY) Google Scholar
• Taguchi G., Yokoyama Y.Taguchi Methods: Design of Experiments (1994) (American Supplier Institute, Dearborn, MI) . in conjunction with the Japanese Standards Association, Tokyo, JapanGoogle Scholar
• van Breedam A. Improvement heuristics for the vehicle routing problem based on simulated annealing. Eur. J. Oper. Res. (1995) 86:480–490Crossref, Google Scholar
• van Laarhoven P. J. M., Aarts E. H.Simulated Annealing: Theory and Applications (1987) (Kluwer Academic Publishers, London, UK) Crossref, Google Scholar
• Wemmerlöv U., Hyer N. L. Cellular manufacturing in the U.S. industry: A survey of users. Internat. J. Production Res. (1989) 27:1511–1530Crossref, Google Scholar
• Xu J., Chiu S., Glover F. Fine-tuning a tabu search algorithm with statistical tests. Internat. Trans. Oper. Res. (1998) 5(3):233–244Crossref, Google Scholar