3Ferguson E. The rise and fall of the American c.arpool :1970 - 1990 [J]. Transportation .1997,24(4) : 349 - 376.
4Dailey D J, Loseff D,Meyers D. Seattle smart traveler:Dynamic ridematching on the World Wide Web [J].Transportation Research Part C,1999,7(1) : 17 - 32.
5Buliung R N, Soltys K,Bui R, et al. Catching a ride on theinformation super-highway : Toward an understanding ofinternet-based carpool formation and use [J].Transportation ? 2010,37(6) : 849 - 873.
6Bianchessi N,Righini G. Heuristic algorithms for the vehiclerouting problem with simultaneous pick-up and delivery [J].Computers Operations Research,2007,34(2) : 578 —594.
7Cordeau J F. A branch-and-cut algorithm for the dial-a-rideproblem [J]. Operations Research , 2006 , 54(3): 573 — 586.
8Parragh S N. Introducing heterogeneous users and vehiclesinto models and algorithms for the dial-a-ride problem [J].Transportation Research Part C : Emerging Technologies,2011, 19(5) : 912 - 930.
9Hame L. An adaptive insertion algorithm for thesingle-vehicle dial-a-ride problem with narrow time windows[J]. European Juurnal o f Operational Research,2011,209(1): 11-22.
10Alain A.Jacquemin. Urban Development and New Town in the Third World[M].Ashgate Publishing,1999.
