{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T08:56:29Z","timestamp":1786092989784,"version":"3.56.0"},"reference-count":53,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"vor","delay-in-days":1329,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Transportation and Logistics"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s13676-015-0085-5","type":"journal-article","created":{"date-parts":[[2015,3,30]],"date-time":"2015-03-30T18:42:58Z","timestamp":1427740978000},"page":"81-109","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":208,"title":["Optimization of a city logistics transportation system with mixed passengers and goods"],"prefix":"10.1016","volume":"6","author":[{"given":"Renaud","family":"Masson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anna","family":"Trentini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabien","family":"Lehu\u00e9d\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Malh\u00e9n\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olivier","family":"P\u00e9ton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Houda","family":"Tlahig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1007\/s13676-015-0085-5_bib1","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/opre.1100.0881","article-title":"An exact algorithm for the pickup and delivery problem with time windows","volume":"59","author":"Baldacci","year":"2011","journal-title":"Operations Research"},{"key":"10.1007\/s13676-015-0085-5_bib2","unstructured":"Cattaruzza, D., Absi, N., Feillet, D., Guyon, O., Libeaut, X., August 2013. The multi trip vehicle routing problem with time windows and release dates. In: Proceedings of the 10th Metaheuristics International Conference (MIC 2013). pp. 1\u201310"},{"key":"10.1007\/s13676-015-0085-5_bib3","doi-asserted-by":"crossref","unstructured":"Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M., Soumis, F., 2002. VRP with time windows. In: Toth, P., Vigo, D. (Eds.), The Vehicle Routing Problem. Society Industrial and Applied Mathematics, pp. 157\u2013193","DOI":"10.1137\/1.9780898718515.ch7"},{"key":"10.1007\/s13676-015-0085-5_bib4","doi-asserted-by":"crossref","first-page":"178","DOI":"10.3141\/1783-22","article-title":"Design and operational concepts of high-coverage point-to-point transit system","volume":"1783","author":"Cort\u00e9s","year":"2002","journal-title":"Transportation Research Record"},{"issue":"3","key":"10.1007\/s13676-015-0085-5_bib5","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/j.ejor.2009.01.022","article-title":"The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method","volume":"200","author":"Cort\u00e9s","year":"2010","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1007\/s13676-015-0085-5_bib6","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(99)00233-7","article-title":"Service network design in freight transportation","volume":"122","author":"Crainic","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1007\/s13676-015-0085-5_bib7","unstructured":"Crainic, T. G., Errico, F., Rei, W., Ricciardi, N., 2012a. Modeling demand uncertainty in two-tiered city logistics planning. Les cahiers du CIRRELT (CIRRELT-2012-65)"},{"key":"10.1007\/s13676-015-0085-5_bib8","unstructured":"Crainic, T. G., Gajpal, Y., Gendreau, M., 2012b. Multi-zone multi-trip vehicle routing problem with time windows. Les cahiers du CIRRELT (CIRRELT-2012-36)"},{"key":"10.1007\/s13676-015-0085-5_bib9","doi-asserted-by":"crossref","unstructured":"Crainic TG, Mancini S, Perboli G, Tadei R (2011) Multi-start heuristics for the two-echelon vehicle routing problem. In: Merz P, Hao J-K (eds) Evolutionary Computation in Combinatorial Optimization, vol 6622., Lecture Notes in Computer ScienceSpringer, Berlin Heidelberg, pp 179\u2013190","DOI":"10.1007\/978-3-642-20364-0_16"},{"key":"10.1007\/s13676-015-0085-5_bib10","doi-asserted-by":"crossref","unstructured":"Crainic TG, N., R., Storchi, G. (2009) Models for evaluation and planning city logistics systems. Transportation Science 43(4):432\u2013454","DOI":"10.1287\/trsc.1090.0279"},{"issue":"3","key":"10.1007\/s13676-015-0085-5_bib11","doi-asserted-by":"crossref","first-page":"5944","DOI":"10.1016\/j.sbspro.2010.04.009","article-title":"Two-echelon vehicle routing problem: A satellite location analysis","volume":"2","author":"Crainic","year":"2010","journal-title":"Procedia - Social and Behavioral Sciences"},{"issue":"4","key":"10.1007\/s13676-015-0085-5_bib12","doi-asserted-by":"crossref","first-page":"1375","DOI":"10.1007\/s11590-013-0662-1","article-title":"Service network design models for two-tier city logistics","volume":"8","author":"Crainic","year":"2014","journal-title":"Optimization Letters"},{"key":"10.1007\/s13676-015-0085-5_bib13","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","article-title":"New optimization heuristics: The great deluge algorithm and the record-to-record travel","volume":"104","author":"Dueck","year":"1993","journal-title":"Journal of Computational Physics"},{"key":"10.1007\/s13676-015-0085-5_bib14","unstructured":"European Commission, Directorate-General for Energy and Transport (2007) Towards a New Culture for Urban Mobility. Office for Official Publications of the European Communities"},{"key":"10.1007\/s13676-015-0085-5_bib15","doi-asserted-by":"crossref","unstructured":"Feillet, D., 2010. A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR 8 (4), 407\u2013424","DOI":"10.1007\/s10288-010-0130-z"},{"issue":"3","key":"10.1007\/s13676-015-0085-5_bib16","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","article-title":"An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems","volume":"44","author":"Feillet","year":"2004","journal-title":"Networks"},{"issue":"3","key":"10.1007\/s13676-015-0085-5_bib17","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/j.ejor.2007.10.055","article-title":"Solving a school bus scheduling problem with integer programming","volume":"193","author":"Fugenschuh","year":"2009","journal-title":"European Journal of Operational Research"},{"key":"10.1007\/s13676-015-0085-5_bib18","series-title":"A mixed passengers-goods transportation network for territories with a low population density","author":"Gonguet","year":"2014"},{"key":"10.1007\/s13676-015-0085-5_bib19","doi-asserted-by":"crossref","unstructured":"G\u00f8rtz, I. L., Nagarajan, V., Ravi, R., 2009. Minimum makespan multi-vehicle dial-a-ride. In: Proceedings of the 17th ESA, Copenhagen, Denmark. Lecture Notes in CS. Vol. 5757. pp. 540\u2013552","DOI":"10.1007\/978-3-642-04128-0_48"},{"key":"10.1007\/s13676-015-0085-5_bib20","unstructured":"Grangier, P., Gendreau, M., Lehu\u00e9d\u00e9, F., Rousseau, L.-M., 2014. An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. Les cahiers du CIRRELT (CIRRELT-2014-33)"},{"issue":"12","key":"10.1007\/s13676-015-0085-5_bib21","doi-asserted-by":"crossref","first-page":"3215","DOI":"10.1016\/j.cor.2012.04.007","article-title":"An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics","volume":"39","author":"Hemmelmayr","year":"2012","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1007\/s13676-015-0085-5_bib22","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1287\/trsc.1110.0399","article-title":"A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem","volume":"47","author":"Jepsen","year":"2012","journal-title":"Transportation Science"},{"issue":"2","key":"10.1007\/s13676-015-0085-5_bib23","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1504\/EJIE.2008.017347","article-title":"The splittable pickup and delivery problem with reloads","volume":"2","author":"Kerivin","year":"2008","journal-title":"European Journal of Industrial Engineering"},{"key":"10.1007\/s13676-015-0085-5_bib24","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"issue":"1","key":"10.1007\/s13676-015-0085-5_bib25","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2014.03.003","article-title":"The share-a-ride problem: People and parcels sharing taxis","volume":"238","author":"Li","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1007\/s13676-015-0085-5_bib26","unstructured":"Masson, R., Lehu\u00e9d\u00e9, F., P\u00e9ton, O., 2012a. An adaptive large neighborhood search for the pickup and delivery problem with transfers. Transportation Science articles in advance, 1\u201312"},{"key":"10.1007\/s13676-015-0085-5_bib27","unstructured":"Masson, R., Lehu\u00e9d\u00e9, F., P\u00e9ton, O., 2012b. The dial-a-ride problem with transfers. Computers and Operations Research submitted"},{"key":"10.1007\/s13676-015-0085-5_bib28","doi-asserted-by":"crossref","unstructured":"Masson, R., Lehu\u00e9d\u00e9, F., P\u00e9ton, O., 2012c. Simple temporal problems in route scheduling for the dial-a-ride problem with transfers. In: Beldiceanu, N., Jussien, N., Pinson, E. (Eds.), Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Vol. 7298 of LNCS. Springer, pp. 275\u2013291","DOI":"10.1007\/978-3-642-29828-8_18"},{"issue":"3","key":"10.1007\/s13676-015-0085-5_bib29","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.orl.2013.01.007","article-title":"Efficient feasibility testing for request insertion in the Pickup and Delivery Problem with Transfers","volume":"41","author":"Masson","year":"2013","journal-title":"Operations Research Letters"},{"key":"10.1007\/s13676-015-0085-5_bib30","doi-asserted-by":"crossref","unstructured":"Masson, R., Ropke, S., Lehu\u00e9d\u00e9, F., P\u00e9ton, O., 2013b. A branch-and-cut-and-price for the pickup and delivery problem with shuttles routes. European Journal of Operational Research submitted","DOI":"10.1016\/j.ejor.2013.08.042"},{"key":"10.1007\/s13676-015-0085-5_bib31","doi-asserted-by":"crossref","unstructured":"Mendoza, J. E., 2011. Solving real-world vehicle routing problems in uncertain environments. 4OR 9 (3), 321\u2013324","DOI":"10.1007\/s10288-010-0146-4"},{"issue":"3","key":"10.1007\/s13676-015-0085-5_bib32","first-page":"217","article-title":"The pickup and delivery problem with time windows and transshipment","volume":"44","author":"Mitrovi\u0107-Mini\u0107","year":"2006","journal-title":"INFOR"},{"issue":"1","key":"10.1007\/s13676-015-0085-5_bib33","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.ejor.2013.05.026","article-title":"A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows","volume":"231","author":"Nguyen","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"10.1007\/s13676-015-0085-5_bib34","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/j.endm.2010.05.081","article-title":"New families of valid inequalities for the two-echelon vehicle routing problem","volume":"36","author":"Perboli","year":"2010","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"3","key":"10.1007\/s13676-015-0085-5_bib35","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1287\/trsc.1110.0368","article-title":"The two-echelon capacitated vehicle routing problem: Models and math-based heuristics","volume":"45","author":"Perboli","year":"2011","journal-title":"Transportation Science"},{"key":"10.1007\/s13676-015-0085-5_bib36","doi-asserted-by":"crossref","unstructured":"Petersen, H. L., Ropke, S., 2011. The pickup and delivery problem with cross-docking opportunity. In: Proceedings of the Second international conference on Computational logistics. ICCL\u201911. Springer-Verlag, Berlin, Heidelberg, pp. 101\u2013113","DOI":"10.1007\/978-3-642-24264-9_8"},{"issue":"8","key":"10.1007\/s13676-015-0085-5_bib37","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","author":"Pisinger","year":"2007","journal-title":"Computers and Operations Research"},{"issue":"8","key":"10.1007\/s13676-015-0085-5_bib38","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","author":"Pisinger","year":"2007","journal-title":"Computers & Operations Research"},{"key":"10.1007\/s13676-015-0085-5_bib39","doi-asserted-by":"crossref","unstructured":"Pisinger D, Ropke S (2010) Large neighborhood search. In: Gendreau M, Potvin J-Y (eds) Handbook of Metaheuristics, vol 146., International Series in Operations Research & Management ScienceSpringer, US, pp 399\u2013419","DOI":"10.1007\/978-1-4419-1665-5_13"},{"issue":"10","key":"10.1007\/s13676-015-0085-5_bib40","doi-asserted-by":"crossref","first-page":"2439","DOI":"10.1016\/j.cor.2011.11.016","article-title":"A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment","volume":"39","author":"Qu","year":"2012","journal-title":"Computers & Operations Research"},{"key":"10.1007\/s13676-015-0085-5_bib41","doi-asserted-by":"crossref","unstructured":"Roberti, R., Jun. 2012. Exact algorithms for different classes of vehicle routing problems. Ph.D. thesis, University of Bologna","DOI":"10.1007\/s10288-012-0206-z"},{"issue":"3","key":"10.1007\/s13676-015-0085-5_bib42","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.1090.0272","article-title":"Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows","volume":"43","author":"Ropke","year":"2009","journal-title":"Transportation Science"},{"key":"10.1007\/s13676-015-0085-5_bib43","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","volume":"40","author":"Ropke","year":"2006","journal-title":"Transportation Science"},{"issue":"3","key":"10.1007\/s13676-015-0085-5_bib44","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.ejor.2004.09.004","article-title":"A unified heuristic for a large class of vehicle routing problems with backhauls","volume":"171","author":"Ropke","year":"2006","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1007\/s13676-015-0085-5_bib45","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","article-title":"The vehicle routing problem with time windows: Minimizing route duration","volume":"4","author":"Savelsbergh","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1007\/s13676-015-0085-5_bib46","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jcph.1999.6413","article-title":"Record breaking optimization results using the ruin and recreate principle","volume":"159","author":"Schrimpf","year":"2000","journal-title":"Journal of Computational Physics"},{"key":"10.1007\/s13676-015-0085-5_bib47","unstructured":"Shaefer, C., Dalkmann, H., October 2003. Multibus - a new and innovative approach for bus systems in rural areas. European Transport Conference, Strasbourg, France"},{"issue":"4","key":"10.1007\/s13676-015-0085-5_bib48","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/0360-8352(95)00181-6","article-title":"Multicriteria pickup and delivery problem with transfer opportunity","volume":"30","author":"Shang","year":"1996","journal-title":"Computers & Industrial Engineering"},{"key":"10.1007\/s13676-015-0085-5_bib49","doi-asserted-by":"crossref","unstructured":"Shaw, P., 1998. Using constraint programming and local search methods to solve vehicle routing problems. In: Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming. pp. 417\u2013431","DOI":"10.1007\/3-540-49481-2_30"},{"key":"10.1007\/s13676-015-0085-5_bib50","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1287\/trsc.12.3.232","article-title":"Scheduling dial-a-ride transportation systems","volume":"12","author":"Stein","year":"1978","journal-title":"Transportation Science"},{"key":"10.1007\/s13676-015-0085-5_bib51","doi-asserted-by":"crossref","first-page":"38","DOI":"10.3280\/TR2011-059006","article-title":"Shared passengers & goods urban transport solutions: new ideas for milan through en international comparison","volume":"59","author":"Trentini","year":"2011","journal-title":"Territorio"},{"key":"10.1007\/s13676-015-0085-5_bib52","unstructured":"Trentini A, Malh\u00e9n\u00e9 N (2010) Toward a shared urban transport system ensuring passengers & goods cohabitation. TeMA 3(2):"},{"issue":"1","key":"10.1007\/s13676-015-0085-5_bib53","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s00291-007-0079-2","article-title":"Service network design for freight transportation: a review","volume":"30","author":"Wieberneit","year":"2008","journal-title":"OR Spectrum"}],"container-title":["EURO Journal on Transportation and Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-015-0085-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13676-015-0085-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S219243762030090X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S219243762030090X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-015-0085-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-015-0085-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:43:14Z","timestamp":1761882194000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S219243762030090X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["S219243762030090X"],"URL":"https:\/\/doi.org\/10.1007\/s13676-015-0085-5","relation":{},"ISSN":["2192-4376"],"issn-type":[{"value":"2192-4376","type":"print"}],"subject":[],"published":{"date-parts":[[2017,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimization of a city logistics transportation system with mixed passengers and goods","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Transportation and Logistics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13676-015-0085-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 THE AUTHORS. Published by Elsevier on behalf of the Association of European Operational Research Societies (EURO). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}