A pickup and delivery problem for ridesharing considering congestion

References

• Agatz, N. A. H., Erera, A., Savelsbergh, M. W. P. and Wang, X. 2012. Optimization for dynamic ride-sharing: a review, European Journal of Operational Research, 233, 295–303.
   Web of Science ®Google Scholar
• Bard, J. F. and Jarrah, A. I. 2009. Large-scale constrained clustering for rationalizing pickup and delivery operations, Transportation Research Part B: Methodological, 43, 542–561.
   Web of Science ®Google Scholar
• Berbeglia, G., Cordeau, J. F. and Laporte, G. 2010. Dynamic pickup and delivery problems, European Journal of Operational Research, 202, (1), 8–15.
   Web of Science ®Google Scholar
• Berbeglia, G., Cordeau, J. F. and Laporte, G. 2012. A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem, INFORMS Journal on Computing, 24, (3), 343–355.
   Web of Science ®Google Scholar
• Berbeglia, G., Cordeau, J. F., Gribkovskaia, I. and Laporte, G. 2007. Static pickup and delivery problems: a classification scheme and survey, Top, 15, 1–31.
   Web of Science ®Google Scholar
• Brandao, J. 2004. A tabu search algorithm for the open vehicle routing problem, European Journal of Operational Research, 157, 552–564.
   Web of Science ®Google Scholar
• Campbell, A. M. and Savelsbergh, M. 2004. Efficient insertion heuristics for vehicle routing and scheduling problems, Transportation Science, 38, 369–378.
   Web of Science ®Google Scholar
• Carabetti, E. G., de Souza, S. R., Fraga, M. C. P. and Gama, P. H. A. 2010. An application of the ant colony system metaheuristic to the vehicle routing problem with pickup and delivery and time windows, in 2010 Eleventh Brazilian Symposium on Neural Networks, 176–181; Sao Paulo, IEEE Computer Society.
   Google Scholar
• Catay, B. 2009. Ant colony optimization and its application to the vehicle routing problem with pickups and deliveries, in Natural intelligence for scheduling, planning and packing problems, (eds. Chiong R. and Dhakal S.., 219–244; Berlin, Springer.
   Google Scholar
• Cordeau, J. F. 2006. A branch-and-cut algorithm for the dial-a-ride problem, Operations Research, 54, 573–586.
   Web of Science ®Google Scholar
• Cordeau, J. F. and Laporte, G. 2003. A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transportation Research Part B: Methodological, 37, 579–594.
   Web of Science ®Google Scholar
• Cordeau, J. F. and Laporte, G. 2005. Tabu search heuristic for the vehicle routing problem, in Metaheuristic optimization via memory and evolution: tabu search and scatter search, (eds. Rego C. and Alidaee B.., 145–163; Boston, Kluwer.
   Google Scholar
• Cordeau, J. F. and Laporte, G. 2007. The dial-a-ride problemml: models and algorithms, Annals of Operations Research, 153, 29.
   Web of Science ®Google Scholar
• Cordeau, J. F., Laporte, G. and Ropke, S. 2008. Recent models and algorithms for one-to-one pickup and delivery problems, in The Vehicle Routing Problemml: Latest Advances and New Challenges, Vol. Vol. 43, 327–357; Berlin, Springer.
   Google Scholar
• Desrosiers, J., Dumas, Y. and Soumis, F. 1986. A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows, American Journal of Mathematical and Management Sciences, 6, 301–325.
   Google Scholar
• Desrosiers, J., Dumas, Y., Soumis, F., Taillefer, S. and Villeneuve, D. 1991. An algorithm for mini-clustering in handicapped transport, in Technical Report G-91-02. GERAD, HEC, Montréal.
   Google Scholar
• Diana, M. and Dessouky, M. M. 2004. A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows, Transportation Research Part B: Methodological, 38, 539–557.
   Web of Science ®Google Scholar
• Dumas, Y., Desrosiers, J. and Soumis, F. 1989. Large scale multi-vehicle dial-a-ride problems, in Research Report G-89-30. GERAD, HEC, Montréal.
   Google Scholar
• Furuhata, M., Dessouky, M. M., Ordóñez, F., Brunet, M., Wang, X. and Koenig, S. 2013. Ridesharing: the state-of-the-art and future directions, Transportation Research Part B: Methodological, 57, 28–46.
   Web of Science ®Google Scholar
• Hosny, M. I. and Mumford, C. L. 2010. The single vehicle pickup and delivery problem with time windows: intelligent operators for heuristic and metaheuristic algorithms, Journal of Heuristics, 16, 417–439.
   Web of Science ®Google Scholar
• Ioachim, I., Desrosiers, J., Dumas, Y., Solomon, M. M. and Villeneuve, D. 1995. A request clustering algorithm for door-to-door handicapped transportation, Transportation Science, 29, 63–78.
   Web of Science ®Google Scholar
• Jaw, J. J., Odoni, A. R., Psaraftis, H. N. and Wilson, N. H. M. 1986. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows, Transportation Research Part B: Methodological, 20, 243–257.
   Web of Science ®Google Scholar
• Lenstra, J. K. and Rinnooy Kan, A. H. G. 1981. Complexity of vehicle routing and scheduling problems, Networks, 11, 221–227.
   Web of Science ®Google Scholar
• Levy, J. I., Buonocore, J. J. and Von Stackelberg, K. 2010. Evaluation of the public health impacts of traffic congestion: a health risk assessment, Environmental Health, 9, 65–76.
   PubMed Web of Science ®Google Scholar
• Li, H. and Lim, A. 2001. A metaheuristic for the pickup and delivery problem with time windows, in Proceedings 13th IEEE ICTAI 2001, 160–167; Los Alamitos, CA, IEEE Computer Society.
   Google Scholar
• Los Angeles County Metropolitan Transportation Authority. 2002. HOV performance program evaluation report. Metro. Available at: < http://www.metro.net/projects_studies/hov/images/hov_final_evaluation_report.pdf>. [Accessed May 21, 2014].
   Google Scholar
• Lu, Q. and Dessouky, M. M. 2004. An exact algorithm for the multiple vehicle pickup and delivery problem, Transportation Science, 38, 503–514.
   Web of Science ®Google Scholar
• Lu, Q. and Dessouky, M. M. 2006. A new insertion-based construction heuristic for solving the pickup and delivery problem with hard time windows, European Journal of Operational Research, 175, 672–687.
   Web of Science ®Google Scholar
• Nanry, W. P. and Barnes, J. W. 2000. Solving the pickup and delivery problem with time windows using reactive tabu search, Transportation Research Part B: Methodological, 34, 107–121.
   Web of Science ®Google Scholar
• Office of Highway Policy Information. 2011. Toll facilities in the United States, federal highway administration. Available at: < http://www.fhwa.dot.gov/policyinformation/tollpage/cover.cfm#toc>. [Accessed April 6, 2013].
   Google Scholar
• Parragh, S. N., Doerner, K. F. and Hartl, R. F. 2010. Variable neighborhood search for the dial-a-ride problem, Computers and Operations Research, 37, 1129–1138.
   Web of Science ®Google Scholar
• Potvin, J. and Rousseau, J. 1992. Constraint-directed search for the advanced request dial-a-ride problem with service quality constraints, in Computer science and operations research: new developments in their interfaces, (eds O. Balci, R. Sharda and S. A. Zenios), 457–474; Oxford, Pergamon Press.
   Google Scholar
• Psaraftis, H. N. 1980. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem, Transportation Science, 14, 130–154.
   Web of Science ®Google Scholar
• Psaraftis, H. N. 1983. An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows, Transportation Science, 17, 351–357.
   Web of Science ®Google Scholar
• Ropke, S. and Cordeau, J. F. 2009. Branch and cut and price for the pickup and delivery problem with time windows, Transportation Science, 43, 267–286.
   Web of Science ®Google Scholar
• Ropke, S., Cordeau, J. F. and Laporte, G. 2007. Models and branch-and-cut algorithms for pickup and delivery problems with time windows, Networks, 49, 258–272.
   Web of Science ®Google Scholar
• Roy, S., Chapleau, L., Ferland, J. A., Lapalme, G. and Rousseau, J. M. 1983. The construction of routes and schedules for the transportation of the handicapped, in Technical Report CRT-308. Universite de Montreal, Montreal.
   Google Scholar
• Santos, A., McGuckin, N., Nakamoto, H. Y., Gray, D. and Liss, S. 2011. Summary of travel trends: 2009 national household travel survey, in Technical Report. US Department of Transportation Federal Highway Administration, Washington, DC.
   Google Scholar
• Savelsbergh, M. W. P. 1992. The vehicle routing problem with time windows: minimizing route duration, ORSA Journal on Computing, 4, 146–154.
   Google Scholar
• Schrank, D., Eisele, B. and Lomax, T. 2012. TTI's 2012 urban mobility report. Texas Transportation Institute, Texas A&M University. Available at: < http://mobility.tamu.edu/ums/>. [Accessed May 21, 2014].
   Google Scholar
• Sombuntham, P. and Kachitvichyanukul, V. 2010. A particle swarm optimization algorithm for multi-depot vehicle routing problem with pickup and delivery requests, in International Multiconference of Engineers and Computer Scientists 2010. Hong Kong.
   Google Scholar
• Wong, K. I. and Bell, M. G. H. 2006. Solution of the dial-a-ride problem with multi-dimensional capacity constraints, International Transaction in Operational Research, 13, 195–208.
   Google Scholar
• Xiang, Z., Chu, C. and Chen, H. 2006. A fast heuristic for solving a large-scale dial-a-ride problem under complex constraints, European Journal of Operational Research, 174, 1117–1139.
   Web of Science ®Google Scholar