{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T21:56:30Z","timestamp":1773266190830,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T00:00:00Z","timestamp":1389657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s12293-013-0129-z","type":"journal-article","created":{"date-parts":[[2014,1,13]],"date-time":"2014-01-13T04:24:47Z","timestamp":1389587087000},"page":"19-29","source":"Crossref","is-referenced-by-count":10,"title":["A bare-bones ant colony optimization algorithm that performs competitively on the sequential ordering problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Ahmed","family":"Ezzat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashraf M.","family":"Abdelbar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"II","given":"Donald C.","family":"Wunsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,14]]},"reference":[{"key":"129_CR1","doi-asserted-by":"crossref","unstructured":"Abdelbar AM (2008) Stubborn ants. In: Proceedings SIS-08, St. Louis, pp 1\u20135","DOI":"10.1109\/SIS.2008.4668307"},{"key":"129_CR2","doi-asserted-by":"crossref","unstructured":"Abdelbar AM (2012) Is there a computational advantage to representing evaporation rate in ant colony optimization as a Gaussian random variable?. In: Proceedings GECCO-12, Philadelphia, pp 1\u20138","DOI":"10.1145\/2330163.2330165"},{"key":"129_CR3","unstructured":"Abdelbar AM, Wunsch DC (2012) Improving the performance of MAX-MIN ant system on the TSP using stubborn ants. In: Proceedings GECCO-12, Philadelphia, pp 1395\u20131396"},{"key":"129_CR4","unstructured":"Anghinolfi D, Montemanni R, Paolucci M, Gambardella LM (2009) A particle swarm optimization approach for the sequential ordering problem. In: Proceedings MIC-09. Hamburg, Germany"},{"issue":"7","key":"129_CR5","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1016\/j.cor.2010.10.014","volume":"38","author":"D Anghinolfi","year":"2011","unstructured":"Anghinolfi D, Montemanni R, Paolucci M, Gambardella LM (2011) A hybrid particle swarm optimization approach for the sequential ordering problem. Comput Operat Res 38(7):1076\u20131085","journal-title":"Comput Operat Res"},{"key":"129_CR6","unstructured":"Ascheuer N (1995) Hamiltonian path problems in the on-line optimization of flexible manufacturing systems, PhD Thesis, Technische Universit\u00e4t Berlin"},{"issue":"4","key":"129_CR7","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JJ Bentley","year":"1992","unstructured":"Bentley JJ (1992) Fast algorithms for geometric traveling salesman problems. ORSA J Comput 4(4):387\u2013411","journal-title":"ORSA J Comput"},{"key":"129_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1018940026670","volume":"89","author":"B Bullnheimer","year":"1999","unstructured":"Bullnheimer B, Hartl RF, Strauss C (1999) An improved ant system algorithm for the vehicle routing problem. Ann Operat Res 89:25\u201338","journal-title":"Ann Operat Res"},{"key":"129_CR9","unstructured":"Chen S, Smith S (1996) Commonality and genetic algorithms, Technical Report CMURI-TR-96-27, Robotic Institute, Carnegie Mellon University"},{"key":"129_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s12293-010-0035-6","volume":"3","author":"M Chica","year":"2011","unstructured":"Chica M, Cord\u00f3n O, Damas S, Bautista J (2011) A new diversity induction mechanism for a multi-objective ant colony algorithm to solve a real-world time and space assembly line balancing problem. Memet Comput 3:15\u201324","journal-title":"Memet Comput"},{"issue":"2\u20133","key":"129_CR11","first-page":"177","volume":"9","author":"O Cord\u00f3n","year":"2002","unstructured":"Cord\u00f3n O, de Viana IF, Herrera F (2002) Analysis of the best-worst ant system and its variants on the TSP. Mathw Soft Comput 9(2\u20133):177\u2013192","journal-title":"Mathw Soft Comput"},{"key":"129_CR12","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. Mach Learn Res 7:1\u201330","journal-title":"Mach Learn Res"},{"issue":"1","key":"129_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evolut Comput 1(1):35\u201366","journal-title":"IEEE Trans Evolut Comput"},{"issue":"1","key":"129_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperative agents. IEEE Trans Syst Man Cybern 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"129_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/b99492","volume-title":"Ant colony optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo M, St\u00fctzle T (2004) Ant colony optimization. MIT Press, Cambridge"},{"key":"129_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-1-4419-1665-5_8","volume-title":"Handbook of metaheuristics","author":"M Dorigo","year":"2010","unstructured":"Dorigo M, St\u00fctzle T (2010) Ant colony optimization: overview and recent advances. In: Gendreau M, Potvin Y (eds) Handbook of metaheuristics, 2nd edn. Springer, New York, pp 227\u2013263","edition":"2"},{"key":"129_CR17","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/0377-2217(88)90333-5","volume":"37","author":"LF Escudero","year":"1988","unstructured":"Escudero LF (1988) An inexact algorithm for the sequential ordering problem. Eur J Operat Res 37:232\u2013253","journal-title":"Eur J Operat Res"},{"key":"129_CR18","doi-asserted-by":"crossref","unstructured":"Ezzat A, Abdelbar AM (2013) A less-exploitative variation of the enhanced ant colony system applied to SOP. In: Proceedings CEC-2013, Can\u0107un, Mexico, pp 1917\u20131924","DOI":"10.1109\/CEC.2013.6557793"},{"issue":"3","key":"129_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1287\/ijoc.12.3.237.12636","volume":"12","author":"LM Gambardella","year":"2000","unstructured":"Gambardella LM, Dorigo M (2000) An ant colony system hybridized with a new local search for the sequential ordering problem. INFORMS J Comput 12(3):237\u2013255","journal-title":"INFORMS J Comput"},{"issue":"3","key":"129_CR20","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1016\/j.ejor.2012.02.038","volume":"220","author":"LM Gambardella","year":"2012","unstructured":"Gambardella LM, Montemanni R, Weyland D (2012) Coupling ant colony systems with strong local searches. Eur J Operat Res 220(3):831\u2013843","journal-title":"Eur J Operat Res"},{"issue":"5","key":"129_CR21","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/S0167-8191(03)00048-6","volume":"29","author":"F Guerriero","year":"2003","unstructured":"Guerriero F, Mancini M (2003) A cooperative parallel rollout algorithm for the sequential ordering problem. Parallel Comput 29(5):663\u2013677","journal-title":"Parallel Comput"},{"key":"129_CR22","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s12293-010-0039-2","volume":"3","author":"DE Jackson","year":"2011","unstructured":"Jackson DE, Bicak M, Holcombe M (2011) Decentralized communication, trail connectivity and emergent benefits of ant pheromone trail networks. Memet Comput 3:25\u201332","journal-title":"Memet Comput"},{"issue":"1","key":"129_CR23","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s11721-013-0076-9","volume":"7","author":"Jayadeva","year":"2013","unstructured":"Jayadeva, Shah S, Bhaya A, Kothari R, Chandra S (2013) Ants find the shortest path: a mathematical proof. Swarm Intell 7(1):43\u201362","journal-title":"Swarm Intell"},{"key":"129_CR24","first-page":"337","volume-title":"Local search in combinatorial optimization","author":"G Kindervater","year":"1997","unstructured":"Kindervater G, Savelsbergh M (1997) Vehicle routing: handling edge exchanges. In: Aarts EHL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, Chichester, pp 337\u2013360"},{"key":"129_CR25","doi-asserted-by":"publisher","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 Syst Tech J 44:2245\u20132269","journal-title":"Bell Syst Tech J"},{"key":"129_CR26","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Operat Res 21:498\u2013516","journal-title":"Operat Res"},{"key":"129_CR27","unstructured":"Montemanni R. SOPLIB2006 Problem Instance Library. \n                    http:\/\/www.idsia.ch\/~roberto\/SOPLIB06.zip"},{"key":"129_CR28","doi-asserted-by":"crossref","unstructured":"Montemanni R, Smith DH, Gambardella LM (2007) Ant colony systems for large sequential ordering problems. In: Proceedings SIS-07, Honolulu, pp 60\u201367","DOI":"10.1109\/SIS.2007.368027"},{"issue":"12","key":"129_CR29","doi-asserted-by":"publisher","first-page":"3931","DOI":"10.1016\/j.cor.2007.05.003","volume":"35","author":"R Montemanni","year":"2008","unstructured":"Montemanni R, Smith DH, Gambardella LM (2008) A heuristic manipulation technique for the sequential ordering problem. Comput Operat Res 35(12):3931\u20133944","journal-title":"Comput Operat Res"},{"issue":"4","key":"129_CR30","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1504\/IJSPM.2009.032597","volume":"5","author":"R Montemanni","year":"2009","unstructured":"Montemanni R, Smith DH, Rizzoli AE, Gambardella LM (2009) Sequential ordering problems for crane scheduling in port terminals. Int J Simul Process Model 5(4):348\u2013361","journal-title":"Int J Simul Process Model"},{"key":"129_CR31","unstructured":"Or I (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking, PhD Thesis, Dept. of Industrial Engineering and Management Sciences, Northwestern University"},{"key":"129_CR32","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12293-010-0045-4","volume":"2","author":"FEB Otero","year":"2010","unstructured":"Otero FEB, Freitas AA, Johnson CG (2010) A hierarchical multi-label classification ant colony algorithm for protein function prediction. Memet Comput 2:165\u2013181","journal-title":"Memet Comput"},{"key":"129_CR33","unstructured":"Pullyblank W, Timlin M (1991) Precedence constrained routing and helicopter scheduling: heuristic design, Technical Report RC17154 (#76032). IBM T.J. Watson Research Center"},{"key":"129_CR34","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0377-2217(90)90091-O","volume":"47","author":"MWP Savelsbergh","year":"1990","unstructured":"Savelsbergh MWP (1990) An efficient implementation of local search algorithms for constrained routing problems. Eur J Operat Res 47:75\u201385","journal-title":"Eur J Operat Res"},{"key":"129_CR35","unstructured":"Seo DI, Moon BR (2003) A hybrid genetic algorithm based on complete graph representation for the sequential ordering problem. In: Proceedings GECCO-03, Chicago, pp 669\u2013680"},{"key":"129_CR36","unstructured":"St\u00fctzle T. ACOTSP: a software package for various ant colony optimization algorithms applied to the symmetric traveling salesman problem. \n                    http:\/\/www.aco-metaheuristic.org\/aco-code\/"},{"issue":"8","key":"129_CR37","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos H (2000) MAX-MIN ant system. Future Gener Comput Syst 16(8):889\u2013914","journal-title":"Future Gener Comput Syst"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-013-0129-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-013-0129-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-013-0129-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-013-0129-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T02:22:30Z","timestamp":1581992550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-013-0129-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,14]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["129"],"URL":"https:\/\/doi.org\/10.1007\/s12293-013-0129-z","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,14]]}}}