{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:21:37Z","timestamp":1729610497659,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/cec.2015.7257178","type":"proceedings-article","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T21:22:46Z","timestamp":1442265766000},"page":"2368-2375","source":"Crossref","is-referenced-by-count":8,"title":["Case based human oriented delivery route optimization"],"prefix":"10.1109","author":[{"given":"Takashi","family":"Kawabe","sequence":"first","affiliation":[]},{"given":"Yuuta","family":"Kobayashi","sequence":"additional","affiliation":[]},{"given":"Setsuo","family":"Tsuruta","sequence":"additional","affiliation":[]},{"given":"Yoshitaka","family":"Sakurai","sequence":"additional","affiliation":[]},{"given":"Rainer","family":"Knauf","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1007\/s12532-009-0004-6"},{"year":"2007","author":"huellermeier","article-title":"Case-Based Approximate Reasoning. Springer-Verlag","key":"ref11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1541\/ieejeiss.124.912"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1287\/moor.2.3.209"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1527\/tjsai.21.482","article-title":"Hybridization of Genetic Algorithm with Local Search in Multiobjective Function Optimization: Recommendation of GA then LS","volume":"21","author":"ken","year":"2006","journal-title":"Transactions of the Japanese Society for Artificial Intelligence"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by Simulated Annealing","volume":"220","author":"kirkpatrick","year":"1983","journal-title":"Science"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1287\/opre.21.2.498"},{"key":"ref17","first-page":"848","article-title":"The Proposal and Evaluation of a Crossover for Traveling Salesman Problems: Edge Assembly Crossover","volume":"14","author":"nagata","year":"1999","journal-title":"Journal of Japan Society for Al"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/TSMCB.2006.880136"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/IRI.2006.252421"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0020-0255(99)00124-3","article-title":"Case injected genetic algorithms for traveling salesman problems","volume":"122","author":"sushil","year":"2000","journal-title":"Information Sciences Elsevier"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/ICNNSP.2003.1279298"},{"key":"ref27","first-page":"670","article-title":"A sequential similarity metric for case injected genetic algorithms applied to tsps","volume":"1","author":"louis","year":"1999","journal-title":"Proc Genetic Evolutionary Computation Conf"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TSMCC.2002.804444"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1287\/ijoc.1.3.190"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/TEVC.2004.823466"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1287\/opre.42.5.860"},{"key":"ref8","first-page":"0","article-title":"Simulated Anealing for maximum temperature, Systems","volume":"1","author":"miki","year":"2003","journal-title":"Proc of the IEEE International Conference Man and Cyernetics 2003"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1287\/ijoc.2.1.4"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/4235.974843"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1007\/b101971","article-title":"The Traveling Salesman Problem and its Variations","author":"gutin","year":"2007"},{"year":"2014","journal-title":"See","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/COASE.2008.4626556"},{"key":"ref22","first-page":"85","article-title":"A Fast Evolutionary Algorithm for Traveling Salesman Problem","volume":"4","author":"van","year":"2007","journal-title":"Proc of Third International Conference on Natural Computation (ICNC 2007)"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/CEC.2011.5949968"},{"year":"1997","author":"yamamoto","article-title":"Invitation to Traveling Salesman Problem","key":"ref24"},{"key":"ref23","first-page":"133","article-title":"Scheduling Problem and Traveling Salesman: The Genetic Edge Recombination Operator","author":"whiteley","year":"1989","journal-title":"proceeding of ICGA'89"},{"key":"ref26","first-page":"283","article-title":"Solving similar problems using genetic algorithms and case-based memory","author":"louis","year":"1997","journal-title":"Proc 7th Int Conf Genetic Algorithms"},{"key":"ref25","first-page":"108","article-title":"Augmenting genetic algorithms with memory to solve traveling salesman problems","author":"louis","year":"1997","journal-title":"Proc 3rd Joint Conf Information Sciences"}],"event":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2015,5,25]]},"location":"Sendai, Japan","end":{"date-parts":[[2015,5,28]]}},"container-title":["2015 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7229815\/7256859\/07257178.pdf?arnumber=7257178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T19:31:55Z","timestamp":1498246315000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7257178\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/cec.2015.7257178","relation":{},"subject":[],"published":{"date-parts":[[2015,5]]}}}