{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:11Z","timestamp":1746115871547,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642453175"},{"type":"electronic","value":"9783642453182"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45318-2_14","type":"book-chapter","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T00:59:39Z","timestamp":1385341179000},"page":"315-338","source":"Crossref","is-referenced-by-count":0,"title":["Incorporating Highly Explorative Methods to Improve the Performance of Variable Neighborhood Search"],"prefix":"10.1007","author":[{"given":"Mohammad R.","family":"Raeesi N.","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziad","family":"Kobti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research\u00a024, 1097\u20131100 (1997)","journal-title":"Computers and Operations Research"},{"issue":"11","key":"14_CR2","doi-asserted-by":"publisher","first-page":"2983","DOI":"10.1016\/j.cor.2009.01.015","volume":"36","author":"A. Felipe","year":"2009","unstructured":"Felipe, A., Ortuno, M.T., Tirado, G.: The double traveling salesman problem with multiple stacks: a variable neighborhood search approach. Computers and Operations Research\u00a036(11), 2983\u20132993 (2009)","journal-title":"Computers and Operations Research"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.ejor.2007.06.064","volume":"195","author":"K. Fleszar","year":"2009","unstructured":"Fleszar, K., Osman, I.H., Hindi, K.S.: A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research\u00a0195, 803\u2013809 (2009)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.ejor.2006.12.055","volume":"191","author":"K. Fleszar","year":"2008","unstructured":"Fleszar, K., Hindi, K.S.: An effective vns for the capacitated p-median problem. European Journal of Operational Research\u00a0191(3), 612\u2013622 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"14_CR5","doi-asserted-by":"publisher","first-page":"2885","DOI":"10.1016\/j.cor.2008.12.020","volume":"36","author":"J. Brimberg","year":"2009","unstructured":"Brimberg, J., Mladenovic, N., Urosevic, D., Ngai, E.: Variable neighborhood search for the heaviest k-subgraph. Computers and Operations Research\u00a036(11), 2885\u20132891 (2009)","journal-title":"Computers and Operations Research"},{"key":"14_CR6","first-page":"289","volume":"10","author":"T. Crainic","year":"2004","unstructured":"Crainic, T., Gendreau, M., Hansen, P., Mladenovic, N.: Cooperative parallel variable neighborhood search for the p-median. Journal of Heuristics\u00a010, 289\u2013310 (2004)","journal-title":"Journal of Heuristics"},{"issue":"7","key":"14_CR7","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1016\/j.cor.2008.09.001","volume":"36","author":"R. Mansini","year":"2009","unstructured":"Mansini, R., Tocchella, B.: The traveling purchaser problem with budget constraint. Computers and Operations Research\u00a036(7), 2263\u20132274 (2009)","journal-title":"Computers and Operations Research"},{"issue":"6","key":"14_CR8","doi-asserted-by":"publisher","first-page":"2105","DOI":"10.1016\/j.cor.2008.07.009","volume":"36","author":"X. Wang","year":"2009","unstructured":"Wang, X., Tang, L.: A population-based variable neighborhood search for the single machine total weighted tardiness problem. Computers and Operations Research Archive\u00a036(6), 2105\u20132110 (2009)","journal-title":"Computers and Operations Research Archive"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Raeesi N., M.R., Kobti, Z.: Incorporating a genetic algorithm to improve the performance of variable neighborhood search. In: The Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC), pp. 144\u2013149 (2012)","DOI":"10.1109\/NaBIC.2012.6402253"},{"key":"14_CR10","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press (1975)"},{"key":"14_CR11","first-page":"219","volume":"14","author":"P. Moscato","year":"1999","unstructured":"Moscato, P.: Memetic algorithms: A short introduction. New Ideas in Optimization\u00a014, 219\u2013234 (1999)","journal-title":"New Ideas in Optimization"},{"issue":"4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R. Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization\u00a011(4), 341\u2013359 (1997)","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/TEVC.2010.2087026","volume":"15","author":"M. Vasile","year":"2011","unstructured":"Vasile, M., Minisci, E.A., Locatelli, M.: An inflationary differential evolution algorithm for space trajectory optimization. IEEE Transactions on Evolutionary Computation\u00a015(2), 267\u2013281 (2011)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/j.ijepes.2010.12.033","volume":"33","author":"M. Sharma","year":"2011","unstructured":"Sharma, M., Pandit, M., Srivastava, L.: Reserve constrained multi-area economic dispatch employing differential evolution with time-varying mutation. International Journal of Electrical Power and Energy Systems\u00a033(3), 753\u2013766 (2011)","journal-title":"International Journal of Electrical Power and Energy Systems"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/TEVC.2007.895272","volume":"12","author":"N. Noman","year":"2008","unstructured":"Noman, N., Iba, H.: Accelerating differential evolution using an adaptive local search. IEEE Transactions on Evolutionary Computation\u00a012(1), 107\u2013125 (2008)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1016\/j.ejor.2004.08.043","volume":"171","author":"G. Onwubolu","year":"2006","unstructured":"Onwubolu, G., Davendra, D.: Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research\u00a0171(2), 674\u2013692 (2006)","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"14_CR17","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s00170-007-1115-8","volume":"38","author":"B. Qian","year":"2008","unstructured":"Qian, B., Wang, L., Hu, R., Wang, W.L., Huang, D.X., Wang, X.: A hybrid differential evolution method for permutation flow-shop scheduling. The International Journal of Advanced Manufacturing Technology\u00a038(7), 757\u2013777 (2008)","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, R., Wu, C.: A hybrid differential evolution and tree search algorithm for the job shop scheduling problem. Mathematical Problems in Engineering\u00a02011, Article ID 390593 (2011)","DOI":"10.1155\/2011\/390593"},{"issue":"4","key":"14_CR19","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.cie.2008.03.003","volume":"55","author":"Q.K. Pan","year":"2008","unstructured":"Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Computers & Industrial Engineering\u00a055(4), 795\u2013816 (2008)","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"14_CR20","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.cor.2008.12.004","volume":"37","author":"L. Wang","year":"2010","unstructured":"Wang, L., Pan, Q.K., Suganthan, P.N., Wang, W.H., Wang, Y.M.: A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Computers & Operations Research\u00a037(3), 509\u2013520 (2010)","journal-title":"Computers & Operations Research"},{"key":"14_CR21","volume-title":"Differential evolution: a practical approach to global optimization (Natural Computing Series)","author":"K. Price","year":"2005","unstructured":"Price, K., Storn, R., Lampinen, J.: Differential evolution: a practical approach to global optimization (Natural Computing Series). Springer, New York (2005)"},{"issue":"10","key":"14_CR22","doi-asserted-by":"publisher","first-page":"2757","DOI":"10.1080\/00207543.2011.588972","volume":"50","author":"W. Wisittipanich","year":"2012","unstructured":"Wisittipanich, W., Kachitvichyanukul, V.: Two enhanced differential evolution algorithms for job shop scheduling problems. International Journal of Production Research\u00a050(10), 2757\u20132773 (2012)","journal-title":"International Journal of Production Research"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Tasoulis, D.K., Pavlidis, N.G., Plagianakos, V.P., Vrahatis, M.N.: Parallel differential evolution. In: IEEE Congress on Evolutionary Computation (CEC), pp. 2023\u20132029 (2004)","DOI":"10.1109\/CEC.2004.1331145"},{"key":"14_CR24","unstructured":"Tasgetiren, M.F., Suganthan, P.N.: A multi-populated differential evolution algorithm for solving constrained optimization problem. In: IEEE Congress on Evolutionary Computation (CEC), pp. 340\u2013354 (2006)"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Yu, W.J., Zhang, J.: Multi-population differential evolution with adaptive parameter control for global optimization. In: Genetic and Evolutionary Computation Conference (GECCO), Dublin, Ireland, pp. 1093\u20131098 (2011)","DOI":"10.1145\/2001576.2001724"},{"key":"14_CR26","unstructured":"Mendes, R., Mohais, A.S.: DynDE: A differential evolution for dynamic optimization problems. In: IEEE Congress on Evolutionary Computation (CEC), vol.\u00a02, pp. 2808\u20132815 (2005)"},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research\u00a01, 117\u2013129 (1976)","journal-title":"Mathematics of Operations Research"},{"key":"14_CR28","unstructured":"Baker, K.R.: Introduction to Sequencing and Scheduling. Wiley (1974)"},{"key":"14_CR29","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0305-0548(93)E0015-L","volume":"22","author":"F. Croce","year":"1995","unstructured":"Croce, F., Tadei, R., Volta, G.: A genetic algorithm for the job shop problem. Computers in Operations Research\u00a022, 15\u201324 (1995)","journal-title":"Computers in Operations Research"},{"key":"14_CR30","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s12293-008-0004-5","volume":"1","author":"S. Hasan","year":"2008","unstructured":"Hasan, S., Sarker, R., Essam, D., Cornforth, D.: Memetic algorithms for solving job-shop scheduling problems. Memetic Computing\u00a01, 69\u201383 (2008)","journal-title":"Memetic Computing"},{"key":"14_CR31","series-title":"STUDFUZZ","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-44511-1_3","volume-title":"Knowledge Incorporation in Evolutionary Computation","author":"R.L. Becerra","year":"2005","unstructured":"Becerra, R.L., Coello, C.A.C.: A cultural algorithm for solving the job-shop scheduling problem. In: Jin, Y. (ed.) Knowledge Incorporation in Evolutionary Computation. STUDFUZZ, vol.\u00a0167, pp. 37\u201355. Springer, Heidelberg (2005)"},{"issue":"9","key":"14_CR32","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J. Gao","year":"2008","unstructured":"Gao, J., Sun, L., Gen, M.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers and Operations Research\u00a035(9), 2892\u20132907 (2008)","journal-title":"Computers and Operations Research"},{"issue":"7","key":"14_CR33","doi-asserted-by":"publisher","first-page":"2331","DOI":"10.1016\/j.cor.2006.11.007","volume":"35","author":"A. Caumond","year":"2008","unstructured":"Caumond, A., Lacomme, P., Tcherneva, N.: A memetic algorithm for the job-shop with time-lags. Computers and Operations Research\u00a035(7), 2331\u20132356 (2008)","journal-title":"Computers and Operations Research"},{"issue":"5","key":"14_CR34","doi-asserted-by":"publisher","first-page":"5986","DOI":"10.1016\/j.eswa.2010.11.022","volume":"38","author":"T.C. Chiang","year":"2011","unstructured":"Chiang, T.C., Cheng, H.C., Fu, L.C.: NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems. Expert Systems with Applications\u00a038(5), 5986\u20135999 (2011)","journal-title":"Expert Systems with Applications"},{"issue":"2-3","key":"14_CR35","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01719250","volume":"17","author":"C. Bierwirth","year":"1995","unstructured":"Bierwirth, C.: A generalized permutation approach to job shop scheduling with genetic algorithms. OR Spectrum. Special Issue on Applied Local Search\u00a017(2-3), 87\u201392 (1995)","journal-title":"OR Spectrum. Special Issue on Applied Local Search"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Tasgetiren, M.F., Sevkli, M., Liang, Y.C., Gencyilmaz, G.: Particle swarm optimization algorithm for single-machine total weighted tardiness problem. In: Congress on Evolutionary Computation (CEC), Portland, Oregan, USA, pp. 1412\u20131419 (2004)","DOI":"10.1109\/CEC.2004.1331062"},{"issue":"1","key":"14_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","volume":"93","author":"J. Blazewicz","year":"1996","unstructured":"Blazewicz, J., Domschke, W., Pesch, E.: The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research\u00a093(1), 1\u201333 (1996)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"14_CR38","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P.J.M. Laarhoven Van","year":"1992","unstructured":"Van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job shop scheduling by simulated annealing. Operations Research\u00a040(1), 113\u2013125 (1992)","journal-title":"Operations Research"},{"key":"14_CR39","unstructured":"Matsuo, H., Suh, C., Sullivan, R.: A controlled search simulated annealing method for the general job shop scheduling problem. In: Working Paper 03-04-88. University of Texas at Austin (1988)"},{"issue":"3","key":"14_CR40","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M. Dell\u2019Amico","year":"1993","unstructured":"Dell\u2019Amico, M., Trubian, M.: Applying tabu search to the job-shop scheduling problem. Annals of Operations Research\u00a041(3), 231\u2013252 (1993)","journal-title":"Annals of Operations Research"},{"issue":"6","key":"14_CR41","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop scheduling problem. Management Science\u00a042(6), 797\u2013813 (1996)","journal-title":"Management Science"},{"issue":"2","key":"14_CR42","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E. Balas","year":"1998","unstructured":"Balas, E., Vazacopoulos, A.: Guided local search with shifting bottleneck for job shop scheduling. Management Science\u00a044(2), 262\u2013275 (1998)","journal-title":"Management Science"},{"issue":"3","key":"14_CR43","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s12293-012-0084-0","volume":"4","author":"M.R.N. Raeesi","year":"2012","unstructured":"Raeesi, M.R.N., Kobt, Z.: A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic. Memetic Computing - Special Issue on Optimization on Complex Systems\u00a04(3), 231\u2013245 (2012)","journal-title":"Memetic Computing - Special Issue on Optimization on Complex Systems"},{"key":"14_CR44","unstructured":"Lawrence, S.: Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Master\u2019s thesis, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania (1984)"},{"key":"14_CR45","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1057\/palgrave.jors.2602534","volume":"60","author":"G.I. Zobolas","year":"2009","unstructured":"Zobolas, G.I., Tarantilis, C.D., Ioannou, G.: A hybrid evolutionary algorithm for the job shop scheduling problem. Journal of the Operational Research Society\u00a060, 221\u2013235 (2009)","journal-title":"Journal of the Operational Research Society"},{"issue":"10","key":"14_CR46","doi-asserted-by":"publisher","first-page":"2291","DOI":"10.1016\/j.cor.2011.12.005","volume":"39","author":"M.A. Gonz\u00e1lez","year":"2012","unstructured":"Gonz\u00e1lez, M.A., Vela, C.R., Varela, R.: A new hybrid genetic algorithm for job shop scheduling problem. Computers and Operations Research\u00a039(10), 2291\u20132299 (2012)","journal-title":"Computers and Operations Research"}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Science XXI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45318-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T22:57:45Z","timestamp":1746053865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45318-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642453175","9783642453182"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45318-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}