Heuristics for Improving Trip-Vehicle Fitness in On-demand Ride-Sharing Systems
暂无分享,去创建一个
Karl-Heinz Krempels | Sevket Gökay | Andreas Heuvels | Sevket Gökay | Karl-Heinz Krempels | Andreas Heuvels
[1] Karl-Heinz Krempels,et al. Implementation and Evaluation of an On-Demand Bus System , 2017, VEHITS.
[2] G. Laporte. The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .
[3] Gilbert Laporte,et al. The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .
[4] Sophie N. Parragh,et al. A survey on pickup and delivery problems Part I : Transportation between customers and depot , 2007 .
[5] Gilbert Laporte,et al. A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..
[6] Fabio Roli,et al. Dynamic Linear Combination of Two-Class Classifiers , 2010, SSPR/SPR.
[7] David Pisinger,et al. A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..
[8] Hiroyuki Yamato,et al. Innovative on-demand bus system in Japan , 2010 .
[9] M. Sol. The general pickup and delivery problem , 2010 .
[10] Fred Collopy,et al. Automatic Identification of Time Series Features for Rule-Based Forecasting , 2001 .
[11] Gopala Krishna Reddy Kakivaya,et al. INTRACTABILITY OF THE DIAL-A-RIDE PROBLEM AND A MULTIOBJECTIVE SOLUTION USING SIMULATED ANNEALING , 1998 .
[12] Jean-François Cordeau,et al. VRP with Time Windows , 1999, The Vehicle Routing Problem.
[13] Susan Shaheen,et al. Automated Vehicles, On-Demand Mobility, and Environmental Impacts , 2015 .
[14] H. Psaraftis. An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .
[15] Jean-François Cordeau,et al. A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..
[16] Gilbert Laporte,et al. Models and branch-and-cut algorithms for pickup and delivery problems with time windows , 2007 .
[17] El-Houssaine Aghezzaf,et al. An exact algorithm for the single-vehicle cyclic inventory routing problem , 2010 .
[18] Itf. Urban Mobility System Upgrade: How shared self-driving cars could change city traffic , 2015 .
[19] Adam N. Letchford,et al. A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..
[20] Bruce L. Golden,et al. The open vehicle routing problem: Algorithms, large-scale test problems, and computational results , 2007, Comput. Oper. Res..
[21] Juliana Freire,et al. STaRS: Simulating Taxi Ride Sharing at Scale , 2017, IEEE Transactions on Big Data.
[22] R M Jorgensen,et al. Solving the Dial-a-Ride problem using genetic algorithms , 2007, J. Oper. Res. Soc..
[23] Emilio Frazzoli,et al. On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment , 2017, Proceedings of the National Academy of Sciences.
[24] Martin W. P. Savelsbergh,et al. Local search in routing problems with time windows , 1984 .
[25] Gilbert Laporte,et al. The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..
[26] Jacques Desrosiers,et al. A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .
[27] Nigel H. M. Wilson,et al. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .
[28] Robert L. Winkler,et al. The effect of nonstationarity on combined forecasts , 1992 .
[29] Gilbert Laporte,et al. Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem , 2004, Parallel Comput..
[30] Amin Coja-Oghlan,et al. A Hard Dial-a-Ride Problem that is Easy on Average , 2005, J. Sched..
[31] Oli B. G. Madsen,et al. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives , 1995, Ann. Oper. Res..
[32] I. L. Gørtz. Hardness of Preemptive Finite Capacity Dial-a-Ride , 2006, APPROX-RANDOM.