{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:54:02Z","timestamp":1781106842171,"version":"3.54.1"},"reference-count":28,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,7,1]]},"abstract":"<p>Path relinking (PR) maintains a reference set of elite and diverse solutions, and generates new solutions between and beyond initiating and guiding solutions selected from this set as a foundation for an evolutionary solution process. However, in spite of the widespread application of path relinking in combinatorial optimization, almost all PR implementations only consider the between-form of PR. This note discusses the beyond-form of path relinking, which is called Exterior Path Relinking, and focuses on its relevance for diversification strategies in binary optimization. Finally, this work also observes how to combine the Exterior (beyond) and Interior (between) forms of path relinking.<\/p>","DOI":"10.4018\/ijamc.2014070101","type":"journal-article","created":{"date-parts":[[2014,10,21]],"date-time":"2014-10-21T10:50:13Z","timestamp":1413888613000},"page":"1-8","source":"Crossref","is-referenced-by-count":18,"title":["Exterior Path Relinking for Zero-One Optimization"],"prefix":"10.4018","volume":"5","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[{"name":"ECEE, School of Engineering & Science, University of Colorado, Boulder, CO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijamc.2014070101-0","article-title":"Path Relinking for Large Scale Global Optimization","author":"A.Duarte","year":"2013","journal-title":"Soft Computing"},{"key":"ijamc.2014070101-1","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039515.90453.1d"},{"key":"ijamc.2014070101-2","doi-asserted-by":"crossref","unstructured":"F. Glover (1989) \u201cTabu Search \u2013 Part I,\u201d ORSA Journal on Computing, Vol. 1, No. 3, pp. 190-206.","DOI":"10.1287\/ijoc.1.3.190"},{"key":"ijamc.2014070101-3","doi-asserted-by":"crossref","unstructured":"Glover, F. (1996) \u201cTabu Search and Adaptive Memory Programming - Advances, Applications and Challenges,\u201d in Interfaces in Computer Science and Operations Research, Barr, Helgason and Kennington (eds.) Kluwer Academic Publishers, pp. 1-75.","DOI":"10.1007\/978-1-4615-4102-8_1"},{"key":"ijamc.2014070101-4","first-page":"71","article-title":"\u201cTabu Search,\u201d chapter","author":"F.Glover","year":"1993","journal-title":"Modern Heuristic Techniques for Combinatorial Problems"},{"key":"ijamc.2014070101-5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"ijamc.2014070101-6","unstructured":"Glover, F., Laguna, M., & Marti, R. (2000) \u201cFundamentals of Scatter Search and Path Relinking,\u201d Control and Cybernetics, volume 29, number 3, pp. 653-684."},{"key":"ijamc.2014070101-7","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_1"},{"key":"ijamc.2014070101-8","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-006-4192-1"},{"key":"ijamc.2014070101-9","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2005.74"},{"key":"ijamc.2014070101-10","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.1.44"},{"key":"ijamc.2014070101-11","article-title":"Path Relinking for Bandwidth Coloring Problems","author":"X.Lai","year":"2013","journal-title":"Preprint"},{"key":"ijamc.2014070101-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.06.039"},{"key":"ijamc.2014070101-13","doi-asserted-by":"publisher","DOI":"10.1007\/s10852-007-9073-6"},{"key":"ijamc.2014070101-14","doi-asserted-by":"publisher","DOI":"10.4018\/jsir.2011040101"},{"key":"ijamc.2014070101-15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.10.012"},{"key":"ijamc.2014070101-16","article-title":"GRASP and PR for the Equitable Dispersion Problem","author":"R.Mart\u00ed","year":"2012","journal-title":"Computers & Operations Research"},{"key":"ijamc.2014070101-17","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00715-4"},{"key":"ijamc.2014070101-18","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-013-9221-2"},{"key":"ijamc.2014070101-19","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1998.6.1.45"},{"key":"ijamc.2014070101-20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.05.011"},{"key":"ijamc.2014070101-21","doi-asserted-by":"crossref","unstructured":"Resende, M. G. C., Ribeiro, C. C., Glover, F., & Mart\u00ed, R. (2010) \u201cScatter Search and Path Relinking: Fundamentals, Advances and Applications,\u201d Handbook of Metaheuristics: International Series in Operations Research & Management Science, Volume 146, pp 87-107.","DOI":"10.1007\/978-1-4419-1665-5_4"},{"key":"ijamc.2014070101-22","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-011-9167-1"},{"key":"ijamc.2014070101-23","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2009.04.002"},{"key":"ijamc.2014070101-24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.07.012"},{"key":"ijamc.2014070101-25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.08.015"},{"key":"ijamc.2014070101-26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74446-7_9"},{"key":"ijamc.2014070101-27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.08.007"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=117263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T10:41:36Z","timestamp":1654080096000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijamc.2014070101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2014,7,1]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,7]]}},"URL":"https:\/\/doi.org\/10.4018\/ijamc.2014070101","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,1]]}}}