摘要:
参考文章(19)
Bernhard Nebel, Alexander Kleiner, Vittorio Amos Ziparo, A mechanism for dynamic ride sharing based on parallel auctions international joint conference on artificial intelligence. pp. 266- 272 ,(2011) , 10.5591/978-1-57735-516-8/IJCAI11-055
Gerhard J. Woeginger, Ulrich Pferschy, Rüdiger Rudolf, Some geometric clustering problems Nordic Journal of Computing. ,vol. 1, pp. 246- 263 ,(1994)
Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl, Demand Responsive Transportation Wiley Encyclopedia of Operations Research and Management Science. ,(2011) , 10.1002/9780470400531.EORMS0243
Dennis Luxen, Florian Drews, Multi-Hop Ride Sharing annual symposium on combinatorial search. ,(2013)
Wesam Herbawi, Michael Weber, Evolutionary multiobjective route planning in dynamic multi-hop ridesharing european conference on evolutionary computation in combinatorial optimization. pp. 84- 95 ,(2011) , 10.1007/978-3-642-20364-0_8
Endre Boros, Vladimir Gurvich, Steven Jaslar, Daniel Krasner, Stable matchings in three-sided systems with cyclic preferences Discrete Mathematics. ,vol. 289, pp. 1- 10 ,(2004) , 10.1016/J.DISC.2004.08.012
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness ,(1979)
Niels Agatz, Alan Erera, Martin Savelsbergh, Xing Wang, Optimization for dynamic ride-sharing: A review European Journal of Operational Research. ,vol. 223, pp. 295- 303 ,(2012) , 10.1016/J.EJOR.2012.05.028
Jean-François Cordeau, A Branch-and-Cut Algorithm for the Dial-a-Ride Problem Operations Research. ,vol. 54, pp. 573- 586 ,(2006) , 10.1287/OPRE.1060.0283
Harold N. Gabow, Data structures for weighted matching and nearest common ancestors with linking symposium on discrete algorithms. pp. 434- 443 ,(1990) , 10.5555/320176.320229