Operations Research Proceedings 2016 pp 329-336 | Cite as
Request-Allocation in Dynamic Collaborative Transportation Planning Problems
Abstract
Several publications on collaborative transportation planning problems (CTPPs) focus on schemes that ensure a fair assignment of collaborative profits. However, it is seldom taken into account that an even allocation of transportation resources (e.g. transportation requests) is also responsible for the viability and stability of horizontal carrier coalitions; particularly if dynamic CTPPs are considered. In this paper, the winner determination problem (WDP) of an auction-based request exchange is restricted by lower and upper bounds that respect an equality between transferred and received requests for carriers. In a computational study, the restricted WDP is applied to the dynamic collaborative traveling salesman problem.
Notes
Acknowledgements
The research was supported by the German Research Foundation (DFG) as part of the project “Kooperierende Rundreiseplanung bei rollierender Planung”.
References
- 1.Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transp. Sci. 39(2), 188–205 (2005)CrossRefGoogle Scholar
- 2.Pillac, V., Gendreau, M., Guret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1–11 (2013)CrossRefGoogle Scholar
- 3.Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563–581 (1977)CrossRefGoogle Scholar
- 4.Schwind, M., Gujo, O., Vykoukal, J.: A combinatorial intra-enterprise exchange for logistics services. Inf. Syst. E-Bus. Manag. 7(4), 447–471 (2009)CrossRefGoogle Scholar
- 5.Shapley, L.: A value for n-person games. In: Kuhn, H., Tucker, A. (eds.) Contributions to the Theory of Games II 28, pp. 307–317. Princeton University Press, Princenton, NJ (1957)Google Scholar
- 6.Wang, X., Kopfer, H.: Rolling horizon planning for a dynamic collaborative routing problem with full-truckload pickup and delivery requests. Flex. Serv. Manuf. J. 27(4), 1–25 (2015)CrossRefGoogle Scholar