Dynamic Taxi and Ridesharing: A Framework and Heuristics for the Optimization Problem
暂无分享,去创建一个
[1] Niels A. H. Agatz,et al. The Value of Optimization in Dynamic Ride-Sharing: A Simulation Study in Metro Atlanta , 2010 .
[2] Chi-Chung Tao,et al. Dynamic Taxi-Sharing Service Using Intelligent Transportation System Technologies , 2007, 2007 International Conference on Wireless Communications, Networking and Mobile Computing.
[3] R. Sinnott. Virtues of the Haversine , 1984 .
[4] Sergiy Butenko,et al. 2012 Journal of Global Optimization best paper award , 2013, Journal of Global Optimization.
[5] George S. Tombras,et al. A Framework for Dynamic Car and Taxi Pools with the Use of Positioning Systems , 2009, 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns.
[6] Celso C. Ribeiro,et al. Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.
[7] Michael Weber,et al. A genetic and insertion heuristic algorithm for solving the dynamic ridematching problem with time windows , 2012, GECCO '12.
[8] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[9] Peter Sanders,et al. Computing Many-to-Many Shortest Paths Using Highway Hierarchies , 2007, ALENEX.
[10] Gilbert Laporte,et al. The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..