The Shared Customer Collaboration Vehicle Routing Problem

•We introduce the Shared Customer Collaboration Vehicle Routing Problem.•There are potential savings when carriers collaborate to serve shared customers.•Two alternative formulations are proposed and analyzed.•Extensive computational experiments are provided.•We quantify the potential benefits compa...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 265; H. 3; S. 1078 - 1093
Hauptverfasser:	Fernández, Elena, Roca-Riu, Mireia, Speranza, M. Grazia
Format:	Journal Article Verlag
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 16.03.2018 Elsevier
Schlagworte:	90 Operations research, mathematical programming 90B Operations research and management science 90C Mathematical programming Branch-and-cut algorithm Carriers collaboration Classificació AMS Investigació operativa Matemàtiques i estadística Mixed integer programming Operations research Programació (Matemàtica) Programming (Mathematics) Urban logistics Vehicle routing problem Àrees temàtiques de la UPC Urban logistics Mixed integer programming Carriers collaboration Branch-and-cut algorithm Vehicle routing problem
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	•We introduce the Shared Customer Collaboration Vehicle Routing Problem.•There are potential savings when carriers collaborate to serve shared customers.•Two alternative formulations are proposed and analyzed.•Extensive computational experiments are provided.•We quantify the potential benefits compared to the case when no collaboration exists. This paper introduces a new vehicle routing problem that arises in an urban area where several carriers operate and some of their customers have demand of service for more than one carrier. The problem, called Shared Customer Collaboration Vehicle Routing Problem, aims at reducing the overall operational cost in a collaboration framework among the carriers for the service of the shared customers. Alternative mathematical programming formulations are proposed for the problem that are solved with a branch-and-cut algorithm. Computational experiments on different sets of benchmark instances are run to assess the effectiveness of the formulations. Moreover, in order to estimate the savings coming from the collaboration, the optimal solutions are compared with the solutions obtained when carriers work independently from each other.
AbstractList	This paper introduces a new vehicle routing problem that arises in an urban area where several carriers operate and some of their customers have demand of service for more than one carrier. The problem, called Shared Customer Collaboration Vehicle Routing Problem, aims at reducing the overall operational cost in a collaboration framework among the carriers for the service of the shared customers. Alternative mathematical programming formulations are proposed for the problem that are solved with a branch-and-cut algorithm. Computational experiments on different sets of benchmark instances are run to assess the effectiveness of the formulations. Moreover, in order to estimate the savings coming from the collaboration, the optimal solutions are compared with the solutions obtained when carriers work independently from each other. Peer Reviewed •We introduce the Shared Customer Collaboration Vehicle Routing Problem.•There are potential savings when carriers collaborate to serve shared customers.•Two alternative formulations are proposed and analyzed.•Extensive computational experiments are provided.•We quantify the potential benefits compared to the case when no collaboration exists. This paper introduces a new vehicle routing problem that arises in an urban area where several carriers operate and some of their customers have demand of service for more than one carrier. The problem, called Shared Customer Collaboration Vehicle Routing Problem, aims at reducing the overall operational cost in a collaboration framework among the carriers for the service of the shared customers. Alternative mathematical programming formulations are proposed for the problem that are solved with a branch-and-cut algorithm. Computational experiments on different sets of benchmark instances are run to assess the effectiveness of the formulations. Moreover, in order to estimate the savings coming from the collaboration, the optimal solutions are compared with the solutions obtained when carriers work independently from each other.
Author	Roca-Riu, Mireia Fernández, Elena Speranza, M. Grazia
Author_xml	– sequence: 1 givenname: Elena orcidid: 0000-0003-4714-0257 surname: Fernández fullname: Fernández, Elena email: e.fernandez@upc.edu organization: Department of Statistics and Operations Research, Barcelona Tech-UPC. Carrer de Jordi Girona, 1, C5‐208. 08034. Barcelona, Spain – sequence: 2 givenname: Mireia orcidid: 0000-0002-7632-6643 surname: Roca-Riu fullname: Roca-Riu, Mireia email: mireia.roca-riu@upc.edu, mireia.roca-riu@ivt.baug.ethz.ch organization: Department of Statistics and Operations Research, Barcelona Tech-UPC. Carrer de Jordi Girona, 1, C5‐208. 08034. Barcelona, Spain – sequence: 3 givenname: M. Grazia surname: Speranza fullname: Speranza, M. Grazia email: grazia.speranza@unibs.it organization: Dipartimento di Metodi Quantitativi, Universitàdi Brescia. Contrada Santa Chiara 50, 25122 Brescia, Italia
BookMark	eNp90N1KwzAUwPEgE9ymL-BVX6D1JOlHCt5I8QsGik5vQ5qcupSukaQTfHtbNxC82EUIufiFc_4LMutdj4RcUkgo0PyqTbB1PmFAiwREAhk9IXMqChbnIocZmQMvipgxWpyRRQgtANCMZnNSrjcYvW6URxNVuzC4Lfqocl2naufVYF0fvePG6g6jF7cbbP8RPXtXd7g9J6eN6gJeHO4lebu7XVcP8erp_rG6WcU6pWKIkQsBgjV5mjWK8QZB5XUNmJaQc6p4WWBtwABDo5jWjKZ5A6Yp0aS1aTjwJaH7f3XYaelRo9dqkE7Zv8d0GBRMcihpzkcjDsa7EDw2Utvhd5vBK9tJCnLKJls5ZZNTNglCjtlGyv7RT2-3yn8fR9d7hGOIL4teBm2x12jsOOMgjbPH-A_gqIkM
CitedBy_id	crossref_primary_10_3390_su10051358 crossref_primary_10_3233_JIFS_220378 crossref_primary_10_1287_trsc_2021_1041 crossref_primary_10_2174_18744478_v16_e2208101 crossref_primary_10_2478_amns_2025_0128 crossref_primary_10_1080_12507970_2019_1684214 crossref_primary_10_1016_j_tre_2025_104235 crossref_primary_10_1016_j_rtbm_2024_101157 crossref_primary_10_1287_trsc_2022_1179 crossref_primary_10_1016_j_ejor_2018_04_037 crossref_primary_10_1007_s10479_021_04504_3 crossref_primary_10_1016_j_trpro_2024_12_195 crossref_primary_10_1016_j_eswa_2023_120988 crossref_primary_10_1016_j_tre_2024_103503 crossref_primary_10_1016_j_ejor_2019_11_038 crossref_primary_10_1016_j_trc_2025_105032 crossref_primary_10_1016_j_ejor_2018_05_001 crossref_primary_10_1016_j_omega_2024_103221 crossref_primary_10_1007_s11831_022_09874_w crossref_primary_10_1016_j_asoc_2021_107875 crossref_primary_10_1016_j_jclepro_2021_128943 crossref_primary_10_1016_j_engappai_2024_109700 crossref_primary_10_1016_j_eswa_2021_114561 crossref_primary_10_3390_sym17091437 crossref_primary_10_1016_j_asoc_2024_112323 crossref_primary_10_3390_su12135333 crossref_primary_10_3390_su141610190 crossref_primary_10_1016_j_ejor_2020_12_064 crossref_primary_10_1016_j_eswa_2022_117926 crossref_primary_10_1016_j_ifacol_2019_11_600 crossref_primary_10_1016_j_seps_2024_101871 crossref_primary_10_1111_itor_13282 crossref_primary_10_1109_ACCESS_2024_3408418 crossref_primary_10_1016_j_trc_2024_104647 crossref_primary_10_1109_TITS_2024_3360420 crossref_primary_10_1016_j_jclepro_2020_122593 crossref_primary_10_1016_j_ejor_2022_04_033 crossref_primary_10_1016_j_ejor_2023_11_032 crossref_primary_10_1007_s11750_020_00541_6 crossref_primary_10_3233_JIFS_182715 crossref_primary_10_1080_19427867_2022_2112857 crossref_primary_10_1016_j_eswa_2024_124164 crossref_primary_10_1371_journal_pone_0242555 crossref_primary_10_1007_s12063_024_00469_1 crossref_primary_10_1016_j_jclepro_2019_02_043 crossref_primary_10_23919_JSEE_2022_000097 crossref_primary_10_1080_00207543_2019_1574040 crossref_primary_10_1016_j_eswa_2020_113838 crossref_primary_10_1016_j_eswa_2025_126875 crossref_primary_10_1525_elementa_2023_00030 crossref_primary_10_1016_j_ejor_2020_05_049 crossref_primary_10_1016_j_trc_2022_103725 crossref_primary_10_1007_s10479_023_05711_w crossref_primary_10_1016_j_ejor_2018_08_027 crossref_primary_10_3390_technologies10040081 crossref_primary_10_1016_j_eswa_2022_116690 crossref_primary_10_3390_su14116709 crossref_primary_10_1016_j_trc_2024_104973 crossref_primary_10_1080_23302674_2021_1887397 crossref_primary_10_3390_su141811644 crossref_primary_10_1007_s10479_020_03522_x crossref_primary_10_1080_01605682_2020_1772022 crossref_primary_10_3390_app112110295 crossref_primary_10_1016_j_swevo_2025_101942 crossref_primary_10_1016_j_wasman_2020_09_045
Cites_doi	10.1287/opre.1100.0848 10.1080/01966324.1993.10737363 10.1287/mnsc.18.11.664 10.1007/s00291-013-0331-x 10.1287/opre.22.2.340 10.1287/trsc.1100.0327 10.1080/01441647.2013.853706 10.1111/itor.12076 10.1145/362248.362272 10.1016/j.procir.2014.05.008 10.1080/23249935.2013.797518 10.3141/1966-05 10.1016/j.tre.2005.09.007 10.1016/j.cor.2015.03.014 10.1287/trsc.1060.0169 10.1002/net.3230070203 10.1016/j.ejor.2015.09.059 10.1287/trsc.3.3.192 10.1007/s12159-011-0046-9 10.1016/j.dss.2011.02.018 10.1002/net.3230110205 10.1287/trsc.1090.0270 10.1016/j.ejor.2015.02.028 10.1016/j.cor.2017.03.008 10.1287/opre.2015.1360 10.1016/j.trb.2014.11.012 10.1007/s00291-005-0031-2 10.1007/s10732-006-9004-0 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G 10.1016/j.ejor.2012.07.021 10.1287/trsc.1110.0370 10.1080/13675567.2013.865719 10.1016/j.cor.2005.07.026 10.1108/09600030710752514 10.1016/0377-2217(94)00025-8 10.1016/j.cor.2015.10.001 10.1111/j.1475-3995.2010.00799.x 10.1057/palgrave.jors.2602489 10.1016/j.ejor.2013.02.034 10.1057/jors.1972.53 10.3141/2224-07 10.1016/j.tre.2009.12.006
ContentType	Journal Article Publication
Contributor	Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització
Contributor_xml	– sequence: 1 fullname: Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa – sequence: 2 fullname: Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització
Copyright	2017 Elsevier B.V. info:eu-repo/semantics/openAccess
Copyright_xml	– notice: 2017 Elsevier B.V. – notice: info:eu-repo/semantics/openAccess
DBID	AAYXX CITATION XX2
DOI	10.1016/j.ejor.2017.08.051
DatabaseName	CrossRef Recercat
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Business
EISSN	1872-6860
EndPage	1093
ExternalDocumentID	oai_recercat_cat_2072_309163 10_1016_j_ejor_2017_08_051 S0377221717307828
GroupedDBID	--K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD XX2
ID	FETCH-LOGICAL-c418t-e388082f645fa23fe0a6bb0e490631a397ebd0d02eda2cc2146f0df9ed4bdf303
ISICitedReferencesCount	69
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000417657200022&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0377-2217
IngestDate	Fri Nov 07 13:40:41 EST 2025 Sat Nov 29 05:34:32 EST 2025 Tue Nov 18 22:28:46 EST 2025 Fri Feb 23 02:27:36 EST 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	Urban logistics Mixed integer programming Carriers collaboration Branch-and-cut algorithm Vehicle routing problem
Language	English
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c418t-e388082f645fa23fe0a6bb0e490631a397ebd0d02eda2cc2146f0df9ed4bdf303
ORCID	0000-0003-4714-0257 0000-0002-7632-6643
OpenAccessLink	https://recercat.cat/handle/2072/309163
PageCount	16
ParticipantIDs	csuc_recercat_oai_recercat_cat_2072_309163 crossref_citationtrail_10_1016_j_ejor_2017_08_051 crossref_primary_10_1016_j_ejor_2017_08_051 elsevier_sciencedirect_doi_10_1016_j_ejor_2017_08_051
PublicationCentury	2000
PublicationDate	2018-03-16
PublicationDateYYYYMMDD	2018-03-16
PublicationDate_xml	– month: 03 year: 2018 text: 2018-03-16 day: 16
PublicationDecade	2010
PublicationTitle	European journal of operational research
PublicationYear	2018
Publisher	Elsevier B.V Elsevier
Publisher_xml	– name: Elsevier B.V – name: Elsevier
References	Cruijssen, Cools, Dullaert (bib0016) 2007; 43 Nadef, Rinaldi (bib0036) 2014 Agarwal, Ergun (bib0002) 2010; 58 Archetti, Jabali, Speranza (bib0007) 2015; 61 Toth, Vigo (bib0043) 2014 Lozano, Moreno, Adenso-Díaz, Algaba (bib0035) 2013; 229 Gouveia (bib0028) 1995; 85 Bailey, Unnikrishnan, Lin (bib0010) 2011; 2224 Cordeau, Gendreau, Laporte (bib0014) 1997; 30 Dahl, Derigs (bib0017) 2011; 51 Karsten, Slikker, van Houtum (bib0030) 2015; 63 Ahr (bib0003) 2004 Archetti, Hertz, Speranza (bib0006) 2006; 13 Letchford, Salazar-González (bib0034) 2015; 244 Vornhusen, Wang, Kopfer (bib0046) 2014; 19 Ergun, Kuyzu, Savelsbergh (bib0021) 2007; 34 Özener, Ergun, Savelsbergh (bib0038) 2011; 45 Corberán, Fernández, Franquesa, Sanchis (bib0013) 2011; 45 Hopcroft, R.E. (bib0029) 1973; 16 Vanovermeire, Sörensen, Breedam, Vannieuwenhuyse, Verstrepen (bib0044) 2014; 17 Adenso-Díaz, Lozano, Moreno (bib0001) 2014; 10 Ergun, Kuyzu, Savelsbergh (bib0020) 2007; 41 Fernández, Fontana, Speranza (bib0022) 2016; 67 Golden, Magnanti, Nguyen (bib0027) 1977; 7 Defryn, Sörensen, Cornelissens (bib0019) 2016; 250 Nemhauser, Wolsey (bib0037) 1988 Pomponi, Fratocchi, Tafuri, Palumbo (bib0039) 2013; 3 Audy, Lehoux, D’Amours, Rönnqvist (bib0009) 2012; 19 Wren, Holliday (bib0048) 1972; 23 Berger, Bierwirth (bib0011) 2010; 46 Fisher (bib0024) 1981; 11 Tillman, Cain (bib0042) 1972; 18 Figliozzi (bib0023) 2006; 1966 Krajewska, Kopfer, Laporte, Ropke, Zaccour (bib0032) 2008; 59 Verdonck, Caris, Ramaekers, Janssens (bib0045) 2013; 33 Tillman (bib0041) 1969; 3 Gillett, Miller (bib0026) 1974; 22 Archetti, Bianchessi, Irnich, Speranza (bib0005) 2014; 21 Chao, Golden, Wasil (bib0012) 1993; 13 Krajewska, Kopfer (bib0031) 2006; 28 Archetti, Fernandez, Huerta-Muñoz (bib0008) 2017 Cruijssen, Braysy, Dullaert, Fleuren, Salomon (bib0015) 2007; 37 Sprenger, Mönch (bib0040) 2012; 223 Ford, Fulkerson (bib0025) 1962 Dai, Chen (bib0018) 2011; 3 Aráoz, Fernández, Franquesa (bib0004) 2009; 43 Wang, Kopfer (bib0047) 2014; 36 Kuyzu, Akyol, Ergun, Savelsbergh (bib0033) 2015; 73 Bailey (10.1016/j.ejor.2017.08.051_bib0010) 2011; 2224 Cruijssen (10.1016/j.ejor.2017.08.051_bib0016) 2007; 43 Golden (10.1016/j.ejor.2017.08.051_bib0027) 1977; 7 Vornhusen (10.1016/j.ejor.2017.08.051_sbref0046) 2014; 19 Tillman (10.1016/j.ejor.2017.08.051_bib0041) 1969; 3 Verdonck (10.1016/j.ejor.2017.08.051_bib0045) 2013; 33 Wren (10.1016/j.ejor.2017.08.051_bib0048) 1972; 23 Archetti (10.1016/j.ejor.2017.08.051_sbref0008) 2017 Lozano (10.1016/j.ejor.2017.08.051_bib0035) 2013; 229 Kuyzu (10.1016/j.ejor.2017.08.051_bib0033) 2015; 73 Corberán (10.1016/j.ejor.2017.08.051_bib0013) 2011; 45 Dai (10.1016/j.ejor.2017.08.051_bib0018) 2011; 3 Ergun (10.1016/j.ejor.2017.08.051_sbref0021) 2007; 34 Krajewska (10.1016/j.ejor.2017.08.051_bib0032) 2008; 59 Letchford (10.1016/j.ejor.2017.08.051_bib0034) 2015; 244 Adenso-Díaz (10.1016/j.ejor.2017.08.051_bib0001) 2014; 10 Audy (10.1016/j.ejor.2017.08.051_bib0009) 2012; 19 Özener (10.1016/j.ejor.2017.08.051_bib0038) 2011; 45 Dahl (10.1016/j.ejor.2017.08.051_bib0017) 2011; 51 Karsten (10.1016/j.ejor.2017.08.051_bib0030) 2015; 63 Archetti (10.1016/j.ejor.2017.08.051_bib0006) 2006; 13 Berger (10.1016/j.ejor.2017.08.051_bib0011) 2010; 46 Sprenger (10.1016/j.ejor.2017.08.051_bib0040) 2012; 223 Tillman (10.1016/j.ejor.2017.08.051_bib0042) 1972; 18 Chao (10.1016/j.ejor.2017.08.051_bib0012) 1993; 13 Gillett (10.1016/j.ejor.2017.08.051_bib0026) 1974; 22 Wang (10.1016/j.ejor.2017.08.051_bib0047) 2014; 36 Agarwal (10.1016/j.ejor.2017.08.051_bib0002) 2010; 58 Toth (10.1016/j.ejor.2017.08.051_bib0043) 2014 Hopcroft (10.1016/j.ejor.2017.08.051_bib0029) 1973; 16 Cordeau (10.1016/j.ejor.2017.08.051_bib0014) 1997; 30 Archetti (10.1016/j.ejor.2017.08.051_bib0005) 2014; 21 Pomponi (10.1016/j.ejor.2017.08.051_bib0039) 2013; 3 Fernández (10.1016/j.ejor.2017.08.051_bib0022) 2016; 67 Ergun (10.1016/j.ejor.2017.08.051_bib0020) 2007; 41 Aráoz (10.1016/j.ejor.2017.08.051_bib0004) 2009; 43 Fisher (10.1016/j.ejor.2017.08.051_bib0024) 1981; 11 Gouveia (10.1016/j.ejor.2017.08.051_bib0028) 1995; 85 Archetti (10.1016/j.ejor.2017.08.051_bib0007) 2015; 61 Nadef (10.1016/j.ejor.2017.08.051_bib0036) 2014 Defryn (10.1016/j.ejor.2017.08.051_bib0019) 2016; 250 Krajewska (10.1016/j.ejor.2017.08.051_bib0031) 2006; 28 Nemhauser (10.1016/j.ejor.2017.08.051_bib0037) 1988 Ahr (10.1016/j.ejor.2017.08.051_bib0003) 2004 Cruijssen (10.1016/j.ejor.2017.08.051_bib0015) 2007; 37 Vanovermeire (10.1016/j.ejor.2017.08.051_bib0044) 2014; 17 Ford (10.1016/j.ejor.2017.08.051_bib0025) 1962 Figliozzi (10.1016/j.ejor.2017.08.051_bib0023) 2006; 1966
References_xml	– volume: 244 start-page: 730 year: 2015 end-page: 738 ident: bib0034 article-title: Stronger multi-commodity flow formulations of the capacitated vehicle routing problem publication-title: European Journal of Operational Research – volume: 223 start-page: 626 year: 2012 end-page: 636 ident: bib0040 article-title: A methodology to solve large-scale cooperative transportation planning problems publication-title: European Journal of Operational Research – volume: 33 start-page: 700 year: 2013 end-page: 719 ident: bib0045 article-title: Collaborative logistics from the perspective of road transportation companies publication-title: Transport Reviews – volume: 19 start-page: 117 year: 2014 end-page: 122 ident: bib0046 article-title: Vehicle routing under consideration of transhipment in horizontal coalitions of freight carriers publication-title: Procedia CIRP – volume: 43 start-page: 287 year: 2009 end-page: 300 ident: bib0004 article-title: The clustered prize-collecting arc routing problem publication-title: Transportation Science – year: 2017 ident: bib0008 article-title: The flexible periodic vehicle routing problem publication-title: Computers & Operations research – volume: 18 start-page: 664 year: 1972 end-page: 682 ident: bib0042 article-title: An upper bound algorithm for the single and multiple terminal delivery problem publication-title: Management Science – volume: 59 start-page: 1483 year: 2008 end-page: 1491 ident: bib0032 article-title: Horizontal cooperation among freight carriers: request allocation and profit sharing publication-title: The Journal of the Operational Research Society – volume: 3 start-page: 243 year: 2013 end-page: 254 ident: bib0039 article-title: Horizontal collaboration in logistics: a comprehensive framework publication-title: Research in Logistics and Production – volume: 37 start-page: 287 year: 2007 end-page: 304 ident: bib0015 article-title: Joint route planning under varying market conditions publication-title: International Journal of Physical Distribution and Logistics Management – volume: 23 start-page: 333 year: 1972 end-page: 344 ident: bib0048 article-title: Computer scheduling of vehicles from one or more depots to a number of delivery points publication-title: Operational Research Quarterly – volume: 250 start-page: 400 year: 2016 end-page: 411 ident: bib0019 article-title: The selective vehicle routing problem in a collaborative environment publication-title: European Journal of Operational Research – volume: 63 start-page: 476 year: 2015 end-page: 488 ident: bib0030 article-title: Resource pooling and cost allocation among independent service providers publication-title: Operations Research – volume: 73 start-page: 34 year: 2015 end-page: 58 ident: bib0033 article-title: Bid price optimization for truckload carriers in simultaneous transportation procurement auctions publication-title: Transportation Research Part B: Methodological – volume: 22 start-page: 340 year: 1974 end-page: 349 ident: bib0026 article-title: A heuristic algorithm for the vehicle-dispatch problem publication-title: Operations Research – volume: 10 start-page: 533 year: 2014 end-page: 547 ident: bib0001 article-title: Analysis of the synergies of merging multi-company transportation needs publication-title: Transportmetrica A: Transport Science – volume: 11 start-page: 109 year: 1981 end-page: 214 ident: bib0024 article-title: A generalized assignment heuristic for vehicle routing publication-title: Networks – year: 2014 ident: bib0043 article-title: Vehicle routing – volume: 13 start-page: 371 year: 1993 end-page: 406 ident: bib0012 article-title: A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions publication-title: American Journal of Mathematical and Management Sciences – volume: 58 start-page: 1726 year: 2010 end-page: 1742 ident: bib0002 article-title: Network design and allocation mechanisms for carrier alliances in liner shipping publication-title: Operations Research – volume: 2224 start-page: 51 year: 2011 end-page: 60 ident: bib0010 article-title: Models for minimizing backhaul costs through freight collaboration publication-title: Transportation Research Record: Journal of the Transportation Research Board – year: 1988 ident: bib0037 article-title: Applications of special-purpose algorithms – volume: 51 start-page: 620 year: 2011 end-page: 626 ident: bib0017 article-title: Cooperative planning in express carrier networks an empirical study on the effectiveness of a real-time decision support system publication-title: Decision Support Systems – volume: 28 start-page: 301 year: 2006 end-page: 317 ident: bib0031 article-title: Collaborating freight forwarding enterprises publication-title: OR Spectrum – volume: 229 start-page: 444 year: 2013 end-page: 452 ident: bib0035 article-title: Cooperative game theory approach to allocating benefits of horizontal cooperation publication-title: European Journal of Operational Research – volume: 45 start-page: 1 year: 2011 end-page: 17 ident: bib0038 article-title: Lane-exchange mechanisms for truckload carrier collaboration publication-title: Transportation Science – volume: 67 start-page: 120 year: 2016 end-page: 131 ident: bib0022 article-title: On the collaboration uncapacitated arc routing problem publication-title: Computers and Operations Research – volume: 41 start-page: 206 year: 2007 end-page: 221 ident: bib0020 article-title: Reducing truckload transportation costs through collaboration publication-title: Transportation Science – volume: 45 start-page: 317 year: 2011 end-page: 344 ident: bib0013 article-title: The windy clustered prize-collecting arc routing problem publication-title: Transportation Science – volume: 1966 start-page: 34 year: 2006 end-page: 40 ident: bib0023 article-title: Analysis and evaluation of incentive-compatible dynamic mechanisms for carrier collaboration publication-title: Transportation Research Record: Journal of the Transportation Research Board – volume: 46 start-page: 627 year: 2010 end-page: 638 ident: bib0011 article-title: Solutions to the request reassignment problem in collaborative carrier networks publication-title: Transportation Research Part E: Logistics and Transportation Review – volume: 30 start-page: 105 year: 1997 end-page: 119 ident: bib0014 article-title: A tabu search heuristic for periodic and multi-depot vehicle routing problems publication-title: Networks – volume: 43 start-page: 129 year: 2007 end-page: 142 ident: bib0016 article-title: Horizontal cooperation in logistics: Opportunities and impediments publication-title: Transportation Research Part E: Logistics and Transportation Review – year: 1962 ident: bib0025 article-title: Flows in networks – volume: 16 start-page: 372 year: 1973 end-page: 378 ident: bib0029 article-title: Efficient algorithms for graph manipulation publication-title: Communications of the ACM – volume: 17 start-page: 339 year: 2014 end-page: 355 ident: bib0044 article-title: Horizontal logistics collaboration: decreasing costs through flexibility and an adequate cost allocation strategy publication-title: International Journal of Logistics Research and Applications – volume: 13 start-page: 49 year: 2006 end-page: 76 ident: bib0006 article-title: Metaheuristics for the team orienteering problem publication-title: Journal of Heuristics – year: 2014 ident: bib0036 article-title: Branch-and-cut algorithms for the capacitated VRP publication-title: The vehicle routing problem – volume: 61 start-page: 122 year: 2015 end-page: 134 ident: bib0007 article-title: Multi-period vehicle routing problem with due dates publication-title: Computers and Operations Research – volume: 3 start-page: 101 year: 2011 end-page: 120 ident: bib0018 article-title: A multi-agent and auction-based framework and approach for carrier collaboration publication-title: Logistics Research – volume: 7 start-page: 113 year: 1977 end-page: 148 ident: bib0027 article-title: Implementing vehicle routing algorithms publication-title: Networks – volume: 19 start-page: 633 year: 2012 end-page: 657 ident: bib0009 article-title: A framework for an efficient implementation of logistics collaborations publication-title: International Transactions in Operational Research – volume: 3 start-page: 192 year: 1969 end-page: 204 ident: bib0041 article-title: The multiple terminal delivery problem with probabilistic demands publication-title: Transportation Science – volume: 85 start-page: 610 year: 1995 end-page: 624 ident: bib0028 article-title: A result on projection for the vehicle routing problem publication-title: European Journal of Operational Research – volume: 34 start-page: 1551 year: 2007 end-page: 1560 ident: bib0021 article-title: Shipper collaboration publication-title: Computers and Operations Research – volume: 36 start-page: 357 year: 2014 end-page: 380 ident: bib0047 article-title: Collaborative transportation planning of less-than-truckload freight publication-title: OR Spectrum – volume: 21 start-page: 353 year: 2014 end-page: 374 ident: bib0005 article-title: Formulations for an inventory routing problem publication-title: International Transactions in Operational Research – year: 2004 ident: bib0003 publication-title: Contributions to multiple postmen problems – volume: 58 start-page: 1726 issue: 6 year: 2010 ident: 10.1016/j.ejor.2017.08.051_bib0002 article-title: Network design and allocation mechanisms for carrier alliances in liner shipping publication-title: Operations Research doi: 10.1287/opre.1100.0848 – volume: 13 start-page: 371 issue: 3–4 year: 1993 ident: 10.1016/j.ejor.2017.08.051_bib0012 article-title: A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions publication-title: American Journal of Mathematical and Management Sciences doi: 10.1080/01966324.1993.10737363 – volume: 18 start-page: 664 year: 1972 ident: 10.1016/j.ejor.2017.08.051_bib0042 article-title: An upper bound algorithm for the single and multiple terminal delivery problem publication-title: Management Science doi: 10.1287/mnsc.18.11.664 – volume: 36 start-page: 357 issue: 2 year: 2014 ident: 10.1016/j.ejor.2017.08.051_bib0047 article-title: Collaborative transportation planning of less-than-truckload freight publication-title: OR Spectrum doi: 10.1007/s00291-013-0331-x – volume: 22 start-page: 340 issue: 2 year: 1974 ident: 10.1016/j.ejor.2017.08.051_bib0026 article-title: A heuristic algorithm for the vehicle-dispatch problem publication-title: Operations Research doi: 10.1287/opre.22.2.340 – volume: 45 start-page: 1 issue: 1 year: 2011 ident: 10.1016/j.ejor.2017.08.051_bib0038 article-title: Lane-exchange mechanisms for truckload carrier collaboration publication-title: Transportation Science doi: 10.1287/trsc.1100.0327 – volume: 33 start-page: 700 issue: 6 year: 2013 ident: 10.1016/j.ejor.2017.08.051_bib0045 article-title: Collaborative logistics from the perspective of road transportation companies publication-title: Transport Reviews doi: 10.1080/01441647.2013.853706 – volume: 21 start-page: 353 issue: 3 year: 2014 ident: 10.1016/j.ejor.2017.08.051_bib0005 article-title: Formulations for an inventory routing problem publication-title: International Transactions in Operational Research doi: 10.1111/itor.12076 – volume: 16 start-page: 372 issue: 6 year: 1973 ident: 10.1016/j.ejor.2017.08.051_bib0029 article-title: Efficient algorithms for graph manipulation publication-title: Communications of the ACM doi: 10.1145/362248.362272 – volume: 19 start-page: 117 year: 2014 ident: 10.1016/j.ejor.2017.08.051_sbref0046 article-title: Vehicle routing under consideration of transhipment in horizontal coalitions of freight carriers publication-title: Procedia CIRP doi: 10.1016/j.procir.2014.05.008 – volume: 10 start-page: 533 issue: 6 year: 2014 ident: 10.1016/j.ejor.2017.08.051_bib0001 article-title: Analysis of the synergies of merging multi-company transportation needs publication-title: Transportmetrica A: Transport Science doi: 10.1080/23249935.2013.797518 – volume: 1966 start-page: 34 year: 2006 ident: 10.1016/j.ejor.2017.08.051_bib0023 article-title: Analysis and evaluation of incentive-compatible dynamic mechanisms for carrier collaboration publication-title: Transportation Research Record: Journal of the Transportation Research Board doi: 10.3141/1966-05 – volume: 43 start-page: 129 issue: 2 year: 2007 ident: 10.1016/j.ejor.2017.08.051_bib0016 article-title: Horizontal cooperation in logistics: Opportunities and impediments publication-title: Transportation Research Part E: Logistics and Transportation Review doi: 10.1016/j.tre.2005.09.007 – volume: 61 start-page: 122 issue: 0 year: 2015 ident: 10.1016/j.ejor.2017.08.051_bib0007 article-title: Multi-period vehicle routing problem with due dates publication-title: Computers and Operations Research doi: 10.1016/j.cor.2015.03.014 – volume: 41 start-page: 206 issue: 2 year: 2007 ident: 10.1016/j.ejor.2017.08.051_bib0020 article-title: Reducing truckload transportation costs through collaboration publication-title: Transportation Science doi: 10.1287/trsc.1060.0169 – volume: 7 start-page: 113 issue: 2 year: 1977 ident: 10.1016/j.ejor.2017.08.051_bib0027 article-title: Implementing vehicle routing algorithms publication-title: Networks doi: 10.1002/net.3230070203 – volume: 250 start-page: 400 issue: 2 year: 2016 ident: 10.1016/j.ejor.2017.08.051_bib0019 article-title: The selective vehicle routing problem in a collaborative environment publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2015.09.059 – volume: 3 start-page: 192 year: 1969 ident: 10.1016/j.ejor.2017.08.051_bib0041 article-title: The multiple terminal delivery problem with probabilistic demands publication-title: Transportation Science doi: 10.1287/trsc.3.3.192 – year: 1988 ident: 10.1016/j.ejor.2017.08.051_bib0037 – volume: 3 start-page: 101 issue: 2 year: 2011 ident: 10.1016/j.ejor.2017.08.051_bib0018 article-title: A multi-agent and auction-based framework and approach for carrier collaboration publication-title: Logistics Research doi: 10.1007/s12159-011-0046-9 – volume: 51 start-page: 620 issue: 3 year: 2011 ident: 10.1016/j.ejor.2017.08.051_bib0017 article-title: Cooperative planning in express carrier networks an empirical study on the effectiveness of a real-time decision support system publication-title: Decision Support Systems doi: 10.1016/j.dss.2011.02.018 – volume: 11 start-page: 109 year: 1981 ident: 10.1016/j.ejor.2017.08.051_bib0024 article-title: A generalized assignment heuristic for vehicle routing publication-title: Networks doi: 10.1002/net.3230110205 – year: 1962 ident: 10.1016/j.ejor.2017.08.051_bib0025 – year: 2004 ident: 10.1016/j.ejor.2017.08.051_bib0003 – volume: 43 start-page: 287 issue: 3 year: 2009 ident: 10.1016/j.ejor.2017.08.051_bib0004 article-title: The clustered prize-collecting arc routing problem publication-title: Transportation Science doi: 10.1287/trsc.1090.0270 – volume: 3 start-page: 243 issue: 4 year: 2013 ident: 10.1016/j.ejor.2017.08.051_bib0039 article-title: Horizontal collaboration in logistics: a comprehensive framework publication-title: Research in Logistics and Production – volume: 244 start-page: 730 issue: 3 year: 2015 ident: 10.1016/j.ejor.2017.08.051_bib0034 article-title: Stronger multi-commodity flow formulations of the capacitated vehicle routing problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2015.02.028 – year: 2017 ident: 10.1016/j.ejor.2017.08.051_sbref0008 article-title: The flexible periodic vehicle routing problem publication-title: Computers & Operations research doi: 10.1016/j.cor.2017.03.008 – volume: 63 start-page: 476 issue: 2 year: 2015 ident: 10.1016/j.ejor.2017.08.051_bib0030 article-title: Resource pooling and cost allocation among independent service providers publication-title: Operations Research doi: 10.1287/opre.2015.1360 – volume: 73 start-page: 34 year: 2015 ident: 10.1016/j.ejor.2017.08.051_bib0033 article-title: Bid price optimization for truckload carriers in simultaneous transportation procurement auctions publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2014.11.012 – volume: 28 start-page: 301 issue: 3 year: 2006 ident: 10.1016/j.ejor.2017.08.051_bib0031 article-title: Collaborating freight forwarding enterprises publication-title: OR Spectrum doi: 10.1007/s00291-005-0031-2 – volume: 13 start-page: 49 issue: 1 year: 2006 ident: 10.1016/j.ejor.2017.08.051_bib0006 article-title: Metaheuristics for the team orienteering problem publication-title: Journal of Heuristics doi: 10.1007/s10732-006-9004-0 – volume: 30 start-page: 105 issue: 2 year: 1997 ident: 10.1016/j.ejor.2017.08.051_bib0014 article-title: A tabu search heuristic for periodic and multi-depot vehicle routing problems publication-title: Networks doi: 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G – volume: 223 start-page: 626 issue: 3 year: 2012 ident: 10.1016/j.ejor.2017.08.051_bib0040 article-title: A methodology to solve large-scale cooperative transportation planning problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2012.07.021 – volume: 45 start-page: 317 issue: 3 year: 2011 ident: 10.1016/j.ejor.2017.08.051_bib0013 article-title: The windy clustered prize-collecting arc routing problem publication-title: Transportation Science doi: 10.1287/trsc.1110.0370 – volume: 17 start-page: 339 issue: 4 year: 2014 ident: 10.1016/j.ejor.2017.08.051_bib0044 article-title: Horizontal logistics collaboration: decreasing costs through flexibility and an adequate cost allocation strategy publication-title: International Journal of Logistics Research and Applications doi: 10.1080/13675567.2013.865719 – volume: 34 start-page: 1551 issue: 6 year: 2007 ident: 10.1016/j.ejor.2017.08.051_sbref0021 article-title: Shipper collaboration publication-title: Computers and Operations Research doi: 10.1016/j.cor.2005.07.026 – year: 2014 ident: 10.1016/j.ejor.2017.08.051_bib0036 article-title: Branch-and-cut algorithms for the capacitated VRP – volume: 37 start-page: 287 issue: 4 year: 2007 ident: 10.1016/j.ejor.2017.08.051_bib0015 article-title: Joint route planning under varying market conditions publication-title: International Journal of Physical Distribution and Logistics Management doi: 10.1108/09600030710752514 – volume: 85 start-page: 610 issue: 3 year: 1995 ident: 10.1016/j.ejor.2017.08.051_bib0028 article-title: A result on projection for the vehicle routing problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)00025-8 – volume: 67 start-page: 120 year: 2016 ident: 10.1016/j.ejor.2017.08.051_bib0022 article-title: On the collaboration uncapacitated arc routing problem publication-title: Computers and Operations Research doi: 10.1016/j.cor.2015.10.001 – year: 2014 ident: 10.1016/j.ejor.2017.08.051_bib0043 – volume: 19 start-page: 633 issue: 5 year: 2012 ident: 10.1016/j.ejor.2017.08.051_bib0009 article-title: A framework for an efficient implementation of logistics collaborations publication-title: International Transactions in Operational Research doi: 10.1111/j.1475-3995.2010.00799.x – volume: 59 start-page: 1483 issue: 11 year: 2008 ident: 10.1016/j.ejor.2017.08.051_bib0032 article-title: Horizontal cooperation among freight carriers: request allocation and profit sharing publication-title: The Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2602489 – volume: 229 start-page: 444 issue: 2 year: 2013 ident: 10.1016/j.ejor.2017.08.051_bib0035 article-title: Cooperative game theory approach to allocating benefits of horizontal cooperation publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.02.034 – volume: 23 start-page: 333 issue: 3 year: 1972 ident: 10.1016/j.ejor.2017.08.051_bib0048 article-title: Computer scheduling of vehicles from one or more depots to a number of delivery points publication-title: Operational Research Quarterly doi: 10.1057/jors.1972.53 – volume: 2224 start-page: 51 year: 2011 ident: 10.1016/j.ejor.2017.08.051_bib0010 article-title: Models for minimizing backhaul costs through freight collaboration publication-title: Transportation Research Record: Journal of the Transportation Research Board doi: 10.3141/2224-07 – volume: 46 start-page: 627 issue: 5 year: 2010 ident: 10.1016/j.ejor.2017.08.051_bib0011 article-title: Solutions to the request reassignment problem in collaborative carrier networks publication-title: Transportation Research Part E: Logistics and Transportation Review doi: 10.1016/j.tre.2009.12.006
SSID	ssj0001515
Score	2.5045288
Snippet	•We introduce the Shared Customer Collaboration Vehicle Routing Problem.•There are potential savings when carriers collaborate to serve shared customers.•Two... This paper introduces a new vehicle routing problem that arises in an urban area where several carriers operate and some of their customers have demand of...
SourceID	csuc crossref elsevier
SourceType	Open Access Repository Enrichment Source Index Database Publisher
StartPage	1078
SubjectTerms	90 Operations research, mathematical programming 90B Operations research and management science 90C Mathematical programming Branch-and-cut algorithm Carriers collaboration Classificació AMS Investigació operativa Matemàtiques i estadística Mixed integer programming Operations research Programació (Matemàtica) Programming (Mathematics) Urban logistics Vehicle routing problem Àrees temàtiques de la UPC
Title	The Shared Customer Collaboration Vehicle Routing Problem
URI	https://dx.doi.org/10.1016/j.ejor.2017.08.051 https://recercat.cat/handle/2072/309163
Volume	265
WOSCitedRecordID	wos000417657200022&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELdKhxB74KOANr6UB56oUsVuUjuPEypfgmnaxtQ3y3FsrdXIpqydpr3xn3MX21nKxwRIPDRqnDhxfJfzzxff7wh5ZTItElXoOC-tggkKTWMllI5tyTVXTLOySQZz9Inv7orZLN_r9b6FWJiLE15V4vIyP_uvooYyEDaGzv6FuNuLQgH8B6HDFsQO2z8WPNIwo-t2BdDuq6kb98C1tI_MMVYa4mog9BTsuaQyv3XSe8AKBXVwHXqOoNaXjO7o5ps7DT7pKQxnrcnfhxEz3p-v3EL92szbIwd40eqqgbCfR8N3tbryB70rgjaxeS5S0vnHfoqRcXFZnMeMuQjNkXFmVnAWT4TLJBDsMHNJI7zCjTtWFaaoojNCIwPWL62_c0QsRmZxilSvlDfsrJ7Qdp1V-wCbha2iYOIAJYlbZIPxLAfDuLHzYTr72A7niPiaT1H-MXzklVsk-OOd1tBNX5-vdAfkdIDL4QNyz884oh2nKQ9Jz1QDcicEPAzI_ZDYI_J2fkA2OyyVj0gOGhU5jYqCRkVrGhV5jYq8RkVeox6TL2-nh2_exz7jRqxTKpaxQWogwewkzaxiY2sSNSmKxKQ5IFmqALuaokzKhJkS3mONSeFtUtrclGlRWkBDT0i_Oq3MFomKLNWaaoTTKi2Myi2MjXmhjOHWpmq8TWjoKak9HT1mRTmRYd3hQmLvSuxdialSM7pNhm2dM0fGcuPZr1EAEpCDqbVaSmRSb3fwxxLO5BgQ8wSakwUxSY89HaaUoFw33OTpP9Z7Ru5ev0HPSX9Zr8wLcltfLOfn9Uuvg98BLzWohg
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+Shared+Customer+Collaboration+Vehicle+Routing+Problem&rft.jtitle=European+journal+of+operational+research&rft.au=Fern%C3%A1ndez%2C+Elena&rft.au=Roca-Riu%2C+Mireia&rft.au=Speranza%2C+M.+Grazia&rft.date=2018-03-16&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=265&rft.issue=3&rft.spage=1078&rft.epage=1093&rft_id=info:doi/10.1016%2Fj.ejor.2017.08.051&rft.externalDocID=S0377221717307828
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon