{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:10:55Z","timestamp":1729638655224,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/cec.2015.7256977","type":"proceedings-article","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T21:22:46Z","timestamp":1442265766000},"page":"830-837","source":"Crossref","is-referenced-by-count":19,"title":["A math-hyper-heuristic approach for large-scale vehicle routing problems with time windows"],"prefix":"10.1109","author":[{"given":"Nasser R.","family":"Sabar","sequence":"first","affiliation":[]},{"given":"Xiuzhen Jenny","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Andy","family":"Song","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.09.045"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140406"},{"article-title":"Adaptive operator selection for optimization","year":"2010","author":"fialho","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(94)90073-6"},{"key":"ref13","first-page":"35","article-title":"A parallel two-phase metaheuristic for routing problems with time windows","volume":"18","author":"gehring","year":"2001","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"ref14","article-title":"Solving large-scale vehicle routing problems with time windows: The state-of-the-art","author":"gendreau","year":"2010","journal-title":"Technical report Tech rep CIRRELT"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.01.027"},{"journal-title":"Parallelization of the vehicle routing problem with time windows","year":"2005","author":"kallehauge","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.7.1.10"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90192-C"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1090.0301"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.07.018"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1030.0057"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2323936"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1030.0056"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.09.001"},{"journal-title":"Time-Window Relaxations in Vehicle Routing Heuristics Tech rep CIRRELT Montréal","year":"2013","author":"vidal","key":"ref29"},{"key":"ref5","first-page":"449","article-title":"A classification of hyper-heuristic approaches","author":"edmund","year":"2010","journal-title":"Handbook of Metaheuristics"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.80"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/EMPDP.2002.994313"},{"key":"ref2","first-page":"33","article-title":"Genetic algorithms for the vehicle routing problem with time windows","author":"br\u00e4ysy","year":"2001","journal-title":"Arpakannus"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/b135457"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.cie.2013.10.009","article-title":"An exponential monte-carlo algorithm for feature selection problems","volume":"67","author":"salwani","year":"2014","journal-title":"Computers & Industrial Engineering"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.08.018"},{"key":"ref22","first-page":"90","article-title":"Tabu exponential monte-carlo with counter heuristic for examination timetabling","author":"nasser","year":"2009","journal-title":"2009 IEEE Symposium on Computational Intelligence in Scheduling ci-sched"},{"key":"ref21","first-page":"1","article-title":"The automatic design of hyper-heuristic framework with gene expression programming for combinatorial optimization problems","author":"sabar","year":"2014","journal-title":"Evolutionary Computation IEEE Transactions on"},{"key":"ref24","first-page":"544","article-title":"An exponential montecarlo local search algorithm for the berth allocation problem","author":"nasser","year":"2014","journal-title":"10th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2010) York UK"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10489-011-0309-9","article-title":"A graph coloring constructive hyper-heuristic for examination timetabling problems","volume":"37","author":"nasser","year":"2012","journal-title":"Applied Intelligence"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281527"},{"key":"ref25","article-title":"Population based monte carlo tree search hyper-heuristic for combinatorial optimization problems","author":"sabar","year":"2014","journal-title":"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\/07256977.pdf?arnumber=7256977","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T19:31:49Z","timestamp":1498246309000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7256977\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/cec.2015.7256977","relation":{},"subject":[],"published":{"date-parts":[[2015,5]]}}}