The Joint Network Vehicle Routing Game

References

• Applegate DL, Bixby RE, Chvatal V, Cook WJ (2006) The Traveling Salesman Problem: A Computational Study (Princeton University Press, Princeton, NJ).Google Scholar
• Archetti C, Bianchessi N, Speranza M (2013) Optimal solutions for routing problems with profits. Discrete Appl. Math. 161(4):547–557.Google Scholar
• Arin J (2003) Egalitarian distributions in coalitional models: The Lorenz criterion. IKERLANAK 2003–02 (Universidad del País Vasco, Leioa, Spain), Article 6503.Google Scholar
• Augerat P (1995) Approche polyédrale du problème de tournées de véhicules. Thesis, Grenoble Institute of Technology, Grenoble, France.Google Scholar
• Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269–1283.Link, Google Scholar
• Ballot E, Fontane F (2010) Reducing transportation co2 emissions through pooling of supply networks: Perspectives from a case study in French retail chains. Production Planning Control 21(6):640–650.Crossref, Google Scholar
• Basso F, D’Amours S, Rönnqvist M, Weintraub A (2018) A survey on obstacles and difficulties of practical implementation of horizontal collaboration in logistics. Internat. Trans. Oper. Res. 26(3):775–793.Crossref, Google Scholar
• Bondareva ON (1963) Some applications of linear programming methods to the theory of cooperative games. Problemy kibernetiki 10:119–139.Google Scholar
• Dahlberg J, Engevall S, Göthe-Lundgren M (2018) Consolidation in urban freight transportation—cost allocation models. Asia-Pacific J.Oper. Res. 35(4):1850023.Crossref, Google Scholar
• Dai B, Chen H (2015) Proportional egalitarian core solution for profit allocation games with an application to collaborative transportation planning. Eur. J. Indust. Engrg. 9(1):53–76.Crossref, Google Scholar
• Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2):342–354.Link, Google Scholar
• Drechsel J, Kimms A (2010) Computing core allocations in cooperative games with an application to cooperative procurement. Internat. J. Production Econom. 128(1):310–321.Crossref, Google Scholar
• Dror M (1990) Cost allocation: The traveling salesman, binpacking, and the knapsack. Appl. Math. Comput. 35(2):191–207.Crossref, Google Scholar
• Engevall S, Göthe-Lundgren M, Värbrand P (1998) The traveling salesman game: An application of cost allocation in a gas and oil company. Ann. Oper. Res. 82:203–218.Crossref, Google Scholar
• Engevall S, Göthe-Lundgren M, Värbrand P (2004) The heterogeneous vehicle-routing game. Transportation Sci. 38(1):71–85.Link, Google Scholar
• Faigle U (1989) Cores of games with restricted cooperation. Zeitschrift Oper. Res. 33(6):405–422.Google Scholar
• Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3):216–229.Crossref, Google Scholar
• Fishburn PC, Pollak HO (1983) Fixed-route cost allocation. Amer. Math. Monthly 90(6):366–378.Crossref, Google Scholar
• Frisk M, Göthe-Lundgren M, Jörnsten K, Rönnqvist M (2010) Cost allocation in collaborative forest transportation. Eur. J. Oper. Res. 205(2):448–458.Crossref, Google Scholar
• Gillies DB (1959) Solutions to general Non-Zero-Sum Games. Annals of Mathematic Studies, vol. 40 (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Göthe-Lundgren M, Jörnsten K, Värbrand P (1996) On the nucleolus of the basic vehicle routing game. Math. Programming 72(1):83–100.Crossref, Google Scholar
• Guajardo M, Rönnqvist M (2016) A review on cost allocation methods in collaborative transportation. Internat. Trans. Oper. Res. 23(3):371–392, 5.Google Scholar
• Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle routing problem with time windows. Oper. Res. 56(2):391–406.Link, Google Scholar
• Krajewska MA, Kopfer H, Laporte G, Ropke S, Zaccour G (2008) Horizontal cooperation among freight carriers: Request allocation and profit sharing. J. Oper. Res. Soc. 59(11):1483–1491.Crossref, Google Scholar
• Lehoux N, D’Amours S, Frein Y, Langevin A, Penz B (2011) Collaboration for a two-echelon supply chain in the pulp and paper industry: The use of incentives to increase profit. J. Oper. Res. Soc. 62(4):581–592.Crossref, Google Scholar
• Lenstra JK, Rinnooy Kan AHG (1981) Complexity of vehicle routing and scheduling problems. Networks 11(2):221–227.Crossref, Google Scholar
• Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming 100(2):423–445.Crossref, Google Scholar
• Martinelli R, Pecin D, Poggi M (2014) Efficient elementary and restricted non-elementary route pricing. Eur. J. Oper. Res. 239(1):102–111.Crossref, Google Scholar
• Pecin D, Pessoa A, Poggi M, Uchoa E (2017a) Improved branch-cut-and-price for capacitated vehicle routing. Math. Programming Comput. 9(1):61–100.Crossref, Google Scholar
• Pecin D, Pessoa A, Poggi M, Uchoa E, Santos H (2017b) Limited memory rank-1 cuts for vehicle routing problems. Oper. Res. Lett. 45(3):206–209.Crossref, Google Scholar
• Potters JAM, Curiel IJ, Tijs SH (1992) Traveling salesman games. Math. Programming 53(1):199–211.Crossref, Google Scholar
• Schmeidler D (1969) The nucleolus of a characteristic function game. SIAM J. Appl. Math. 17(6):1163–1170.Crossref, Google Scholar
• Shapley LS (1953) A value for n-person games. Contributions Theory Games 2:307–317.Google Scholar
• Shapley LS (1967) On balanced sets and cores. Naval Res. Logist. Quart. 14(4):453–460.Crossref, Google Scholar
• Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.Link, Google Scholar
• Toth P, Vigo D (2014) Vehicle Routing (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• Zakharov VV, Shchegryaev AN (2015) Stable cooperation in dynamic vehicle routing problems. Automation Remote Control 76(5):935–943.Crossref, Google Scholar