Optimization models for fair horizontal collaboration in demand-responsive transportation

Aloui, 2021, Systematic literature review on collaborative sustainable transportation: overview, analysis and perspectives, Transp. Res. Interdiscip. Perspect., 9 Amirgholy, 2016, Demand responsive transit systems with time-dependent demand: user equilibrium, system optimum, and management strategy, Transp. Res. B, 92, 234, 10.1016/j.trb.2015.11.006 Atasoy, 2015, The concept and impact analysis of a flexible mobility on demand system, Transp. Res. C, 56, 373, 10.1016/j.trc.2015.04.009 Basso, 2019, A survey on obstacles and difficulties of practical implementation of horizontal collaboration in logistics, Int. Trans. Oper. Res., 26, 775, 10.1111/itor.12577 Braekers, 2014, Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots, Transp. Res. B, 67, 166, 10.1016/j.trb.2014.05.007 Cordeau, 2006, A branch-and-cut algorithm for the dial-a-ride problem, Oper. Res., 54, 573, 10.1287/opre.1060.0283 Cruijssen, 2007, Horizontal cooperation in logistics: opportunities and impediments, Transp. Res. E, 43, 129, 10.1016/j.tre.2005.09.007 Defryn, 2016, The selective vehicle routing problem in a collaborative environment, European J. Oper. Res., 250, 400, 10.1016/j.ejor.2015.09.059 Desrochers, 1991, Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints, Oper. Res. Lett., 10, 27, 10.1016/0167-6377(91)90083-2 Desrochers, 1987 Desrosiers, 1995, Time constrained routing and scheduling, Handbooks Oper. Res. Management Sci., 8, 35 Fernández, 2016, On the collaboration uncapacitated arc routing problem, Comput. Oper. Res., 67, 120, 10.1016/j.cor.2015.10.001 Fernández, 2018, The shared customer collaboration vehicle routing problem, European J. Oper. Res., 265, 1078, 10.1016/j.ejor.2017.08.051 Gansterer, 2018, Collaborative vehicle routing: a survey, European J. Oper. Res., 268, 1, 10.1016/j.ejor.2017.10.023 Gansterer, 2020, Shared resources in collaborative vehicle routing, TOP, 1, 10.1007/s11750-020-00541-6 Gansterer, 2021, The prisoners’ dilemma in collaborative carriers’ request selection, CEJOR Cent. Eur. J. Oper. Res., 29, 73, 10.1007/s10100-020-00717-2 Gansterer, 2021, Assignment constraints in shared transportation services, Ann. Oper. Res., 305, 513, 10.1007/s10479-020-03522-x 2020 Gschwind, 2019, Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem, Transp. Sci., 10.1287/trsc.2018.0837 Guajardo, 2016, A review on cost allocation methods in collaborative transportation, Int. Trans. Oper. Res., 23, 371, 10.1111/itor.12205 Ho, 2018, A survey of dial-a-ride problems: Literature review and recent developments, Transp. Res. B, 111, 395, 10.1016/j.trb.2018.02.001 Lozano, 2013, Cooperative game theory approach to allocating benefits of horizontal cooperation, European J. Oper. Res., 229, 444, 10.1016/j.ejor.2013.02.034 Martinez, 2017, Assessing the impacts of deploying a shared self-driving urban mobility system: An agent-based model applied to the city of Lisbon, Portugal, Int. J. Transp. Sci. Technol., 6, 13, 10.1016/j.ijtst.2017.05.005 Mladenović, 1997, Variable neighborhood search, Comput. Oper. Res., 24, 1097, 10.1016/S0305-0548(97)00031-2 Molenbruch, 2017, Benefits of horizontal cooperation in dial-a-ride services, Transp. Res. E, 107, 97, 10.1016/j.tre.2017.09.001 Molenbruch, 2017, Typology and literature review for dial-a-ride problems, Ann. Oper. Res., 1 Muller, L.F., 2009. An adaptive large neighborhood search algorithm for the resource-constrained project scheduling problem. In: Proceedings of the VIII Metaheuristics International Conference (MIC). Mulley, 2009, Flexible transport services: A new market opportunity for public transport, Res. Transp. Econ., 25, 39, 10.1016/j.retrec.2009.08.008 Özener, 2008, Allocating costs in a collaborative transportation procurement network, Transp. Sci., 42, 146, 10.1287/trsc.1070.0219 Pisinger, 2010, Large neighborhood search, 399 Ropke, 2007, Models and branch-and-cut algorithms for pickup and delivery problems with time windows, Networks, 49, 258, 10.1002/net.20177 Ropke, 2006, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transp. Sci., 40, 455, 10.1287/trsc.1050.0135 Shaw, 1998, Using constraint programming and local search methods to solve vehicle routing problems, 417 Turkeš, 2021, Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search, European J. Oper. Res., 292, 423, 10.1016/j.ejor.2020.10.045 Verdonck, 2013, Collaborative logistics from the perspective of road transportation companies, Transp. Rev., 33, 700, 10.1080/01441647.2013.853706