{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:18:15Z","timestamp":1759666695654},"reference-count":75,"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\/bf02430365","type":"journal-article","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T16:16:47Z","timestamp":1149697007000},"page":"43-65","source":"Crossref","is-referenced-by-count":102,"title":["Parallel local search"],"prefix":"10.1007","volume":"1","author":[{"given":"M. G. A.","family":"Verhoeven","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. H. L.","family":"Aarts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02430365_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0167-9260(86)90002-7","volume":"4","author":"E.H.L. Aarts","year":"1986","unstructured":"Aarts, E.H.L., De Bont, F.M.I., Habers, J.H.A., and Van Laarhoven, P.J.M. (1986). Parallel implementations of the statistical cooling algorithms,Integration, 4, 209\u2013238.","journal-title":"Integration"},{"key":"BF02430365_CR2","volume-title":"Simulated Annealing and Bolztmann Machines","author":"E.H.L. Aarts","year":"1989","unstructured":"Aarts, E.H.L., and Korst, J. (1989).Simulated Annealing and Bolztmann Machines. New York: Wiley."},{"key":"BF02430365_CR3","volume-title":"Local Search in Combinatorial Optimization","year":"1995","unstructured":"Aarts, E.H.L., and Lenstra, J.K. (Eds.). (1995).Local Search in Combinatorial Optimization. New York: Wiley."},{"key":"BF02430365_CR4","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/mnsc.37.1.98","volume":"37","author":"D. Abramson","year":"1991","unstructured":"Abramson, D. (1991). Constructing school timetables using simulated annealing: Sequential and parallel algorithms.Management Science, 37, 98\u2013113.","journal-title":"Management Science"},{"key":"BF02430365_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0167-8191(89)90106-3","volume":"10","author":"J.R.A. Allwright","year":"1989","unstructured":"Allwright, J.R.A., and Carpenter, D.B. (1989). A distributed implementation of simulated annealing for the traveling salesman problem.Parallel Computing, 10, 335\u2013338.","journal-title":"Parallel Computing"},{"key":"BF02430365_CR6","volume-title":"Simulated Annealing: Parallelization Techniques","year":"1992","unstructured":"Azencott, R. (Ed.). (1992).Simulated Annealing: Parallelization Techniques. New York: Wiley."},{"key":"BF02430365_CR7","volume-title":"Parallelization of Heuristics for Large Traveling Salesman Problems (in German). Report no. 92. 119","author":"A. Bachem","year":"1992","unstructured":"Bachem, A., and Wottawa. (1992).Parallelization of Heuristics for Large Traveling Salesman Problems (in German). Report no. 92. 119, Universit\u00e4t zu K\u00f6ln, Germany."},{"key":"BF02430365_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0165-6074(90)90222-U","volume":"30","author":"V.C. Barbosa","year":"1990","unstructured":"Barbosa, V.C., and Boeres, M.C.S. (1990). An Occam-based evaluation of a parallel version of simulated annealing.Microprocessing and Microprogramming, 30, 85\u201392.","journal-title":"Microprocessing and Microprogramming"},{"key":"BF02430365_CR9","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/0743-7315(89)90067-1","volume":"6","author":"V.C. Barbosa","year":"1989","unstructured":"Barbosa, V.C., and Gafni, E. (1989). A distributed implementation of simulated annealing.Journal of Parallel and Distributed Computing, 6, 411\u2013434.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"BF02430365_CR10","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/0141-9331(92)90003-C","volume":"16","author":"R. Battiti","year":"1992","unstructured":"Battiti, R., and Tecchiolli, G. (1992). Parallel biased search for combinatorial optimization: Genetic algorithms and tabu.Microprocessors and Microsystems, 16, 351\u2013367.","journal-title":"Microprocessors and Microsystems"},{"key":"BF02430365_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R.P. Brent","year":"1974","unstructured":"Brent, R.P. (1974). The parallel evaluation of general arithmetic expressions.Journal ACM, 21, 201\u2013206.","journal-title":"Journal ACM"},{"key":"BF02430365_CR12","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1109\/TCAD.1987.1270327","volume":"6","author":"A. Casotto","year":"1987","unstructured":"Casotto, A., Romeo, F., and Sangiovanni-Vincentelli, A. (1987). A parallel simulated annealing algorithm for the placement of macro-cells.IEEE Transactions on Computer-Aided Design, 6, 838\u2013847.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"BF02430365_CR13","first-page":"29","volume":"1","author":"J. Chakrapani","year":"1993","unstructured":"Chakrapani, J., and Skorin-Kapov, J. (1993a). Connection machine implementation of a tabu search algorithm for the traveling salesman problem.Journal of Computing and Information Technology, 1, 29\u201336.","journal-title":"Journal of Computing and Information Technology"},{"key":"BF02430365_CR14","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF02022999","volume":"41","author":"J. Chakrapani","year":"1993","unstructured":"Chakrapani, J., and Skorin-Kapov, J. (1993b). Massively parallel tabu search for the quadratic assignment problem.Annals of Operations Research, 41, 327\u2013342.","journal-title":"Annals of Operations Research"},{"key":"BF02430365_CR15","unstructured":"Crainic, T.G., Toulouse, M., and Gendreau, M. (1993a).Parallel Asynchronous Tabu Search for Multicommodity Location-Allocation with Balancing Requirements. Publication 935, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al."},{"key":"BF02430365_CR16","unstructured":"Crainic, T.G., Toulouse, M., and Gendreau, M. (1993b).Towards a Taxonomy of Parallel Tabu Search Algorithms. Publication 933, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al."},{"key":"BF02430365_CR17","doi-asserted-by":"crossref","unstructured":"Crainic, T.G., Toulouse, M., and Gendreau, M. (1995). Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements.OR Spektrum 17.","DOI":"10.1007\/BF01719254"},{"key":"BF02430365_CR18","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1147\/rd.313.0391","volume":"31","author":"F. Darema","year":"1987","unstructured":"Darema, F., Kirkpatrick, S., and Norton, V.A. (1987). Parallel algorithms for chip placement by simulated annealing.IBM Journal of Research and Development, 31, 391\u2013402.","journal-title":"IBM Journal of Research and Development"},{"key":"BF02430365_CR19","first-page":"18","volume-title":"Applied Simulated Annealing","author":"R. Diekmann","year":"1993","unstructured":"Diekmann, R., L\u00fcling, R., and Simon, J. (1993). Problem independent distributed simulated annealing and its applications. In R.V.V. Vidal (Ed.),Applied Simulated Annealing (pp. 18\u201344). LNEMS 396. Berlin: Springer-Verlag."},{"key":"BF02430365_CR20","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0167-8191(90)90063-F","volume":"16","author":"N. Dodd","year":"1990","unstructured":"Dodd, N. (1990). Slow annealing versus multiple fast annealing runs: An empirical investigation.Parallel Computing, 16, 269\u2013272.","journal-title":"Parallel Computing"},{"key":"BF02430365_CR21","volume-title":"Metaheuristics: The State of the Art 1995","author":"H.M.M. Ten Eikelder","year":"1995","unstructured":"Eikelder, H.M.M. Ten, Verhoeven, M.G.A., Vossen, T.W.M., and Aarts, E.H.L. (1995). A probabilistic analysis of local search. In I.H. Osman and J.P. Kelly (Eds.),Metaheuristics: The State of the Art 1995. Boston: Kluwer."},{"key":"BF02430365_CR22","unstructured":"Felten, E., Karlin, S., and Otto, S.W. (1985). The traveling salesman problem on a hypercubic MIMD machine.Proceedings of the International Conference on Parallel Processing (pp. 6\u201310). New York."},{"key":"BF02430365_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0898-1221(93)90275-Z","volume":"25","author":"A.G. Ferreira","year":"1993","unstructured":"Ferreira, A.G., and Zerovnik, J. (1993). Bounding the probability of success of stochastic methods for global optimization.Computers and Mathematics with Applications, 25, 1\u20138.","journal-title":"Computers and Mathematics with Applications"},{"key":"BF02430365_CR24","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(92)00033-I","volume":"51","author":"C.N. Fiechter","year":"1994","unstructured":"Fiechter, C.N. (1994). A parallel tabu search algorithm for large travelling salesman problems.Discrete Applied Mathematics, 51, 243\u2013267.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02430365_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF02022562","volume":"41","author":"B.L. Fox","year":"1993","unstructured":"Fox, B.L. (1993). Integrating and accelerating tabu search, simulated annealing, and genetic algorithms.Annals of Operations Research, 41, 47\u201367.","journal-title":"Annals of Operations Research"},{"key":"BF02430365_CR26","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1016\/0305-0548(94)90073-6","volume":"21","author":"B.L. Garcia","year":"1994","unstructured":"Garcia, B.L., Potvin, J.Y., and Rousseau, J.M. (1994). A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints.Computer Operations Research, 21, 1025\u20131033.","journal-title":"Computer Operations Research"},{"key":"BF02430365_CR27","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., and Johnson, D.S. (1979).Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman."},{"key":"BF02430365_CR28","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). Tabus search: Part I.ORSA Journal on Computing, 1, 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"BF02430365_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02078647","volume":"41","author":"F. Glover","year":"1993","unstructured":"Glover, F., Taillard, E., and De Werra, D. (1993). A user's guide to tabu search.Annals of Operations Research, 41, 3\u201328.","journal-title":"Annals of Operations Research"},{"key":"BF02430365_CR30","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goloberg","year":"1989","unstructured":"Goloberg, D.E. (1989).Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley."},{"key":"BF02430365_CR31","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0167-2789(90)90084-3","volume":"42","author":"D.R. Greening","year":"1990","unstructured":"Greening, D.R. (1990). Parallel simulated annealing techniques.Physica D, 42, 293\u2013306.","journal-title":"Physica D"},{"key":"BF02430365_CR32","first-page":"170","volume-title":"Proceedings of the Second International Conference on Genetic Algorithms","author":"P. Jog","year":"1987","unstructured":"Jog, P., and Van Gucht, D. (1987). Parallelisation of probabilistic sequential search algorithms.Proceedings of the Second International Conference on Genetic Algorithms (pp. 170\u2013176). San Mateo: Morgan Kaufmann."},{"key":"BF02430365_CR33","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/BFb0032050","volume-title":"Proceedings of the Seventeenth Colloquium on Automata, Languages, and Programming","author":"D.S. Johnson","year":"1990","unstructured":"Johnson, D.S. (1990). Local optimization and the traveling salesman problem.Proceedings of the Seventeenth Colloquium on Automata, Languages, and Programming (pp. 446\u2013461). LNCS 447. Berlin: Springer."},{"key":"BF02430365_CR34","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., and Yannakakis, M. (1988). How easy is local search?Journal of Computer and System Sciences, 37, 79\u2013100.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02430365_CR35","unstructured":"Jones, M.H., and Banerjee, P. (1987). An improved simulated annelaing algorithm for standard cell placement.Proceedings of the International Conference on Computer Design (pp. 83\u201386). Washington, D.C."},{"key":"BF02430365_CR36","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., and Lin, S. (1970). An efficient heuristic procedure for partitioning graphs.Bell systems Technical Journal, 49, 291\u2013307.","journal-title":"Bell systems Technical Journal"},{"key":"BF02430365_CR37","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0166-218X(93)90047-R","volume":"42","author":"G.A.P. Kindervater","year":"1993","unstructured":"Kindervater, G.A.P., Lenstra, J.K., and Savelsbergh, M.W.P. (1993). Sequential and parallel local search for the time constrained traveling salesman problem.Discrete Applied Mathematics, 42, 211\u2013225.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02430365_CR38","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, Jr., C.D., and Vecchi, M.P. (1983). Optimization by simulated annealing.Science, 220, 671\u2013680.","journal-title":"Science"},{"key":"BF02430365_CR39","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1051\/jphys:019850046080127700","volume":"46","author":"S. Kirkpatrick","year":"1985","unstructured":"Kirkpatrick, S., and Toulouse, G. (1985). Configuration space analysis of travelling salesman problems.Journal Physique, 46, 1277\u20131292.","journal-title":"Journal Physique"},{"key":"BF02430365_CR40","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1109\/TCAD.1987.1270301","volume":"6","author":"S.A. Kravitz","year":"1987","unstructured":"Kravitz, S.A., and Rutenbar, R.A. (1987). Placement by simulated annealing on a multiprocessor.IEEE Transactions on Computer Aided Design, 6, 534\u2013549.","journal-title":"IEEE Transactions on Computer Aided Design"},{"key":"BF02430365_CR41","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(90)90192-K","volume":"71","author":"C.P. Kruskal","year":"1990","unstructured":"Kruskal, C.P., Rudolph, L., and Snir, M. (1990). A complexity theory of efficient parallel algorithms.Theoretical Computer Science, 71, 95\u2013132.","journal-title":"Theoretical Computer Science"},{"key":"BF02430365_CR42","first-page":"177","volume-title":"Advances in Optimization and Parallel Computing","author":"Y. Li","year":"1992","unstructured":"Li, Y., and Pardalos, P.M. (1992). Parallel algorithms for the quadratic assignment problem. In P.M. Pardalos (Ed.),Advances in Optimization and Parallel Computing (pp. 177\u2013189). Amsterdam: Elsevier Science Publishers."},{"key":"BF02430365_CR43","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S. (1965). Computer solutions of the traveling salesman problem.Bell System Technical Journal, 44, 2245\u20132269.","journal-title":"Bell System Technical Journal"},{"key":"BF02430365_CR44","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., and Kernichan, B.W. (1973). An effective heuristic algorithm for the traveling salesman problem.Operations Research, 21, 498\u2013516.","journal-title":"Operations Research"},{"key":"BF02430365_CR45","unstructured":"Lueker, G. (1975).Two NP-Complete Problems in Nonnegative Integer Programming. Manuscript, Princeton University."},{"key":"BF02430365_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-8191(94)00071-H","volume":"21","author":"S.W. Mahfoud","year":"1995","unstructured":"Mahfoud, S.W., and Goldberg, D.E. (1995). Parallel recombinative simulated annealing: A genetic algorithm.Parallel Computing, 21, 1\u201328.","journal-title":"Parallel Computing"},{"key":"BF02430365_CR47","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02022093","volume":"21","author":"M. Malek","year":"1989","unstructured":"Malek, M., Guruswamy, M., and Pandya, M. (1989). Serial and parallel simulated annealing and tabu search for the traveling salesman problem.annals of Operations Research, 21, 59\u201384.","journal-title":"annals of Operations Research"},{"key":"BF02430365_CR48","first-page":"299","volume":"5","author":"O Martin","year":"1991","unstructured":"Martin, O, Otto, S.W., and Felten, E.W. (1991). Large-steps Markov chains for the travelling salesman problem.Complex Systems, 5, 299\u2013326.","journal-title":"Complex Systems"},{"key":"BF02430365_CR49","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02830-8","volume-title":"Genetic Algorithms+Data Structures=Evolution Programs","author":"Z. Michalewicz","year":"1992","unstructured":"Michalewicz, Z. (1992).Genetic Algorithms+Data Structures=Evolution Programs. Berlin: Springer-Verlag."},{"key":"BF02430365_CR50","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BF02022564","volume":"41","author":"P. Moscato","year":"1993","unstructured":"Moscato, P. (1993). An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search.Annals of Operations Research, 41, 85\u2013122.","journal-title":"Annals of Operations Research"},{"key":"BF02430365_CR51","volume-title":"Computer Science and Operations Research","author":"H. M\u00fchlenbein","year":"1992","unstructured":"M\u00fchlenbein, H. (1992). Parallel genetic algorithms in combinatorial optimization. In O. Balci (Ed.),Computer Science and Operations Research. London: Pergamon Press."},{"key":"BF02430365_CR52","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","volume":"7","author":"H. M\u00fchlenbein","year":"1988","unstructured":"M\u00fchlenbein, H., Gorges-Schleuter, M., and Kr\u00e4mer, O. (1988). Evolution algorithms in combinatorial optimization.Parallel Computing, 7, 65\u201385.","journal-title":"Parallel Computing"},{"key":"BF02430365_CR53","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1287\/ijoc.3.3.213","volume":"3","author":"L.J. Osborne","year":"1991","unstructured":"Osborne, L.J., and Gillett, B.E. (1991). A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks.ORSA Journal on Computing, 3, 213\u2013225.","journal-title":"ORSA Journal on Computing"},{"key":"BF02430365_CR54","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., and Steiglitz, K. (1982).Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall."},{"key":"BF02430365_CR55","volume-title":"Parallel Complexity Theory","author":"I. Parberry","year":"1987","unstructured":"Parberry, I. (1987).Parallel Complexity Theory. London: Pitman."},{"key":"BF02430365_CR56","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0141-9331(92)90038-U","volume":"16","author":"C.P. Ravikumar","year":"1992","unstructured":"Ravikumar, C.P. (1992). Parallel techniques for solving large scale travelling salesperson problems.Microprocessors and Microsystems, 16, 149\u2013158.","journal-title":"Microprocessors and Microsystems"},{"key":"BF02430365_CR57","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","year":"1993","unstructured":"Reeves, C.R. (Ed.). (1993).Modern Heuristic Techniques for Combinatorial Problems. London: Blackwell."},{"key":"BF02430365_CR58","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01759049","volume":"6","author":"F. Romeo","year":"1991","unstructured":"Romeo, F., and Sangiovanni-Vicentelli, A. (1991). a theoretical framework for simulated annealing.Algorithmica, 6, 302\u2013345.","journal-title":"Algorithmica"},{"key":"BF02430365_CR59","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1109\/43.3172","volume":"7","author":"J.S. Rose","year":"1988","unstructured":"Rose, J.S., Snelgrove, W.M., and Vranesic, Z.G. (1988). Parallel standard cell placement algorithms with quality equivalent to simulated annealing.IEEE Transactions on Computer-Aided Design, 7, 387\u2013396.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"BF02430365_CR60","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1109\/43.57790","volume":"9","author":"P. Roussel-Ragot","year":"1990","unstructured":"Roussel-Ragot, P., and Dreyfus, G. (1990). A problem independent parallel implementation for simulated annealing: Models and experiments.IEEE Transactions on Computer-Aided Design, 9, 827\u2013835.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"BF02430365_CR61","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0743-7315(91)90074-J","volume":"13","author":"J.E. Savage","year":"1991","unstructured":"Savage, J.E., and Wloka, M.G. (1991). Parallelism in graph-partioning.Journal of Parallel and Distributed Computing, 13, 257\u2013272.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"BF02430365_CR62","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1697-8","volume-title":"VLSI Placement and Global Routing Using Simulated Annealing","author":"C. Sechen","year":"1988","unstructured":"Sechen, C. (1988).VLSI Placement and Global Routing Using Simulated Annealing. Boston: Kluwer."},{"key":"BF02430365_CR63","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/103724.103725","volume":"23","author":"K. Shahookar","year":"1991","unstructured":"Shahookar, K., and Mazunder, P. (1991). VLSI cell-placement techniques.ACM Computing Surveys, 23, 143\u2013220.","journal-title":"ACM Computing Surveys"},{"key":"BF02430365_CR64","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E. Taillard","year":"1990","unstructured":"Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem.European Journal of Operations Research, 47, 65\u201374.","journal-title":"European Journal of Operations Research"},{"key":"BF02430365_CR65","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E. Taillard","year":"1991","unstructured":"Taillard, E. (1991). Robust taboo search for the quadratic assignment problem.Parallel Computing, 17, 443\u2013455.","journal-title":"Parallel Computing"},{"key":"BF02430365_CR66","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E. Taillard","year":"1993","unstructured":"Taillard, E. (1993). Parallel iterative search methods for vehicle routing problems.Networks, 23, 661\u2013673.","journal-title":"Networks"},{"key":"BF02430365_CR67","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","volume":"6","author":"E. Taillard","year":"1994","unstructured":"Taillard, E. (1994). Parallel taboo search techniques for the job shop scheduling problem.ORSA Journal on Computing, 6, 108\u2013117.","journal-title":"ORSA Journal on Computing"},{"key":"BF02430365_CR68","first-page":"65","volume":"2","author":"R.J.M. Vaessens","year":"1992","unstructured":"Vaessens, R.J.M., Aarts, E.H.L., and Lenstra, J.K. (1992). A local search template.Parallel Problem Solving from Nature, 2, 65\u201374.","journal-title":"Parallel Problem Solving from Nature"},{"key":"BF02430365_CR69","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0167-739X(94)00059-N","volume":"11","author":"M.G.A. Verhoeven","year":"1995","unstructured":"Verhoeven, M.G.A., Aarts, E.H.L., and Swinkels, P.C.J. (1995). A parallel 2-opt algorithm for the traveling salesman problem.Future Generation Computer Systems, 11, 175\u2013182.","journal-title":"Future Generation Computer Systems"},{"key":"BF02430365_CR70","first-page":"543","volume":"2","author":"M.G.A. Verhoeven","year":"1992","unstructured":"Verhoeven, M.G.A., Aarts, E.H.L., Van de Sluis, E., and Vaessens, R.J.M. (1992). Parallel local search and the travelling salesman problem (extended abstract).Proceedings of Parallel Problem Solving from Nature, 2, 543\u2013552.","journal-title":"Proceedings of Parallel Problem Solving from Nature"},{"key":"BF02430365_CR71","doi-asserted-by":"crossref","unstructured":"Verhoeven, M.G.A., Swinkels, P.C.J., and Aarts, E.H.L. (1995). Parallel local search and the traveling salesman problem. Working document.","DOI":"10.1016\/0167-739X(94)00059-N"},{"key":"BF02430365_CR72","doi-asserted-by":"crossref","unstructured":"Voss, S. (1993). Tabu search: Applications and Prospects. In D.Z. Du and P.M. Pardalos (Eds.),Network Optimization Problems (pp. 333\u2013353). City: World Scientific.","DOI":"10.1142\/9789812798190_0017"},{"key":"BF02430365_CR73","first-page":"298","volume-title":"Proceedings of the Seventh Symposium on Theoretical Aspects of Computer Science","author":"M. Yannakakis","year":"1990","unstructured":"Yannakakis, M. (1990). The analysis of local search problems and their heuristics.Proceedings of the Seventh Symposium on Theoretical Aspects of Computer Science (pp. 298\u2013311). LNCS 415. Berlin: Springer-Verlag."},{"key":"BF02430365_CR74","volume-title":"Local Search in Combinatorial Optimization","author":"M. Yannakakis","year":"1995","unstructured":"Yannakakis, M. (1995). Computational complexity of local search. In E.H.L. Aarts and J.K. Lenstra (Eds.),Local Search in Combinatorial Optimization. Berlin: Springer-Verlag."},{"key":"BF02430365_CR75","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0167-8191(05)80107-3","volume":"17","author":"C.S. Yeong","year":"1991","unstructured":"Yeong, C.S., and Kim, M.H. (1991). Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections.Parallel Computing, 17, 221\u2013228.","journal-title":"Parallel Computing"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02430365.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF02430365\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02430365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02430365.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T21:24:31Z","timestamp":1652563471000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF02430365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":75,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF02430365"],"URL":"https:\/\/doi.org\/10.1007\/bf02430365","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}