{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:13:13Z","timestamp":1742983993755,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031426155"},{"type":"electronic","value":"9783031426162"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-42616-2_15","type":"book-chapter","created":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T06:02:01Z","timestamp":1693461721000},"page":"201-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Elitist Non-dominated Heuristic Resolution for\u00a0the\u00a0Dynamic Asset Protection Problem"],"prefix":"10.1007","author":[{"given":"Quentin","family":"Pe\u00f1a","sequence":"first","affiliation":[]},{"given":"Aziz","family":"Moukrim","sequence":"additional","affiliation":[]},{"given":"Mehdi","family":"Serairi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105867","volume":"145","author":"A Ben-Said","year":"2022","unstructured":"Ben-Said, A., Moukrim, A., Guibadj, R.N., Verny, J.: Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows. Comput. Oper. Res. 145, 105867 (2022). https:\/\/doi.org\/10.1016\/j.cor.2022.105867","journal-title":"Comput. Oper. Res."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00500-011-0759-3","volume":"16","author":"J Cheng","year":"2012","unstructured":"Cheng, J., Zhang, G., Li, Z., Li, Y.: Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems. Soft. Comput. 16, 597\u2013614 (2012). https:\/\/doi.org\/10.1007\/s00500-011-0759-3","journal-title":"Soft. Comput."},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-29124-1_4","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"J Jemai","year":"2012","unstructured":"Jemai, J., Zekri, M., Mellouli, K.: An NSGA-II algorithm for the green vehicle routing problem. In: Hao, J.-K., Middendorf, M. (eds.) EvoCOP 2012. LNCS, vol. 7245, pp. 37\u201348. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29124-1_4"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/11740698_12","volume-title":"Artificial Evolution","author":"N Jozefowiez","year":"2006","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.-G.: Enhancements of NSGA II and its application to the vehicle routing problem with route balancing. In: Talbi, E.-G., Liardet, P., Collet, P., Lutton, E., Schoenauer, M. (eds.) EA 2005. LNCS, vol. 3871, pp. 131\u2013142. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11740698_12"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.ejor.2007.05.055","volume":"189","author":"N Jozefowiez","year":"2008","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.G.: Multi-objective vehicle routing problems. Eur. J. Oper. Res. 189(2), 293\u2013309 (2008). https:\/\/doi.org\/10.1016\/j.ejor.2007.05.055","journal-title":"Eur. J. Oper. Res."},{"key":"15_CR7","volume-title":"Microeconomic Theory","author":"A Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M.D., Green, J.R., et al.: Microeconomic Theory, vol. 1. Oxford University Press, New York (1995)"},{"key":"15_CR8","unstructured":"Merwe, M.: An optimisation approach for assigning resources to defensive tasks during wildfires. RMIT University (2015). https:\/\/researchbank.rmit.edu.au\/view\/rmit:161622"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"04","DOI":"10.1139\/cjfr-2014-0239","volume":"45","author":"M Merwe","year":"2015","unstructured":"Merwe, M., Minas, J., Ozlen, M., Hearne, J.: A mixed integer programming approach for asset protection during escaped wildfires. Can. J. For. Res. 45, 04 (2015). https:\/\/doi.org\/10.1139\/cjfr-2014-0239","journal-title":"Can. J. For. Res."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"07","DOI":"10.1007\/s10479-017-2473-8","volume":"254","author":"M Merwe","year":"2017","unstructured":"Merwe, M., Ozlen, M., Hearne, J., Minas, J.: Dynamic rerouting of vehicles during cooperative wildfire response operations. Ann. Oper. Res. 254, 07 (2017). https:\/\/doi.org\/10.1007\/s10479-017-2473-8","journal-title":"Ann. Oper. Res."},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Mirzaei, M.H., Ziarati, K., Naghibi, M.-T.: Bi-objective version of team orienteering problem (BTOP). In: 2017 7th International Conference on Computer and Knowledge Engineering (ICCKE), pp. 1\u20137 (2017). https:\/\/doi.org\/10.1109\/ICCKE.2017.8167930","DOI":"10.1109\/ICCKE.2017.8167930"},{"key":"15_CR12","unstructured":"Pareto, V.: Manual of Political Economy. Augustus M. Kelley Publishers, New York (1971)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Pe\u00f1a, Q., Serairi, M., Moukrim, A.: Reformulation and valid inequalities for the dynamic asset protection problem during an escaped wildfire (2022)","DOI":"10.2139\/ssrn.4129722"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s11721-009-0029-5","volume":"3","author":"M Schilde","year":"2009","unstructured":"Schilde, M., Doerner, K., Hartl, R., Kiechle, G.: Metaheuristics for the bi-objective orienteering problem. Swarm Intell. 3, 179\u2013201 (2009). https:\/\/doi.org\/10.1007\/s11721-009-0029-5","journal-title":"Swarm Intell."},{"issue":"4","key":"15_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999). https:\/\/doi.org\/10.1109\/4235.797969","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42616-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T06:04:10Z","timestamp":1693461850000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42616-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031426155","9783031426162"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42616-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Evolution (Evolution Artificielle)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Exeter","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ae2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ea2022.inria.fr\/index.php","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":"https:\/\/sciencesconf.org\/","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","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":"15","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":"83% - 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":"0","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)"}}]}}