Dynamic ridesharing: Is there a role for dedicated drivers?

Agatz, 2011, Dynamic ride-sharing: a simulation study in metro atlanta, Transportation Research Part B, 45, 1450, 10.1016/j.trb.2011.05.017 Agatz, 2012, Optimization for dynamic ride-sharing: a review, EJOR, 223, 295, 10.1016/j.ejor.2012.05.028 Alt, 2010, Location-based crowdsourcing: extending crowdsourcing to the real world, 13 Archetti, 2009, The capacitated team orienteering and profitable tour problems, Journal of the Operational Research Society, 60, 831, 10.1057/palgrave.jors.2602603 Archetti, 2014, Vehicle routing problems with profits, Vehicle Routing: Problems, Methods, and Applications, 18, 273, 10.1137/1.9781611973594.ch10 Boussier, 2007, An exact algorithm for team orienteering problems, 4OR, 5, 211, 10.1007/s10288-006-0009-1 Butt, 1999, An optimal solution procedure for the multiple tour maximum collection problem using column generation, Computers & Operations Research, 26, 427, 10.1016/S0305-0548(98)00071-9 Chaves, 2007, Hybrid metaheuristics for solving the prize collecting traveling salesman problem, Produção, 17, 263 Dell’Amico, 1998, A lagrangian heuristic for the prize collecting traveling salesman problem, Annals of Operations Research, 81, 289, 10.1023/A:1018961208614 Feillet, 2005, Traveling salesman problems with profits, Transportation Science, 39, 188, 10.1287/trsc.1030.0079 Fischetti, 1988, An additive approach for the optimal solution of the prize-collecting traveling salesman problem, vol. 16 Furuhata, 2013, Ridesharing: the state-of-the-art and future directions, Transportation Research Part B, 57, 28, 10.1016/j.trb.2013.08.012 Gomes, 2000, An hybrid GRASP+VND metaheuristic for the prize-collecting traveling salesman problem, XXXII Simpósio Brasileiro de Pesquisa Operacional, 1657 Hosni, 2014, The shared-taxi problem: formulation and solution methods, Transportation Research Part B, 70, 303, 10.1016/j.trb.2014.09.011 Hu, 2014, An iterative three-component heuristic for the team orienteering problem with time windows, European Journal of Operational Research, 232, 276, 10.1016/j.ejor.2013.06.011 Jozefowiez, 2008, Multi-objective vehicle routing problems, European Journal of Operational Research, 189, 293, 10.1016/j.ejor.2007.05.055 Karabulut, K., Tasgetiren, M.F., 2013. A discrete artificial bee colony algorithm for the team orienteering problem with time windows. In: Computational Intelligence in Production and Logistics Systems (CIPLS), 2013 IEEE Workshop on, April 2013, pp. 99–106. Kim, 2013, An augmented large neighborhood search method for solving the team orienteering problem, Expert Systems with Applications, 40, 3065, 10.1016/j.eswa.2012.12.022 Labadie, 2012, The team orienteering problem with time windows: an lp-based granular variable neighborhood search, European Journal of Operational Research, 220, 15, 10.1016/j.ejor.2012.01.030 Lin, 2013, Solving the team orienteering problem using effective multi-start simulated annealing, Applied Soft Computing, 13, 1064, 10.1016/j.asoc.2012.09.022 Lin, 2012, A simulated annealing heuristic for the team orienteering problem with time windows, European Journal of Operational Research, 217, 94, 10.1016/j.ejor.2011.08.024 Pedersen, J., Kocsis, D., Tripathi, A., Tarrell, A., Weerakoon, A., Tahmasbi, N., Xiong, Jie, Deng, Wei, Oh, Onook, De Vreede, G.-J., 2013. Conceptual foundations of crowdsourcing: a review of IS research. In: System Sciences (HICSS), 2013 46th Hawaii International Conference on, January 2013, pp. 579–588. Pedro, 2013, A tabu search approach for the prize collecting traveling salesman problem, Electronic Notes in Discrete Mathematics, 41, 261, 10.1016/j.endm.2013.05.101 Vansteenwegen, 2009, Iterated local search for the team orienteering problem with time windows, Computers & Operations Research, 36, 3281, 10.1016/j.cor.2009.03.008