乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T17:53:47Z","timestamp":1722880427317},"reference-count":48,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Swarm and Evolutionary Computation"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1016\/j.swevo.2018.10.015","type":"journal-article","created":{"date-parts":[[2018,10,31]],"date-time":"2018-10-31T10:31:37Z","timestamp":1540981897000},"page":"1018-1027","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":69,"special_numbering":"C","title":["A self-adaptive evolutionary algorithm for dynamic vehicle routing problems with traffic congestion"],"prefix":"10.1016","volume":"44","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-0276-4704","authenticated-orcid":false,"given":"Nasser R.","family":"Sabar","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9679-5706","authenticated-orcid":false,"given":"Ashish","family":"Bhaskar","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6969-7764","authenticated-orcid":false,"given":"Edward","family":"Chung","sequence":"additional","affiliation":[]},{"given":"Ayad","family":"Turky","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7579-7048","authenticated-orcid":false,"given":"Andy","family":"Song","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.swevo.2018.10.015_bib1","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","article-title":"A genetic algorithm for the vehicle routing problem","volume":"30","author":"Baker","year":"2003","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.swevo.2018.10.015_bib2","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.1030.0056","article-title":"Vehicle routing problem with time windows, part i: route construction and local search algorithms","volume":"39","author":"Br\u00e4ysy","year":"2005","journal-title":"Transport. Sci."},{"key":"10.1016\/j.swevo.2018.10.015_bib3","series-title":"Meta-heuristics","first-page":"285","article-title":"Applying the ant system to the vehicle routing problem","author":"Bullnheimer","year":"1999"},{"key":"10.1016\/j.swevo.2018.10.015_bib4","series-title":"Proceedings of the Genetic and Evolutionary Computation Conference","first-page":"1467","article-title":"A new analysis method for evolutionary optimization of dynamic and noisy objective functions","author":"Dang-Nhu","year":"2018"},{"issue":"1","key":"10.1016\/j.swevo.2018.10.015_bib5","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Manag. Sci."},{"issue":"1","key":"10.1016\/j.swevo.2018.10.015_bib6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.swevo.2011.02.001","article-title":"Parameter tuning for configuring and analyzing evolutionary algorithms","volume":"1","author":"Eiben","year":"2011","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2018.10.015_bib7","series-title":"Introduction to Evolutionary Computing","first-page":"25","article-title":"What is an evolutionary algorithm?","author":"Eiben","year":"2015"},{"key":"10.1016\/j.swevo.2018.10.015_bib8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.swevo.2018.02.014","article-title":"Information fusion in offspring generation: a case study in de and eda","volume":"42","author":"Fang","year":"2018","journal-title":"Swarm Evol. Comput."},{"issue":"1\u20132","key":"10.1016\/j.swevo.2018.10.015_bib9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10472-010-9213-y","article-title":"Analyzing bandit-based adaptive operator selection mechanisms","volume":"60","author":"Fialho","year":"2010","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.swevo.2018.10.015_bib10","series-title":"New Ideas in Optimization","article-title":"Macs-vrptw: a multiple colony system for vehicle routing problems with time windows","author":"Gambardella","year":"1999"},{"issue":"10","key":"10.1016\/j.swevo.2018.10.015_bib11","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","article-title":"A tabu search heuristic for the vehicle routing problem","volume":"40","author":"Gendreau","year":"1994","journal-title":"Manag. Sci."},{"key":"10.1016\/j.swevo.2018.10.015_bib12","series-title":"International Workshop on Ant Algorithms","first-page":"111","article-title":"Applying population based aco to dynamic optimization problems","author":"Guntsch","year":"2002"},{"key":"10.1016\/j.swevo.2018.10.015_bib13","series-title":"Adaptation in Natural and Artificial Systems: an Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"Holland","year":"1975"},{"issue":"12","key":"10.1016\/j.swevo.2018.10.015_bib14","doi-asserted-by":"crossref","first-page":"2719","DOI":"10.1109\/TCYB.2015.2487318","article-title":"Prototype generation using multiobjective particle swarm optimization for nearest neighbor classification","volume":"46","author":"Hu","year":"2016","journal-title":"IEEE Trans. Cybern."},{"issue":"2","key":"10.1016\/j.swevo.2018.10.015_bib15","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ejor.2008.07.022","article-title":"A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem","volume":"197","author":"Imran","year":"2009","journal-title":"Eur. J. Oper. Res."},{"issue":"99","key":"10.1016\/j.swevo.2018.10.015_bib16","first-page":"1","article-title":"Modified nsga-ii for solving continuous berth allocation problem: using multiobjective constraint-handling strategy","volume":"PP","author":"Ji","year":"2017","journal-title":"IEEE Trans. Cybern."},{"issue":"5","key":"10.1016\/j.swevo.2018.10.015_bib17","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.28.5.1086","article-title":"Local search for the asymmetric traveling salesman problem","volume":"28","author":"Kanellakis","year":"1980","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.swevo.2018.10.015_bib18","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/TEVC.2014.2308294","article-title":"Parameter control in evolutionary algorithms: trends and challenges","volume":"19","author":"Karafotias","year":"2015","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.swevo.2018.10.015_bib19","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.swevo.2018.03.002","article-title":"A constructive evolutionary approach for feature selection in unsupervised learning","volume":"42","author":"Martarelli","year":"2018","journal-title":"Swarm Evol. Comput."},{"issue":"99","key":"10.1016\/j.swevo.2018.10.015_bib20","first-page":"1","article-title":"Ant colony optimization with local search for dynamic traveling salesman problems","volume":"PP","author":"Mavrovouniotis","year":"2016","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.swevo.2018.10.015_bib21","series-title":"European Conference on the Applications of Evolutionary Computation","first-page":"519","article-title":"Ant colony optimization with immigrants schemes for the dynamic vehicle routing problem","author":"Mavrovouniotis","year":"2012"},{"key":"10.1016\/j.swevo.2018.10.015_bib22","series-title":"2012 IEEE Congress on Evolutionary Computation","first-page":"1","article-title":"Ant colony optimization with memory-based immigrants for the dynamic vehicle routing problem","author":"Mavrovouniotis","year":"2012"},{"key":"10.1016\/j.swevo.2018.10.015_bib23","series-title":"European Conference on the Applications of Evolutionary Computation","first-page":"606","article-title":"Adapting the pheromone evaporation rate in dynamic routing problems","author":"Mavrovouniotis","year":"2013"},{"issue":"10","key":"10.1016\/j.swevo.2018.10.015_bib24","doi-asserted-by":"crossref","first-page":"4023","DOI":"10.1016\/j.asoc.2013.05.022","article-title":"Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors","volume":"13","author":"Mavrovouniotis","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.swevo.2018.10.015_bib25","series-title":"Automated Scheduling and Planning","first-page":"283","article-title":"Dynamic vehicle routing: a memetic ant colony optimization approach","author":"Mavrovouniotis","year":"2013"},{"key":"10.1016\/j.swevo.2018.10.015_bib26","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/j.ins.2014.10.002","article-title":"Ant algorithms with immigrants schemes for the dynamic vehicle routing problem","volume":"294","author":"Mavrovouniotis","year":"2015","journal-title":"Inf. Sci."},{"issue":"4","key":"10.1016\/j.swevo.2018.10.015_bib27","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","article-title":"Ant colony system for a dynamic vehicle routing problem","volume":"10","author":"Montemanni","year":"2005","journal-title":"J. Combin. Optim."},{"key":"10.1016\/j.swevo.2018.10.015_bib28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","article-title":"Memetic algorithms and memetic computing optimization: a literature review","volume":"2","author":"Neri","year":"2012","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2018.10.015_bib29","series-title":"IJCAI","first-page":"3742","article-title":"On the runtime of randomized local search and simple evolutionary algorithms for dynamic makespan scheduling","author":"Neumann","year":"2015"},{"issue":"4","key":"10.1016\/j.swevo.2018.10.015_bib30","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","article-title":"Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem","volume":"41","author":"Osman","year":"1993","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"10.1016\/j.swevo.2018.10.015_bib31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","article-title":"A review of dynamic vehicle routing problems","volume":"225","author":"Pillac","year":"2013","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"10.1016\/j.swevo.2018.10.015_bib32","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/ijoc.1080.0312","article-title":"State-of-the art review-evolutionary algorithms for vehicle routing","volume":"21","author":"Potvin","year":"2009","journal-title":"Inf. J. Comput."},{"key":"10.1016\/j.swevo.2018.10.015_bib33","series-title":"Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation","first-page":"903","article-title":"Maintaining 2-approximations for the dynamic vertex cover problem using evolutionary algorithms","author":"Pourhassan","year":"2015"},{"key":"10.1016\/j.swevo.2018.10.015_bib34","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.swevo.2018.04.003","article-title":"Swarm intelligence for optimizing the parameters of multiple sequence aligners","volume":"42","author":"Rubio-Largo","year":"2018","journal-title":"Swarm Evol. Comput."},{"issue":"2","key":"10.1016\/j.swevo.2018.10.015_bib35","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/TEVC.2016.2602860","article-title":"Heterogeneous cooperative co-evolution memetic differential evolution algorithm for big data optimization problems","volume":"21","author":"Sabar","year":"2017","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.swevo.2018.10.015_bib36","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1109\/TEVC.2014.2319051","article-title":"Automatic design of a hyper-heuristic framework with gene expression programming for combinatorial optimization problems","volume":"19","author":"Sabar","year":"2015","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.swevo.2018.10.015_bib37","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.engappai.2017.04.021","article-title":"A memetic algorithm for real world multi-intersection traffic signal optimisation problems","volume":"63","author":"Sabar","year":"2017","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.swevo.2018.10.015_bib38","series-title":"European Conference on the Applications of Evolutionary Computation","first-page":"267","article-title":"A variable local search based memetic algorithm for the load balancing problem in cloud computing","author":"Sabar","year":"2016"},{"key":"10.1016\/j.swevo.2018.10.015_bib39","series-title":"Pacific Rim International Conference on Artificial Intelligence","first-page":"406","article-title":"A multi-memory multi-population memetic algorithm for dynamic shortest path routing in mobile ad-hoc networks","author":"Sabar","year":"2016"},{"issue":"3","key":"10.1016\/j.swevo.2018.10.015_bib40","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1162\/EVCO_a_00006","article-title":"Self-adaptation of mutation operator and probability for permutation representations in genetic algorithms","volume":"18","author":"Serpell","year":"2010","journal-title":"Evol. Comput."},{"key":"10.1016\/j.swevo.2018.10.015_bib41","series-title":"Handbook of Memetic Algorithms","first-page":"167","article-title":"Self-adaptative and coevolving memetic algorithms","author":"Smith","year":"2012"},{"key":"10.1016\/j.swevo.2018.10.015_bib42","series-title":"Evolutionary Computation, 1997., IEEE International Conference on","first-page":"309","article-title":"Max-min ant system and local search for the traveling salesman problem","author":"Stutzle","year":"1997"},{"key":"10.1016\/j.swevo.2018.10.015_bib43","series-title":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","first-page":"999","article-title":"Use of explicit memory in the dynamic traveling salesman problem","author":"Tin\u00f3s","year":"2014"},{"key":"10.1016\/j.swevo.2018.10.015_bib44","volume":"vol. 18","author":"Toth","year":"2014"},{"key":"10.1016\/j.swevo.2018.10.015_bib45","doi-asserted-by":"crossref","first-page":"1926","DOI":"10.1016\/j.procs.2014.05.177","article-title":"A hybrid harmony search algorithm for solving dynamic optimisation problems","volume":"29","author":"Turky","year":"2014","journal-title":"Procedia Comput. Sci."},{"issue":"1","key":"10.1016\/j.swevo.2018.10.015_bib46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","article-title":"Heuristics for multi-attribute vehicle routing problems: a survey and synthesis","volume":"231","author":"Vidal","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.swevo.2018.10.015_bib47","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.swevo.2018.02.017","article-title":"Discrete comprehensive learning particle swarm optimization algorithm with metropolis acceptance criterion for traveling salesman problem","volume":"42","author":"Zhong","year":"2018","journal-title":"Swarm Evol. Comput."},{"issue":"99","key":"10.1016\/j.swevo.2018.10.015_bib48","first-page":"1","article-title":"Adaptive differential evolution with sorting crossover rate for continuous optimization problems","volume":"PP","author":"Zhou","year":"2017","journal-title":"IEEE Trans. Cybern."}],"container-title":["Swarm and Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650218303407?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650218303407?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,3]],"date-time":"2019-01-03T19:56:14Z","timestamp":1546545374000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2210650218303407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":48,"alternative-id":["S2210650218303407"],"URL":"https:\/\/doi.org\/10.1016\/j.swevo.2018.10.015","relation":{},"ISSN":["2210-6502"],"issn-type":[{"value":"2210-6502","type":"print"}],"subject":[],"published":{"date-parts":[[2019,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A self-adaptive evolutionary algorithm for dynamic vehicle routing problems with traffic congestion","name":"articletitle","label":"Article Title"},{"value":"Swarm and Evolutionary Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.swevo.2018.10.015","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}