Profit distribution in collaborative multiple centers vehicle routing problem

Journal of Cleaner Production

Volumn 144, Issue , 2017, Pages 203-219

  Wang, Yong ^a,b   Ma, Xiaolei ^c   Li, Zhibin ^d   Liu, Yong ^a   Xu, Maozeng ^a   Wang, Yinhai ^e  

^a CHONGQING JIAOTONG UNIVERSITY   (China)

^b UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

^c BEIHANG UNIVERSITY   (China)

^d SOUTHEAST UNIVERSITY   (China)

^e University of Washington   (United States)

Author keywords

Improved shapley value model; Integer programming model; Multi phase hybrid approach; Multiple center vehicle routing optimization; Profit distribution

Indexed keywords

CLUSTERING ALGORITHMS; COST REDUCTION; COSTS; DYNAMIC PROGRAMMING; GAME THEORY; HEURISTIC ALGORITHMS; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; LOGISTICS; PROFITABILITY; STRUCTURAL OPTIMIZATION; TRANSPORTATION; VEHICLE ROUTING; VEHICLES;

HYBRID APPROACH; INTEGER PROGRAMMING MODELS; PROFIT DISTRIBUTIONS; SHAPLEY VALUE; VEHICLE ROUTING OPTIMIZATION;

OPTIMIZATION;

EID: 85010840063     PISSN: 09596526     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jclepro.2017.01.001     Document Type: Article

References (60)

1. Ahmadizar, F., Zeynivand, M., Arkat, J., Two-level vehicle routing with cross-docking in a three-echelon supply chain: a genetic algorithm approach. Appl. Math. Model. 39:22 (2015), 7065–7081.
2. Allahyari, S., Salari, M., Vigo, D., A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem. Eur. J. Oper. Res. 242:3 (2015), 756–768.
3. Arokhlo, M.Z., Selamat, A., Hashim, S.Z.M., Afkhami, H., Modeling of route planning system based on Q value-based dynamic programming with multi-agent reinforcement learning algorithms. Eng. Appl. Artif. Intell. 29 (2014), 163–177.
4. Baldacci, R., Mingozzi, A., Roberti, R., Calvo, R.W., An exact algorithm for the two-echelon capacitated vehicle routing problem. Oper. Res. 61:2 (2013), 298–314.
5. Berger, S., Bierwirth, C., Solutions to the request reassignment problem in collaborative carrier network. Transp. Res. Part E Logist. Transp. Rev. 46:5 (2010), 627–638.
6. Bettinelli, A., Ceselli, A., Righini, G., A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transp. Res. Part C Emerg. Technol. 19:5 (2011), 723–740.
7. Bosona, T.G., Gebresenbet, G., Clustering building and logistics network integration of local food supply chain. Biosyst. Eng. 108:4 (2011), 293–302.
8. Boyer, V., Baz, D.E., Elkihel, M., A dynamic programming method with lists for the knapsack sharing problem. Comput. Indus. Eng. 61:2 (2011), 274–278.
9. Braekers, K., Caris, A., Janssens, G.K., Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problems with multiple depots. Transp. Res. Part B Methodol. 67 (2014), 166–186.
10. Cattaruzza, D., Absi, N., Feillet, D., Vidal, T., A memetic algorithm for the multi trip vehicle routing problem. Eur. J. Oper. Res. 236:3 (2014), 833–848.
11. Contardo, C., Martinelli, R., A new exact algorithm for the multi-depot routing problem under capacity and route length constraints. Discrete Optim. 12 (2014), 129–146.
12. Cordeau, J.F., Maischberger, M., A parallel iterated tabu search heuristic for vehicle routing problems. Comput. Oper. Res. 39:9 (2012), 2033–2050.
13. Crevier, B., Cordeau, J.F., Laporte, G., The multi-depot vehicle routing problem with inter-depot routes. Eur. J. Oper. Res. 176:2 (2007), 756–773.
14. Cruijssen, F., Borm, P., Fleuren, H., Hamers, H., Supplier-initiated outsourcing: a methodology to exploit synergy in transportation. Eur. J. Oper. Res. 207:2 (2010), 763–774.
15. Dai, B., Chen, H.X., Profit allocation mechanisms for carrier collaboration in pickup and delivery service. Comput. Indus. Eng. 62:2 (2012), 633–643.
16. Dayarian, I., Crainic, T.G., Gendreau, M., Rei, W., A column generation approach for a multi-attribute vehicle routing problem. Eur. J. Oper. Res. 241:3 (2015), 888–906.
17. Desai, S., Lim, G.J., Solution time reduction techniques of a stochastic dynamic programming approach for hazardous material route selection problem. Comput. Indus. Eng. 65:4 (2013), 634–645.
18. Dondo, R., Cerdá, J., A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur. J. Oper. Res. 176:3 (2007), 1478–1507.
19. Dondo, R., Cerdá, J., A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows. Comput. Chem. Eng. 33:2 (2009), 513–530.
20. Fikar, C., Hirsch, P., A matheuristic for routing real-world home service transport systems facilitating walking. J. Clean. Prod. 105 (2015), 300–310.
21. Frisk, M., Göthe-Lundgren, M., Jörnsten, K., Rönnqvist, M., Cost allocation in collaborative forest transportation. Eur. J. Oper. Res. 205:2 (2010), 448–458.
22. Govindan, K., Jafarian, A., Khodaverdi, R., Devika, K., Two-echelon multiple-vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food. Int. J. Prod. Econ. 152 (2014), 9–28.
23. Hafezalkotob, A., Makui, A., Cooperative maximum-flow problem under uncertainty in logistics networks. Appl. Math. Comput. 250:1 (2015), 593–604.
24. Hellström, M., Tsvetkova, A., Gustafsson, M., Wikström, K., Collaboration mechanisms for business models in distributed energy ecosystems. J. Clean. Prod. 102 (2015), 226–236.
25. Hemmelmayr, V.C., Cordeau, J.F., Crainic, T.G., An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput. Oper. Res. 39:12 (2012), 3215–3228.
26. Hernández, S., Peeta, S., A carrier collaboration problem for less-than-truckload carriers: characteristics and carrier collaboration model. Transp. A Transp. Sci. 10:4 (2014), 327–349.
27. Hernández, S., Peeta, S., Kalafatas, G., A less-than-truckload collaboration planning problem under dynamic capacities. Transp. Res. Part E Logist. Transp. Rev. 47:6 (2011), 933–946.
28. Ho, W., Ho, G.T.S., Ji, P., Lau, H.C.W., A hybrid genetic algorithm for the multi-depot vehicle routing problem. Eng. Appl. Artif. Intell. 21:4 (2008), 548–557.
29. Krajewska, M.A., Kopfer, H., Laporte, G., Ropke, S., Zaccour, G., Horizontal cooperation among freight carriers: request allocation and profit sharing. J. Oper. Res. Soc. 59 (2008), 1483–1491.
30. Kuo, Y.Y., Wang, C.C., A variable neighborhood search for the multi-depot vehicle routing problem with loading cost. Expert Syst. Appl. 39:8 (2012), 6949–6954.
31. Li, Y., Tan, W.R., Sha, R.L., The empirical study on the optimal distribution route of minimum carbon footprint of the retail industry. J. Clean. Prod. 112:5 (2016), 4237–4246.
32. Lin, C.K.Y., Kwok, R.C.W., Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data. Eur. J. Oper. Res. 175:3 (2006), 1833–1849.
33. Liu, P., Wu, Y.H., Xu, N., Allocating collaborative profit in less-than-truckload carrier alliance. J. Serv. Sci. Manag. 3:1 (2010), 143–149.
34. Liu, R., Jiang, Z.B., Fung, R.Y.K., Chen, F., Liu, X., Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration. Comput. Oper. Res. 37:5 (2010), 950–959.
35. Lozano, S., Moreno, P., Adenso-Díaz, B., Algaba, E., Cooperative game theory approach to allocating benefits of horizontal cooperation. Eur. J. Oper. Res. 229:2 (2013), 444–452.
36. Luo, J.P., Chen, M.R., Improved shuffled frog leaping algorithm and its multi-phase model for multi-depot vehicle routing problem. Expert Syst. Appl. 41:5 (2014), 2535–2545.
37. Manzini, R., A top-down approach and a decision support system for the design and management of logistic networks. Transp. Res. Part E Logist. Transp. Rev. 48:6 (2012), 1185–1204.
38. Mehrjerdi, Y.Z., Nadizadeh, A., Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands. Eur. J. Oper. Res. 229:1 (2013), 75–84.
39. Miranda, P.A., Garrido, R.A., Ceroni, J.A., e-Work based collaborative optimization approach for strategy logistic network design problem. Comput. Indus. Eng. 57:1 (2009), 3–13.
40. Mitra, S., A parallel clustering technique for the vehicle routing problem with split deliveries and pickups. J. Oper. Res. Soc. 59:11 (2008), 1532–1546.
41. Moghaddam, R.T., Makui, A., Mazloomi, Z., A new integrated mathematical model for a bi-objective multi-depot location-routing problem solved by a multi-objective scatter search algorithm. J. Manuf. Syst. 29:2–3 (2010), 111–119.
42. Nagarajan, M., Sošić, G., Game-theoretic analysis of cooperation among supply chain agents: review and extensions. Eur. J. Oper. Res. 187:3 (2008), 719–745.
43. Nagy, G., Salhi, S., Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur. J. Oper. Res. 162:1 (2005), 126–141.
44. Nagurney, A., A system-optimization perspective for supply chain network integration: the horizontal merge case. Transp. Res. Part E Logist. Transp. Rev. 45:1 (2009), 1–15.
45. Ng, W.P.Q., Lam, H.L., A supply network optimisation with functional clustering of industrial resources. J. Clean. Prod. 71 (2014), 87–97.
46. Özdamar, L., Demir, O., A hierarchical clustering and routing procedure for large scale disaster relief logistics planning. Transp. Res. Part E Logist. Transp. Rev. 48:3 (2012), 591–602.
47. Özener, O.Ö., Ergun, Ö., Allocating costs in a collaborative transportation procurement network. Transp. Sci. 42:2 (2008), 146–165.
48. Shapley, L.S., A value for n-person Games. Ann. Math. Stud. 28 (1953), 307–317.
49. Sheu, J.B., Lin, A.Y.S., Hierarchical facility network planning model for global network configurations. Appl. Math. Model. 31:6 (2012), 1048–1066.
50. Tatarakis, A., Minis, I., Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns. Eur. J. Oper. Res. 197:2 (2009), 557–571.
51. Tlili, T., Faiz, S., Krichen, S., A hybrid metaheuristic for the distance-constrained capacitated vehicle routing problem. Procedia Social Behav. Sci. 109 (2014), 779–783.
52. Tu, W., Fang, Z.X., Li, Q.Q., Shaw, S.L., Chen, B.Y., A bi-level Voronic diagram-based metaheuristic for a large-scale multi-depot vehicle routing problem. Transp. Res. Part E Logist. Transp. Rev. 61 (2014), 84–97.
53. Wang, Y., Ma, X.L., Lao, Y.T., Wang, Y.H., Mao, H.J., Vehicle routing problem: simultaneous deliveries and pickups with split loads and time windows. J. Transp. Res. Board 2378 (2013), 120–128.
54. Wang, Y., Ma, X.L., Lao, Y.T., Wang, Y.H., A fuzzy-based customer clustering approach with hierarchical structure for logistics network optimization. Expert Syst. Appl. 41:2 (2014), 521–534.
55. Wang, Y., Ma, X.L., Lao, Y.T., Yu, H.Y., Liu, Y., A two-stage heuristic method for vehicle routing problem with split deliveries and pickups. J. Zhejiang Univ. Sci. C 15:3 (2014), 200–210.
56. Wang, Y., Ma, X.L., Xu, M.Z., Liu, Y., Wang, Y.H., Two-echelon logistics distribution region partitioning problem based on a hybrid particle swarm optimization-genetic algorithm. Expert Syst. Appl. 42:12 (2015), 5019–5031.
57. Wang, Y., Ma, X.L., Xu, M.Z., Wang, L.K., Wang, Y.H., Liu, Y., A Methodology to Exploit Profit Allocation in Logistics Joint Distribution Network Optimization. 2015, Mathematical Problems in Engineering Article ID 827021, 15 pages.
58. Yücenur, G.N., Demirel, N.Ç., A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem. Expert Syst. Appl. 38:9 (2011), 11859–11865.
59. Zäpfel, G., Bögl, M., Multi-period vehicle routing and crew scheduling with outsourcing options. Int. J. Prod. Econ. 113:2 (2008), 980–996.
60. Zhu, X.Y., Garcia-Diaz, A., Jin, M.Z., Zhang, Y., Vehicle fuel consumption minimization in routing over-dimensioned and overweight trucks in capacitated transportation networks. J. Clean. Prod. 85 (2014), 331–336.