{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T02:25:23Z","timestamp":1773023123406,"version":"3.50.1"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf02430363","type":"journal-article","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T16:16:47Z","timestamp":1149697007000},"page":"9-32","source":"Crossref","is-referenced-by-count":318,"title":["Designing and reporting on computational experiments with heuristic methods"],"prefix":"10.1007","volume":"1","author":[{"given":"Richard S.","family":"Barr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce L.","family":"Golden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James P.","family":"Kelly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"William R.","family":"Stewart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"BF02430363_CR1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","volume":"6","author":"E. Aarts","year":"1994","unstructured":"Aarts, E., van Laarhoven, P., Lenstra, J., and Ulder, N. (1994). A computational study of local search algorithms for job shop scheduling.ORSA Journal on Computing, 6(2), 118\u2013125.","journal-title":"ORSA Journal on Computing"},{"key":"BF02430363_CR2","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., and Orlin, J. (1993).Network Flows: Theory, Algorithms, and Applications, Englewood Cliffs, NJ: Prentice Hall."},{"issue":"4","key":"BF02430363_CR3","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/ijoc.5.4.395","volume":"5","author":"M. Amini","year":"1990","unstructured":"Amini, M., and Barr, R. (1990). Network reoptimization algorithms: A statistically designed comparison.ORSA Journal on Computing, 5(4), 395\u2013409.","journal-title":"ORSA Journal on Computing"},{"issue":"2","key":"BF02430363_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1057\/palgrave.jors.0390205","volume":"39","author":"J. Arthur","year":"1988","unstructured":"Arthur, J., and Frendewey, J. (1988). Generating traveling salemen problems with known optimal tours.Journal of the Operational Research Society, 39(2), 153\u2013159.","journal-title":"Journal of the Operational Research Society"},{"issue":"8","key":"BF02430363_CR5","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1002\/net.3230240805","volume":"24","author":"J. Arthur","year":"1994","unstructured":"Arthur, J., and Frendewey, J. (1994). An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions.Networks, 24(8), 445\u2013454.","journal-title":"Networks"},{"issue":"1","key":"BF02430363_CR6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.5.1.2","volume":"5","author":"R. Barr","year":"1993","unstructured":"Barr, R., and Hickman, B. (1993). Reporting computational experiments with parallel algorithms: Issues, measures, and experts' opinions.ORSA Journal on Computing, 5(1), 2\u201318.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"BF02430363_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1287\/opre.42.1.65","volume":"42","author":"R. Barr","year":"1994","unstructured":"Barr, R., and Hickman, B. (1994). Parallelization strategies for the network simplex algorithm.Operations Research, 42(1), 65\u201380.","journal-title":"Operations Research"},{"key":"BF02430363_CR8","series-title":"Tech. rep.","volume-title":"Nelder-mead simplex modifications for simulation optimization","author":"R. Barton","year":"1996","unstructured":"Barton, R., and Ivey, Jr., J. (1996). Nelder-mead simplex modifications for simulation optimization. Tech. rep., Department of Industrial and Systems Engineering, Pennsylvania State University, University Park, PA. To appear inManagement Science."},{"issue":"6","key":"BF02430363_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0898-1221(94)00147-2","volume":"28","author":"R. Battiti","year":"1994","unstructured":"Battiti, R., and Tecchiolli, G. (1994). Simulated annealing and tabu search in the long run: A comparison on gap tasks.Computers and Mathematics with Applications, 28(6), 1\u20138.","journal-title":"Computers and Mathematics with Applications"},{"key":"BF02430363_CR10","first-page":"119","volume-title":"Network Flows and Matching: First DIMACS Implementation Challenge, Vol. 12 ofDIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"R. Bland","year":"1993","unstructured":"Bland, R., Cheriyan, J., Jensen, D., and Lad\u00e1nyi, L. (1993). An empirical study of min cost flow algorithms. In D. Johnson, and C. McGeoch (Eds.),Network Flows and Matching: First DIMACS Implementation Challenge, Vol. 12 ofDIMACS Series in Discrete Mathematics and Theoretical Computer Science (pp. 119\u2013156): Providence, RI: American Mathematical Society."},{"key":"BF02430363_CR11","volume-title":"Evolutionary Operation, A Statistical Method for Process Improvement","author":"G. Box","year":"1969","unstructured":"Box, G., and Draper, N. (1969).Evolutionary Operation, A Statistical Method for Process Improvement. New York: John Wiley."},{"key":"BF02430363_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0167-7","volume-title":"A Guide to Simulation","author":"P. Bratley","year":"1983","unstructured":"Bratley, P., Fox, B., and Schrage, L. (1983).A Guide to Simulation. New York: Springer-Verlag"},{"key":"BF02430363_CR13","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0377-2217(91)90261-S","volume":"50","author":"G. Cornuejols","year":"1991","unstructured":"Cornuejols, G., Sridharan, R., and Thizy, J. (1991). A comparison of heuristics and relaxations for the capacititated plant location problem.European Journal of Operational Research, 50, 280\u2013297.","journal-title":"European Journal of Operational Research"},{"key":"BF02430363_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/355826.355833","volume":"5","author":"H. Crowder","year":"1980","unstructured":"Crowder, H., Dembo, R., and Mulvey, J. (1980). On reporting computational experiments with mathematical software.ACM Transactions on Mathematical Software, 5, 193\u2013203.","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"6","key":"BF02430363_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","volume":"3","author":"M. Dyer","year":"1985","unstructured":"Dyer, M., and Frieze, A. (1985). A simple heuristic for thep-centre problem.Operations Research Letters, 3(6), 285\u2013288.","journal-title":"Operations Research Letters"},{"key":"BF02430363_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. Feo","year":"1995","unstructured":"Feo, T., and Resende, M. (1995). Greedy randomized adaptive search procedures.Journal of Global Optimization, 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"BF02430363_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.26.1.1","volume":"26","author":"M. Fisher","year":"1980","unstructured":"Fisher, M. (1980). Worst-case analysis of heuristic algorithms.Management Science, 26(1), 1\u201317.","journal-title":"Management Science"},{"key":"BF02430363_CR18","doi-asserted-by":"crossref","unstructured":"Floudas, C., and Pardalos, P. (1990).Collection of Test Problems for Constrained Global Optimization Algorithms, Vol. 455 ofLecture Notes in Computer Science. Springer-Verlag.","DOI":"10.1007\/3-540-53032-0"},{"key":"BF02430363_CR19","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., and Johnson, D. (1979).Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman."},{"issue":"10","key":"BF02430363_CR20","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M. Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., and Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem.Management Science, 40(10), 1276\u20131290.","journal-title":"Management Science"},{"key":"BF02430363_CR21","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1080\/03610917708812053","volume":"136","author":"J. Gilsinn","year":"1977","unstructured":"Gilsinn, J., Hoffman, K., Jackson, R., Leyendecker, E., Saunders, P., and Shier, D. (1977). Methodology and analysis for comparing discrete linearl\n                           1 approximation codes.Communications in Statistics, 136, 399\u2013413.","journal-title":"Communications in Statistics"},{"issue":"3","key":"BF02430363_CR22","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). Tabu search-part I.ORSA Journal on Computing, 1(3), 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"BF02430363_CR23","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1287\/mnsc.20.5.783","volume":"20","author":"F. Glover","year":"1974","unstructured":"Glover, F., Karney, D., Klingman, D., and Napier, A. (1974). A computational study on start procedures, basis change criteria, and solution algorithms for transportation problems.Management Science, 20, 793\u2013813.","journal-title":"Management Science"},{"key":"BF02430363_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(86)80002-9","volume":"27","author":"B. Golden","year":"1986","unstructured":"Golden, B., Assad, A., Wasil, E., and Baker, E. (1986). Experimentation in optimization.European Journal of Operational Research, 27, 1\u201316.","journal-title":"European Journal of Operational Research"},{"key":"BF02430363_CR25","first-page":"207","volume-title":"The Travelling Salesman Problem, a Guided Tour of Combinatorial Optimization","author":"B. Golden","year":"1985","unstructured":"Golden, B., and Stewart, W. (1985). Empirical analysis of heuristics. In E. Lawler, J. Lenstra A. Rinnooy Kan, and D. Shmoys (Eds.),The Travelling Salesman Problem, a Guided Tour of Combinatorial Optimization (pp. 207\u2013249). Chichester (U.K.): Wiley."},{"key":"BF02430363_CR26","first-page":"7","volume":"2","author":"H. Greenberg","year":"1990","unstructured":"Greenberg, H. (1990). Computational testing: Why, how and how much?ORSA Journal on Computing, 2, 7\u201311.","journal-title":"ORSA Journal on Computing"},{"key":"BF02430363_CR27","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"Held, M., and Karp, R. (1970). The travelling-salesman problem and minimum spanning trees.Operations Research, 18, 1138\u20131162.","journal-title":"Operations Research"},{"key":"BF02430363_CR28","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"Held, M., and Karp, R. (1971). The travelling-salesman problem and minimum spanning trees: Part ii.Mathematical Programming, 1, 6\u201325.","journal-title":"Mathematical Programming"},{"issue":"2","key":"BF02430363_CR29","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum, D., and Shmoys, D. (1985). A best possible heuristic for thek-center problem.Mathematics of Operations Research, 10(2), 180\u2013184.","journal-title":"Mathematics of Operations Research"},{"key":"BF02430363_CR30","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. Holland","year":"1975","unstructured":"Holland, J. (1975),Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press."},{"issue":"2","key":"BF02430363_CR31","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1287\/opre.42.2.201","volume":"42","author":"J. Hooker","year":"1994","unstructured":"Hooker, J. (1994). Needed: An empirical science of algorithms.Operations Research, 42(2), 201\u2013212.","journal-title":"Operations Research"},{"issue":"1","key":"BF02430363_CR32","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"J. Hooker","year":"1995","unstructured":"Hooker, J. (1995). Testing heuristics: We have it all wrong.Journal of Heuristics, 1(1), 33\u201342.","journal-title":"Journal of Heuristics"},{"key":"BF02430363_CR33","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"J. Hopfield","year":"1985","unstructured":"Hopfield, J., and Tank, D. (1985). Neural computation of decisions in optimization problems.Biological Cybernetics, 52, 141.","journal-title":"Biological Cybernetics"},{"key":"BF02430363_CR34","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01588801","volume":"49","author":"R. Jackson","year":"1990","unstructured":"Jackson, R., Boggs, P., Nash, S., and Powell, S. (1990). Report of the ad hoc committee to revise the guidelines for reporting computational experiments in mathematical programming.Mathematical Programing, 49, 413\u2013425.","journal-title":"Mathematical Programing"},{"key":"BF02430363_CR35","doi-asserted-by":"crossref","first-page":"563","DOI":"10.6028\/jres.083.038","volume":"83","author":"R. Jackson","year":"1978","unstructured":"Jackson, R., and Mulvey, J. (1978). A critical review of comparisons of mathematical programming algorithms and software (1953\u20131977).J. Research of the National Bureau of Standards, 83, 563\u2013584.","journal-title":"J. Research of the National Bureau of Standards"},{"key":"BF02430363_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/BFb0032050","volume-title":"Proceedings of the 17th Colloquium on Automata, Languages and programming","author":"D. Johnson","year":"1990","unstructured":"Johnson, D. (1990). Local optimization and the traveling salesman problem. InProceedings of the 17th Colloquium on Automata, Languages and programming, Lecture Notes in Computer Science 443 (pp. 446\u2013461). Berlin: Springer-Verlag."},{"key":"BF02430363_CR37","unstructured":"Johnson, D., Bentley, J., McGeoch, L., and Rothberg, E. (1995). Near-optimal solutions to very lage traveling salesman problems. Tech. rep., monograph, in preparation."},{"key":"BF02430363_CR38","first-page":"145","volume-title":"The Travelling Salesman Problem, A Guided Tour of Combinatorial Optimization","author":"D. Johnson","year":"1985","unstructured":"Johnson, D., and Papadimitrious, C. (1985). Performance guarantees for heuristics. In E. Lawler, J. Lenstra, A. Rinnooy Kan, and D. Shmoys (Eds.),The Travelling Salesman Problem, A Guided Tour of Combinatorial Optimization (pp. 145\u2013180). Chichester (U.K.): Wiley."},{"issue":"4","key":"BF02430363_CR39","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1002\/net.3230220407","volume":"22","author":"J. Kelly","year":"1992","unstructured":"Kelly, J., Golden, B., and Assad, A. (1992). Cell suppression: Disclosure protection for sensitive tabular data.Networks, 22(4), 397\u2013417.","journal-title":"Networks"},{"key":"BF02430363_CR40","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF02022563","volume":"41","author":"J. Kelly","year":"1993","unstructured":"Kelly, J., Golden, B., and Assad, A. (1993). Large-scale controlled rounding using tabu search and strategic oscillation.Annals of Operations Research, 41, 69\u201384.","journal-title":"Annals of Operations Research"},{"key":"BF02430363_CR41","unstructured":"Klingman, D., and Mote, J. (1987). Computational analysis of large-scale pure networks. Presented at the Joint National Meeting of ORSA\/TIMS, New Orleans."},{"key":"BF02430363_CR42","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D. Klingman","year":"1974","unstructured":"Klingman, D., Napier, A., and Stutz, J. (1974). Netgen: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems.Management Science, 20, 814\u2013821.","journal-title":"Management Science"},{"issue":"8","key":"BF02430363_CR43","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1016\/0305-0548(94)90016-7","volume":"21","author":"J. Knox","year":"1994","unstructured":"Knox, J. (1994). Tabu search performance on the symmetric travelling salesman problem.Computers & Operations Research, 21(8), 867\u2013876.","journal-title":"Computers & Operations Research"},{"key":"BF02430363_CR44","volume-title":"The Travelling Salesman Problem, A Guided Tour of Combinatorial Optimization","author":"E. Lawler","year":"1985","unstructured":"Lawler, E., Lenstra, J., Kan, A. Rinnooy, and Shmoys, D. (1985).The Travelling Salesman Problem, A Guided Tour of Combinatorial Optimization. Chiehester (U.K.): Wiley."},{"key":"BF02430363_CR45","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/322017.322026","volume":"24","author":"B. Lin","year":"1977","unstructured":"Lin, B., and Rardin, R. (1977). Development of a parametric generating procedure for integer programming test problems.Journal of the ACM, 24, 465\u2013472.","journal-title":"Journal of the ACM"},{"issue":"12","key":"BF02430363_CR46","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1287\/mnsc.25.12.1258","volume":"25","author":"B. Lin","year":"1979","unstructured":"Lin, B., and Rardin, R. (1979). Controlled experimental design for statistical comparison of integer programming algorithms.Management Science, 25(12), 33\u201343.","journal-title":"Management Science"},{"issue":"2","key":"BF02430363_CR47","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., and Kernighan, B. (1973). An effective heuristic algorithm for the traveling-salesman problem.Operations Research, 21(2), 498\u2013516.","journal-title":"Operations Research"},{"key":"BF02430363_CR48","volume-title":"Knapsack Problems","author":"S. Martello","year":"1990","unstructured":"Martello, S., and Toth, P. (1990).Knapsack Problems. Chichester (U.K.): Wiley."},{"key":"BF02430363_CR49","volume-title":"Statistical Design and Analysis of Experiments","author":"R. Mason","year":"1989","unstructured":"Mason, R., Gunst, R., and Hess, J. (1989).Statistical Design and Analysis of Experiments. New York: Wiley."},{"key":"BF02430363_CR50","volume-title":"Experimental Analysis of Algorithms. Ph.D. thesis","author":"C. McGeoch","year":"1986","unstructured":"McGeoch, C. (1986).Experimental Analysis of Algorithms. Ph.D. thesis, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA."},{"key":"BF02430363_CR51","unstructured":"McGeoch, C. (1995). Toward an experimental method for algorithm simulation.INFORMS Journal on Computing, to appear."},{"issue":"5","key":"BF02430363_CR52","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/130844.130853","volume":"24","author":"C. McGeoch","year":"1992","unstructured":"McGeoch, C. (1992). Analyzing algorithms by simulation: Variance reduction techniques and simulation speedups.ACM Computing Surveys, 24(5), 195\u2013212.","journal-title":"ACM Computing Surveys"},{"key":"BF02430363_CR53","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E. (1953). Equation of state calculation by fast computing machines.Journal of Chemical Physics, 21, 1087\u20131091.","journal-title":"Journal of Chemical Physics"},{"key":"BF02430363_CR54","volume-title":"Design and Analysis of Experiments","author":"D. Montgomery","year":"1984","unstructured":"Montgomery, D. (1984).Design and Analysis of Experiments. New York: Wiley."},{"key":"BF02430363_CR55","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-95406-1","volume-title":"Evaluating Mathematical Programming Techniques","author":"J. Mulvey","year":"1982","unstructured":"Mulvey, J. (1982).Evaluating Mathematical Programming Techniques. Berlin: Springer-Verlag."},{"issue":"5","key":"BF02430363_CR56","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1145\/22899.22907","volume":"30","author":"R. Nance","year":"1987","unstructured":"Nance, R., Moose, Jr., R., and Foutz, R. (1987). A statistical technique for comparing heuristics: An example from capacity assignment strategies in computer network design.Communications of the ACM, 30(5), 430\u2013442.","journal-title":"Communications of the ACM"},{"key":"BF02430363_CR57","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"J. Nelder","year":"1965","unstructured":"Nelder, J., and Mead, R. (1965). A simplex method for function minimization.Computer Journal, 7, 308\u2013313.","journal-title":"Computer Journal"},{"issue":"4","key":"BF02430363_CR58","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/ijoc.2.4.353","volume":"2","author":"K. Nygard","year":"1990","unstructured":"Nygard, K., Juell, P., and Kadaba, N. (1990). Neural networks for selecting vehicle routing heuristics.ORSA Journal on Computing, 2(4), 353\u2013364.","journal-title":"ORSA Journal on Computing"},{"key":"BF02430363_CR59","first-page":"44","volume-title":"Evaluating Mathematical Programming Techniques","author":"R. O'Neill","year":"1982","unstructured":"O'Neill, R. (1982). A comparison of real-world linear programs and their randomly generated analogs. In J. Mulvey (Ed.),Evaluating Mathematical Programming Techniques (pp. 44\u201359). Berlin: Springer-Verlag."},{"key":"BF02430363_CR60","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/978-3-642-95406-1_2","volume-title":"Evaluating Mathematical Programming Techniques","author":"R. Rardin","year":"1982","unstructured":"Rardin, R., and Lin, B. (1982). Test problems for computational experiments\u2014issues and techniques. In J. Mulvey (Ed.),Evaluating Mathematical Programming Techniques (pp. 8\u201315). Berlin: Springer-Verlag."},{"key":"BF02430363_CR61","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"C. Reeves","year":"1993","unstructured":"Reeves, C. (1993a). Evaluation of heuristic performance. In C. Reeves, (Ed.),Modern Heuristic Techniques for Combinatorial Problems. New York: Wiley."},{"key":"BF02430363_CR62","volume-title":"Evaluation of Heuristic Performance","author":"C. Reeves","year":"1993","unstructured":"Reeves, C. (1993b).Evaluation of Heuristic Performance. New York: Wiley."},{"issue":"4","key":"BF02430363_CR63","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G. (1991). TSPLIB\u2014a travelling salesman problem library.ORSA Journal on Computing, 3(4), 376\u2013384.","journal-title":"ORSA Journal on Computing"},{"key":"BF02430363_CR64","series-title":"Tech. rep.","volume-title":"A GRASP for graph planarization","author":"M. Resende","year":"1995","unstructured":"Resende, M., and Ribeiro, C. (1995). A GRASP for graph planarization. Tech. rep., AT&T Bell Laboratories, Murray Hill, NJ."},{"key":"BF02430363_CR65","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.18.6.992","volume":"18","author":"B. Rothfarb","year":"1970","unstructured":"Rothfarb, B., Frank, H., Rosebaum, D., Steiglitz, K., and Kleitman, D. (1970). Optimal design of offshore natural gas pipeline systems.Operations Research, 18, 992\u20131020.","journal-title":"Operations Research"},{"key":"BF02430363_CR66","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1002\/net.3230170405","volume":"17","author":"W. Stewart","year":"1987","unstructured":"Stewart, W. (1987). An accelerated branch exchange heuristic for the traveling salesman problem.Networks, 17, 423\u2013437.","journal-title":"Networks"},{"key":"BF02430363_CR67","series-title":"Tech. rep.","volume-title":"Solving vehicle routing problems using generalized assignments and tabu search","author":"W. Stewart","year":"1995","unstructured":"Stewart, W., Kelly, J., and Laguna, M. (1995). Solving vehicle routing problems using generalized assignments and tabu search. Tech. rep., Graduate School of Business, College of William and Mary, Williamsburg, VA."},{"key":"BF02430363_CR68","volume-title":"Introduction to Off-Live Quality Control","author":"G. Taguchi","year":"1979","unstructured":"Taguchi, G., and Wu, Y.-I. (1979).Introduction to Off-Live Quality Control. Central Japan Quality Control Association, Meieki Nakamura-ku Magaya, Japan."},{"key":"BF02430363_CR69","volume-title":"The Visual Display of Quantitative Information","author":"E. Tufte","year":"1983","unstructured":"Tufte, E. (1983).The Visual Display of Quantitative Information. Cheshire, CT: Graphics Press."},{"key":"BF02430363_CR70","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0377-2217(89)90412-8","volume":"43","author":"S. Zanakis","year":"1989","unstructured":"Zanakis, S., Evans, J., and Vazacopoulos, A. (1989). Heuristic methods and applications: A categorized survey.European Journal of Operational Research, 43, 88\u2013110.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02430363.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF02430363\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02430363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02430363.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T21:25:19Z","timestamp":1652563519000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF02430363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":70,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF02430363"],"URL":"https:\/\/doi.org\/10.1007\/bf02430363","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}