{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T16:17:47Z","timestamp":1774282667217,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,4]]},"DOI":"10.1007\/s10479-005-2060-2","type":"journal-article","created":{"date-parts":[[2005,5,18]],"date-time":"2005-05-18T10:13:03Z","timestamp":1116411183000},"page":"285-302","source":"Crossref","is-referenced-by-count":74,"title":["Looking Ahead with the Pilot Method"],"prefix":"10.1007","volume":"136","author":[{"given":"Stefan","family":"Vo\u00dfs","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Fink","sequence":"additional","affiliation":[]},{"given":"Cees","family":"Duin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2060_CR1","unstructured":"Amberg, A., L. Gouveia, P. Martins, and S. Vo\u00df. (1999). \u201cIterative Heuristic Metastrategies.\u201d In MIC'99, Third Metaheuristics International Conference, Angra dos Reis, Rio de Janeiro, Brazil, July 19\u201323, 1999, pp. 13\u201316."},{"key":"2060_CR2","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E. Balas","year":"1998","unstructured":"Balas, E. and A. Vazacopoulos. (1998). \u201cGuided Local Search with Shifting Bottleneck for Job Shop Scheduling.\u201d Management Science 44, 262\u2013275.","journal-title":"Management Science"},{"key":"2060_CR3","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/S0377-2217(97)00021-0","volume":"108","author":"G. Belvaux","year":"1998","unstructured":"Belvaux, G., N. Boissin, A. Sutter, and L.A. Wolsey. (1998). \u201cOptimal Placement of Add\/Drop Multiplexers: Static and Dynamic Models.\u201d European Journal of Operational Research 108, 26\u201335.","journal-title":"European Journal of Operational Research"},{"key":"2060_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/A:1009634810396","volume":"5","author":"D.P. Bertsekas","year":"1999","unstructured":"Bertsekas, D.P. and D.A. Castanon. (1999). \u201cRollout Algorithms for Stochastic Scheduling Problems.\u201d Journal of Heuristics 5, 89\u2013108.","journal-title":"Journal of Heuristics"},{"key":"2060_CR5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1009635226865","volume":"3","author":"D.P. Bertsekas","year":"1997","unstructured":"Bertsekas, D.P., J.N. Tsitsiklis, and C. Wu. (1997). \u201cRollout Algorithms for Combinatorial Optimization.\u201d Journal of Heuristics 3, 245\u2013262.","journal-title":"Journal of Heuristics"},{"key":"2060_CR6","first-page":"144","volume-title":"Principles and Practice of Constraint Programming \u2013 CP '99, Lecture Notes in Computer Science, 1713","author":"Y. Caseau","year":"1999","unstructured":"Caseau, Y., F. Laburthe, and G. Silverstein. (1999). \u201cA Meta-Heuristic Factory for Vehicle Routing Problems.\u201d In J. Jaffar (ed.), Principles and Practice of Constraint Programming \u2013 CP '99, Lecture Notes in Computer Science, 1713, Berlin: Springer, pp. 144\u2013158."},{"key":"2060_CR7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02110141","volume":"3","author":"S. Cosares","year":"1994","unstructured":"Cosares, S. and I. Saniee. (1994). \u201cAn Optimization Problem Related to Balancing Loads on SONET Rings.\u201d Telecommunication Systems 3, 165\u2013181.","journal-title":"Telecommunication Systems"},{"key":"2060_CR8","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1287\/opre.40.1.7","volume":"40","author":"R.A. Dudek","year":"1992","unstructured":"Dudek, R.A., S.S. Panwalkar, and M.L. Smith. (1992). \u201cThe Lessons of Flowshop Scheduling Research.\u201d Operations Research 40, 7\u201313.","journal-title":"Operations Research"},{"key":"2060_CR9","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/978-3-642-78910-6_160","volume-title":"Operations Research Proceedings 1993","author":"C.W. Duin","year":"1994","unstructured":"Duin, C.W. and S. Vo\u00df. (1994). \u201cSteiner Tree Heuristics\u2014A Survey.\u201d In H. Dyckhoff, U. Derigs, M. Salomon, and H.C. Tijms. (Eds.), Operations Research Proceedings 1993, Berlin: Springer, pp. 485\u2013496."},{"key":"2060_CR10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","volume":"34","author":"C.W. Duin","year":"1999","unstructured":"Duin, C.W. and S. Vo\u00df. (1999). \u201cThe Pilot Method: A Strategy for Heuristic Repetition with Application to the Steiner Problem in Graphs.\u201d Networks 34, 181\u2013191.","journal-title":"Networks"},{"key":"2060_CR11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-1-4615-4567-5_5","volume-title":"Computing Tools for Modeling, Optimization and Simulation","author":"A. Fink","year":"2000","unstructured":"Fink, A., G. Schneidereit, and S. Vo\u00df. (2000). \u201cSolving General Ring Network Design Problems by Meta-Heuristics.\u201d In M. Laguna and J.L. Gonz\u00e1lez Velarde (eds.), Computing Tools for Modeling, Optimization and Simulation, Boston: Kluwer, pp. 91\u2013113."},{"key":"2060_CR12","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0305-0548(98)80001-4","volume":"26","author":"A. Fink","year":"1999","unstructured":"Fink, A. and S. Vo\u00df. (1999). \u201cApplications of Modern Heuristic Search Methods to Pattern Sequencing Problems.\u201d Computers & Operations Research 26, 17\u201334.","journal-title":"Computers & Operations Research"},{"key":"2060_CR13","unstructured":"Fink, A. and S. Vo\u00df. (2001). \u201cEfficient Meta-Heuristics Approaches for Ring Load Balancing.\u201d In Proceedings of the 9th International Conference on Telecommunication Systems, 243\u2013250. Southern Methodist University, Dallas."},{"key":"2060_CR14","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/S0377-2217(02)00834-2","volume":"151","author":"A. Fink","year":"2003","unstructured":"Fink, A. and S. Vo\u00df. (2003). \u201cSolving the Continuous Flow-Shop Scheduling Problem by Metaheuristics.\u201d European Journal of Operational Research 151, 400\u2013414.","journal-title":"European Journal of Operational Research"},{"key":"2060_CR15","volume-title":"Computers and Intractability\u2014A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability\u2014A Guide to the Theory of NP-completeness.\u201d New York: Freeman."},{"key":"2060_CR16","unstructured":"Gavish, B. (1991). \u201cManifold Search Techniques Applied to Quadratic Assignement Problems (QAP).\u201d Working paper, Owen Graduate School of Management, Vanderbilt University, Nashville."},{"key":"2060_CR17","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF02110085","volume":"4","author":"M. Gendreau","year":"1995","unstructured":"Gendreau, M., M. Labb\u00e9, and G. Laporte. (1995). \u201cEfficient Heuristics for the Design of Ring Networks.\u201d Telecommunication Systems 4, 177\u2013188.","journal-title":"Telecommunication Systems"},{"key":"2060_CR18","first-page":"13","volume-title":"Artificial Evolution, Lecture Notes in Computer Science, 1363","author":"F. Glover","year":"1998","unstructured":"Glover, F. (1998). \u201cA Template for Scatter Search and Path Relinking.\u201d In J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers (eds.), Artificial Evolution, Lecture Notes in Computer Science, 1363, Berlin: Springer, pp. 13\u201354."},{"key":"2060_CR19","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","volume":"41","author":"F. Glover","year":"1993","unstructured":"Glover, F., E. Taillard, and D. de Werra. (1993). \u201cA User's Guide to Tabu Search.\u201d Annals of Operations Research 41, 3\u201328.","journal-title":"Annals of Operations Research"},{"key":"2060_CR20","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0377-2217(93)E0238-S","volume":"83","author":"L. Gouveia","year":"1995","unstructured":"Gouveia, L. and S. Vo\u00df. (1995). \u201cA Classification of Formulations for the (Time-Dependent) Traveling Salesman Problem.\u201d European Journal of Operational Research 83, 69\u201382.","journal-title":"European Journal of Operational Research"},{"key":"2060_CR21","unstructured":"Harvey, W. and M. Ginsberg. (1995). \u201cLimited Discrepancy Search.\u201d In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), Morgan Kaufmann, San Mateo, pp. 607\u2013615."},{"key":"2060_CR22","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"Karp, R. (1972). \u201cReducibility Among Combinatorial Problems.\u201d In R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, New York: Plenum Press, pp. 85\u2013103."},{"key":"2060_CR23","volume-title":"The Traveling Salesman Problem","author":"E.L. Lawler","year":"1985","unstructured":"Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys. (1985). The Traveling Salesman Problem. Chichester: Wiley."},{"key":"2060_CR24","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/B:ANOR.0000039520.24932.4b","volume":"131","author":"C. Meloni","year":"2004","unstructured":"Meloni, C., D. Pacciarelli, and M. Pranzo. (2004). \u201cA Rollout Metaheuristic for Job Shop Scheduling Problems.\u201d Annals of Operations Research 131, 215\u2013235.","journal-title":"Annals of Operations Research"},{"key":"2060_CR25","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/opre.45.1.148","volume":"45","author":"Y.-S. Myung","year":"1997","unstructured":"Myung, Y.-S., H.-G. Kim, and D.-W. Tcha. (1997). \u201cOptimal Load Balancing on SONET Bidirectional Rings.\u201d Operations Research 45, 148\u2013152.","journal-title":"Operations Research"},{"key":"2060_CR26","volume-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"J. Pearl","year":"1984","unstructured":"Pearl, J. (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Reading, Addison-Wesley."},{"key":"2060_CR27","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/opre.26.1.86","volume":"26","author":"J.-C. Picard","year":"1978","unstructured":"Picard, J.-C. and M. Queyranne. (1978). \u201cThe Time-Dependent Traveling Salesman Problem and its Application to the Tardiness Problem in One-Machine Scheduling.\u201d Operations Research 26, 86\u2013110.","journal-title":"Operations Research"},{"key":"2060_CR28","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/net.3230160305","volume":"16","author":"V.J. Rayward-Smith","year":"1986","unstructured":"Rayward-Smith, V.J. and A. Clare. (1986). \u201cOn Finding Steiner Vertices.\u201d Networks 16, 283\u2013294.","journal-title":"Networks"},{"key":"2060_CR29","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/B:ANOR.0000039523.95673.33","volume":"131","author":"S.J. Shyu","year":"2004","unstructured":"Shyu, S.J., P.-Y. Yin, and B.M.T. Lin. (2004). \u201cAn Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem.\u201d Annals of Operations Research 131, 283\u2013304.","journal-title":"Annals of Operations Research"},{"key":"2060_CR30","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1023\/A:1011960407575","volume":"7","author":"F. Sourd","year":"2001","unstructured":"Sourd, F. (2001). \u201cScheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures.\u201d Journal of Heuristics 7, 519\u2013531.","journal-title":"Journal of Heuristics"},{"key":"2060_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(98)00193-3","volume":"117","author":"F. Sourd","year":"1999","unstructured":"Sourd, F. and P. Chr\u00e9tienne. (1999). \u201cFiber-to-object Assignment Heuristics.\u201d European Journal of Operational Research 117, 1\u201314.","journal-title":"European Journal of Operational Research"},{"key":"2060_CR32","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E. (1993). \u201cBenchmarks for Basic Scheduling Instances.\u201d European Journal of Operational Research 64, 278\u2013285.","journal-title":"European Journal of Operational Research"},{"key":"2060_CR33","volume-title":"Steiner-Probleme in Graphen","author":"S. Vo\u00df","year":"1990","unstructured":"Vo\u00df, S. (1990). Steiner-Probleme in Graphen. Frankfurt am Main: Hain."},{"key":"2060_CR34","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","year":"1999","unstructured":"Vo\u00df, S., S. Martello, I.H. Osman, and C. Roucairol (eds.) (1999). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston: Kluwer."},{"key":"2060_CR35","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/0-306-48056-5_7","volume-title":"Handbook of Metaheuristics","author":"C. Voudouris","year":"2003","unstructured":"Voudouris, C. and E.P.K. Tsang. (2003). \u201cGuided Local Search.\u201d In F. Glover and G.A. Kochenberger (eds.), Handbook of Metaheuristics. Boston: Kluwer, pp. 185\u2013218."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2060-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-2060-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2060-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:59:33Z","timestamp":1559138373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-2060-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["2060"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-2060-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4]]}}}