{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:20:24Z","timestamp":1743006024717,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030637989"},{"type":"electronic","value":"9783030637996"}],"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-63799-6_15","type":"book-chapter","created":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T00:56:03Z","timestamp":1607388963000},"page":"187-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Metaheuristic Search Technique for Solving the Warehouse Stock Management Problem and the Routing Problem in a Real Company"],"prefix":"10.1007","author":[{"given":"Christian","family":"Perez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4835-4057","authenticated-orcid":false,"given":"Miguel A.","family":"Salido","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Gurrea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,8]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Barkaoui, M., Gendreau, M.: An adaptive evolutionary approach for real-time vehicle routing and dispatching. Computers & Operations Research 40(7), 1766\u20131776 (2013). https:\/\/doi.org\/10.1016\/j.cor.2013.01.022, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054813000300","DOI":"10.1016\/j.cor.2013.01.022"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Burkard, R., Dell\u2019Amico, M., Martello, S.: Assignment Problems. SIAM - Society of Industrial and Applied Mathematics, 1 edn., 382 Seiten (2009)","DOI":"10.1137\/1.9780898717754"},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Cao, E., Lai, M., Yang, H.: Open vehicle routing problem with demand uncertainty and its robust strategies. Expert Syst. Appl. 41(7), 3569\u20133575 (2014). https:\/\/doi.org\/10.1016\/j.eswa.2013.11.004, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417413009044","DOI":"10.1016\/j.eswa.2013.11.004"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Current, J., Marsh, M.: Multiobjective transportation network design and routing problems: taxonomy and annotation. Euro. J. Oper. Res. 65(1), 4\u201319 (1993). https:\/\/doi.org\/10.1016\/0377-2217(93)90140-I, http:\/\/www.sciencedirect.com\/science\/article\/pii\/037722179390140I","DOI":"10.1016\/0377-2217(93)90140-I"},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Eksioglu, B., Vural, A.V., Reisman, A.: The vehicle routing problem: a taxonomic review. Comput. Ind. Eng. 57(4), 1472\u20131483 (2009). https:\/\/doi.org\/10.1016\/j.cie.2009.05.009, http:\/\/dx.doi.org\/10.1016\/j.cie.2009.05.009","DOI":"10.1016\/j.cie.2009.05.009"},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Li, X., Leung, S.C.H., Tian, P.: A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem. Expert Syst. Appl. 39(1), 365\u2013374 (2012). https:\/\/doi.org\/10.1016\/j.eswa.2011.07.025, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417411009870","DOI":"10.1016\/j.eswa.2011.07.025"},{"key":"15_CR7","first-page":"1","volume":"0000","author":"Y Li","year":"1991","unstructured":"Li, Y., Pardalos, P.M., Resende, M.G.C.: A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem 0000, 1\u201321 (1991)","journal-title":"A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"L\u00f3pez-S\u00e1nchez, A.D., Hern\u00e1ndez-D\u00edaz, A.G., Vigo, D., Caballero, R., Molina, J.: A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem. Euro. J. Oper. Res. 238(1), 104\u2013113 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2014.04.008, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221714003178","DOI":"10.1016\/j.ejor.2014.04.008"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Pillac, V., Gendreau, M., Gu\u00e9ret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. European J. Oper. Res. 225(1), 1\u201311 (2013). https:\/\/doi.org\/10.1016\/j.ejor.2012.08.015, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221712006388","DOI":"10.1016\/j.ejor.2012.08.015"},{"key":"15_CR10","doi-asserted-by":"publisher","unstructured":"Salari, M., Toth, P., Tramontani, A.: An ILP improvement procedure for the open vehicle routing problem. Comput. Oper. Res. 37(12), 2106\u20132120 (2010). https:\/\/doi.org\/10.1016\/j.cor.2010.02.010, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054810000547","DOI":"10.1016\/j.cor.2010.02.010"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10), 2519\u20132531 (2013). https:\/\/doi.org\/10.1016\/j.cor.2013.01.013, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S030505481300021X","DOI":"10.1016\/j.cor.2013.01.013"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Syed-abdullah, S.S., Abdul-rahman, S., Mauziah, A.: Solving Quadratic Assignment Problem with Fixed Assignment ( QAPFA ) using Branch and Bound Approach Solving Quadratic Assignment Problem with Fixed Assignment ( QAPFA ) using Branch and Bound Approach (2018). https:\/\/doi.org\/10.1088\/1757-899X\/300\/1\/012002","DOI":"10.1088\/1757-899X\/300\/1\/012002"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence XXXVII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-63799-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T01:01:37Z","timestamp":1607389297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-63799-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030637989","9783030637996"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-63799-6_15","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":"8 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SGAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Innovative Techniques and Applications of Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sgai2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/bcs-sgai.org\/ai2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}