{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T21:09:54Z","timestamp":1771103394181,"version":"3.50.1"},"reference-count":60,"publisher":"Informa UK Limited","issue":"22","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Production Research"],"published-print":{"date-parts":[[2023,11,17]]},"DOI":"10.1080\/00207543.2022.2162145","type":"journal-article","created":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T12:53:28Z","timestamp":1673009608000},"page":"7727-7748","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":7,"title":["A decomposition approach for the periodic consistent vehicle routeing problem with an application in the cleaning sector"],"prefix":"10.1080","volume":"61","author":[{"given":"Bilal","family":"Messaoudi","sequence":"first","affiliation":[{"name":"University of Lorraine, LORIA laboratory, Vandoeuvre-les-Nancy, France"},{"name":"Antsway SA, ARTEM, Nancy, France"}]},{"given":"Ammar","family":"Oulamara","sequence":"additional","affiliation":[{"name":"University of Lorraine, LORIA laboratory, Vandoeuvre-les-Nancy, France"},{"name":"Antsway SA, ARTEM, Nancy, France"},{"name":"Centre for Logistics & Heuristic Optimisation (CLHO), Kent Business School, University of Kent, Canterbury, UK"}]},{"given":"Said","family":"Salhi","sequence":"additional","affiliation":[{"name":"Centre for Logistics & Heuristic Optimisation (CLHO), Kent Business School, University of Kent, Canterbury, UK"}]}],"member":"301","published-online":{"date-parts":[[2023,1,6]]},"reference":[{"key":"e_1_3_4_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.03.063"},{"key":"e_1_3_4_3_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2011.153"},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.03.008"},{"key":"e_1_3_4_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.05.021"},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0875"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.538"},{"key":"e_1_3_4_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/(ISSN)1097-0037"},{"key":"e_1_3_4_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/inte.33.1.67.12722"},{"key":"e_1_3_4_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2016.09.010"},{"key":"e_1_3_4_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21544"},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.07.030"},{"key":"e_1_3_4_13_1","doi-asserted-by":"publisher","DOI":"10.1057\/s41274-017-0206-7"},{"key":"e_1_3_4_14_1","doi-asserted-by":"crossref","unstructured":"Carotenuto P. S. Giordani S. Massari and F. Vagaggini. 2018. \u201cA Multi-Depot Periodic Vehicle Routing Model for Petrol Station Replenishment.\u201d In Advanced Concepts Methodologies and Technologies for Transportation and Logistics edited by \u017bak J. Y. Hadas and R. Rossi 421\u2013437.","DOI":"10.1007\/978-3-319-57105-8_21"},{"key":"e_1_3_4_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/(ISSN)1097-0037"},{"key":"e_1_3_4_16_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2009.154"},{"key":"e_1_3_4_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/(ISSN)1097-0037"},{"key":"e_1_3_4_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2019.0899"},{"key":"e_1_3_4_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v63.3"},{"key":"e_1_3_4_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0140"},{"issue":"0","key":"e_1_3_4_21_1","first-page":"1","article-title":"Integrated Production-Inventory-Routing Problem for Multi-Perishable Products under Uncertainty by Meta-Heuristic Algorithms","volume":"0","author":"Ghasemkhani A.","year":"2021","unstructured":"Ghasemkhani, A., R. Tavakkoli-Moghaddam, Y. Rahimi, S. Shahnejat-Bushehri, and H. Tavakkoli-Moghaddam. 2021. \u201cIntegrated Production-Inventory-Routing Problem for Multi-Perishable Products under Uncertainty by Meta-Heuristic Algorithms.\u201d International Journal of Production Research 0 (0): 1\u201321.","journal-title":"International Journal of Production Research"},{"key":"e_1_3_4_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2018.0864"},{"key":"e_1_3_4_23_1","unstructured":"Google. 2018. \u201cDistance Matrix API.\u201d Accessed October 30 2018. https:\/\/developers.google.com\/maps\/documentation\/distance-matrix\/start."},{"key":"e_1_3_4_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/msom.1080.0243"},{"key":"e_1_3_4_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.08.048"},{"key":"e_1_3_4_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.12.036"},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1292062"},{"key":"e_1_3_4_28_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_4_29_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0529"},{"key":"e_1_3_4_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21522"},{"key":"e_1_3_4_31_1","doi-asserted-by":"publisher","DOI":"10.1134\/S199047892002012X"},{"key":"e_1_3_4_32_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"e_1_3_4_33_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1070969"},{"key":"e_1_3_4_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.12.019"},{"key":"e_1_3_4_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.12.064"},{"key":"e_1_3_4_36_1","doi-asserted-by":"crossref","unstructured":"Matos A. C. and R. C. Oliveira. 2004. \u201cAn Experimental Study of the Ant Colony System for the Period Vehicle Routing Problem.\u201d In Ant Colony Optimization and Swarm Intelligence 286\u2013293. Berlin Heidelberg: Springer.","DOI":"10.1007\/978-3-540-28646-2_26"},{"key":"e_1_3_4_37_1","doi-asserted-by":"crossref","unstructured":"Messaoudi B. A. Oulamara and N. Rahmani. 2019. \u201cMultiple Periods Vehicle Routing Problems: A Case Study.\u201d In Evolutionary Computation in Combinatorial Optimization edited by A. Liefooghe and L. Paquete 83\u201398. Cham: Springer International Publishing \u2013 LNCS (11452).","DOI":"10.1007\/978-3-030-16711-0_6"},{"key":"e_1_3_4_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-021-04488-0"},{"key":"e_1_3_4_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.02.030"},{"key":"e_1_3_4_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-014-9244-3"},{"key":"e_1_3_4_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.08.032"},{"key":"e_1_3_4_42_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602449"},{"key":"e_1_3_4_43_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0135"},{"key":"e_1_3_4_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.09.004"},{"key":"e_1_3_4_45_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2018.0855"},{"key":"e_1_3_4_46_1","doi-asserted-by":"publisher","DOI":"10.1002\/(ISSN)1097-0037"},{"key":"e_1_3_4_47_1","doi-asserted-by":"publisher","DOI":"10.1002\/(ISSN)1097-0037"},{"key":"e_1_3_4_48_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1945-1474.2011.00131.x"},{"key":"e_1_3_4_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49355-8"},{"key":"e_1_3_4_50_1","doi-asserted-by":"crossref","unstructured":"Schubert E. and P. J. Rousseeuw. 2019. \u201cFaster k-Medoids Clustering: Improving the PAM CLARA and CLARANS Algorithms.\u201d In International Conference on Similarity Search and Applications 171\u2013187. Springer.","DOI":"10.1007\/978-3-030-32047-8_16"},{"key":"e_1_3_4_51_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1120.0407"},{"key":"e_1_3_4_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105644"},{"key":"e_1_3_4_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.09.046"},{"key":"e_1_3_4_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.09.111"},{"key":"e_1_3_4_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2005.07.009"},{"key":"e_1_3_4_56_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594"},{"key":"e_1_3_4_57_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1048"},{"key":"e_1_3_4_58_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.10.010"},{"key":"e_1_3_4_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100675"},{"key":"e_1_3_4_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.07.007"},{"key":"e_1_3_4_61_1","doi-asserted-by":"crossref","unstructured":"Zajac S. 2017. \u201cAn Adaptive Large Neighborhood Search for the Periodic Vehicle Routing Problem.\u201d In Computational Logistics edited by T. Bekta\u015f S. Coniglio A. Martinez-Sykora and S. Vo\u00df 34\u201348. Springer International Publishing.","DOI":"10.1007\/978-3-319-68496-3_3"}],"container-title":["International Journal of Production Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207543.2022.2162145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T06:39:23Z","timestamp":1708065563000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207543.2022.2162145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,6]]},"references-count":60,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2023,11,17]]}},"alternative-id":["10.1080\/00207543.2022.2162145"],"URL":"https:\/\/doi.org\/10.1080\/00207543.2022.2162145","relation":{},"ISSN":["0020-7543","1366-588X"],"issn-type":[{"value":"0020-7543","type":"print"},{"value":"1366-588X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,6]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-10-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-29","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-01-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}