{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:09:14Z","timestamp":1742965754371,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581145"},{"type":"electronic","value":"9783030581152"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58115-2_30","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:02:51Z","timestamp":1598997771000},"page":"428-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Towards Novel Meta-heuristic Algorithms for Dynamic Capacitated Arc Routing Problems"],"prefix":"10.1007","author":[{"given":"Hao","family":"Tong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leandro L.","family":"Minku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Menzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Sendhoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"issue":"4","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1016\/j.cor.2006.07.007","volume":"35","author":"J Brand\u00e3o","year":"2008","unstructured":"Brand\u00e3o, J., Eglese, R.: A deterministic tabu search algorithm for the capacitated arc routing problem. Comput. Oper. Res. 35(4), 1112\u20131126 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"30_CR2","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part ii: the rural postman problem. Oper. Res. 43(3), 399\u2013414 (1995)","journal-title":"Oper. Res."},{"issue":"1","key":"30_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0305-0548(83)90026-6","volume":"10","author":"BL Golden","year":"1983","unstructured":"Golden, B.L., DeArmon, J.S., Baker, E.K.: Computational experiments with algorithms for a class of routing problems. Comput. Oper. Res. 10(1), 47\u201359 (1983)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"30_CR4","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/net.3230110308","volume":"11","author":"BL Golden","year":"1981","unstructured":"Golden, B.L., Wong, R.T.: Capacitated arc routing problems. Networks 11(3), 305\u2013315 (1981)","journal-title":"Networks"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Handa, H., Chapman, L., Yao, X.: Dynamic salting route optimisation using evolutionary computation. In: 2005 IEEE Congress on Evolutionary Computation, vol. 1, pp. 158\u2013165. IEEE (2005)","DOI":"10.1109\/CEC.2005.1554680"},{"issue":"1","key":"30_CR6","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/MCI.2006.1597056","volume":"1","author":"H Handa","year":"2006","unstructured":"Handa, H., Chapman, L., Yao, X.: Robust route optimization for gritting\/salting trucks: a CERCIA experience. IEEE Comput. Intell. Mag. 1(1), 6\u20139 (2006)","journal-title":"IEEE Comput. Intell. Mag."},{"issue":"2","key":"30_CR7","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.ejor.2004.04.021","volume":"165","author":"P Lacomme","year":"2005","unstructured":"Lacomme, P., Prins, C., Ramdane-Ch\u00e9rif, W.: Evolutionary algorithms for periodic arc routing problems. Eur. J. Oper. Res. 165(2), 535\u2013553 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"30_CR8","first-page":"217","volume":"47","author":"LY Li","year":"1996","unstructured":"Li, L.Y., Eglese, R.W.: An interactive algorithm for vehicle routeing for winter\u2013gritting. J. Oper. Res. Soc. 47(2), 217\u2013228 (1996)","journal-title":"J. Oper. Res. Soc."},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Liu, M., Singh, H.K., Ray, T.: A benchmark generator for dynamic capacitated arc routing problems. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 579\u2013586. IEEE (2014)","DOI":"10.1109\/CEC.2014.6900232"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Liu, M., Singh, H.K., Ray, T.: A memetic algorithm with a new split scheme for solving dynamic capacitated arc routing problems. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 595\u2013602. IEEE (2014)","DOI":"10.1109\/CEC.2014.6900358"},{"issue":"3","key":"30_CR11","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1109\/TEVC.2013.2281503","volume":"18","author":"Y Mei","year":"2013","unstructured":"Mei, Y., Li, X., Yao, X.: Cooperative coevolution with route distance grouping for large-scale capacitated arc routing problems. IEEE Trans. Evol. Comput. 18(3), 435\u2013449 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Mei, Y., Tang, K., Yao, X.: A global repair operator for capacitated arc routing problem. IEEE Trans. Syst. Man Cybern. B Cybern. 39(3), 723\u2013734 (2009)","DOI":"10.1109\/TSMCB.2008.2008906"},{"issue":"6","key":"30_CR13","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1111\/itor.12346","volume":"24","author":"M Monroy-Licht","year":"2017","unstructured":"Monroy-Licht, M., Amaya, C.A., Langevin, A., Rousseau, L.M.: The rescheduling arc routing problem. Int. Trans. Oper. Res. 24(6), 1325\u20131346 (2017)","journal-title":"Int. Trans. Oper. Res."},{"key":"30_CR14","volume-title":"Artificial Intelligence: A Modern Approach","author":"S Russell","year":"2010","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice Hall, Upper Saddle River (2010)","edition":"3"},{"issue":"1","key":"30_CR15","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.trc.2010.02.003","volume":"19","author":"M Tagmouti","year":"2011","unstructured":"Tagmouti, M., Gendreau, M., Potvin, J.Y.: A dynamic capacitated arc routing problem with time-dependent service costs. Transp. Res. Part C Emerg. Technol. 19(1), 20\u201328 (2011)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"issue":"5","key":"30_CR16","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1109\/TEVC.2009.2023449","volume":"13","author":"K Tang","year":"2009","unstructured":"Tang, K., Mei, Y., Yao, X.: Memetic algorithm with extended neighborhood search for capacitated arc routing problems. IEEE Trans. Evol. Comput. 13(5), 1151\u20131166 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"11","key":"30_CR17","doi-asserted-by":"publisher","first-page":"3928","DOI":"10.1109\/TCYB.2016.2590558","volume":"47","author":"K Tang","year":"2016","unstructured":"Tang, K., Wang, J., Li, X., Yao, X.: A scalable approach to capacitated arc routing problems based on hierarchical decomposition. IEEE Trans. Cybern. 47(11), 3928\u20133940 (2016)","journal-title":"IEEE Trans. Cybern."},{"issue":"3","key":"30_CR18","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0377-2217(85)90252-8","volume":"22","author":"G Ulusoy","year":"1985","unstructured":"Ulusoy, G., et al.: The fleet size and mix problem for capacitated arc routing. Eur. J. Oper. Res. 22(3), 329\u2013337 (1985)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"30_CR19","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1109\/TEVC.2009.2033578","volume":"14","author":"L Xing","year":"2009","unstructured":"Xing, L., Rohlfshagen, P., Chen, Y., Yao, X.: An evolutionary approach to the multidepot capacitated arc routing problem. IEEE Trans. Evol. Comput. 14(3), 356\u2013374 (2009)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58115-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T00:45:36Z","timestamp":1723509936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"268","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"99","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}