The ridematching problem with time windows in dynamic ridesharing: A model and a genetic algorithm

2012 IEEE Congress on Evolutionary Computation, CEC 2012

Volumn , Issue , 2012, Pages

  Herbawi, Wesam ^a   Weber, Michael ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; ENVIRONMENTAL POLLUTIONS; ILLINOIS; MOBILE HANDHELD DEVICES; OPTIMIZATION PROBLEMS; RIDE-SHARING; TIME SCHEDULES; TIME WINDOWS; TRAVEL COSTS; TRAVEL DISTANCE; TRAVEL SURVEYS;

GENETIC ALGORITHMS; TRANSPORTATION;

PROBLEM SOLVING;

EID: 84866873291     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2012.6253001     Document Type: Conference Paper

References (14)

1. N. Agatz, A. Erera, M. Savelsbergh, and X. Wang, "Sustainable passenger transportation: Dynamic ride-sharing," Erasmus Research Inst. of Management (ERIM), Erasmus Uni., Rotterdam, Tech. Rep., 2010.
2. N. A. Agatz, A. L. Erera, M. W. Savelsbergh, and X. Wang, "Dynamic ride-sharing: A simulation study in metro atlanta," Transportation Research Part B: Methodological, vol. 45, no. 9, pp. 1450-1464, 2011.
3. J. Baugh, G. Kakivaya, and J. Stone, "Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing," Engineering Optimization, vol. 30, no. 2, pp. 91-123, 1998.
4. N. Chan and S. Shaheen, "Ridesharing in north america: Past, present, and future," Transportation Research Board Annual Meeting, 2011.
5. W. Herbawi and M. Weber, "Ant colony vs. genetic multiobjective route planning in dynamic multi-hop ridesharing," in Tools with Artificial Intelligence (ICTAI), 2011 IEEE Conference, 2011.
6. W. Herbawi and M. Weber, "Comparison of multiobjective evolutionary algorithms for solving the multiobjective route planning in dynamic multi-hop ridesharing," in Evolutionary Computation (CEC), 2011 IEEE Congress on, june 2011, pp. 2099-2106.
7. J. Jaw, A. Odoni, H. Psaraftis, and N. Wilson, "A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows," Transportation Research Part B: Methodological, vol. 20, no. 3, pp. 243-257, 1986.
8. R. Jorgensen, "Dial-a-ride," Ph.D. dissertation, Technical University of Denmark, 2002.
9. E. Kamar and E. Horvitz, "Collaboration and shared plans in the open world: studies of ridesharing," in International Joint Conference on Artificial intelligence (IJCAI), 2009. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2009, pp. 187-194.
10. J. L. R. Jorgensen and K. Bergvinsdottir, "Solving the dial-a-ride problem using genetic algorithms," Journal of the Operational Research Society, vol. 58, p. 13211331, 2007.
11. R. W. Sinnott, "Virtues of the haversine," Sky and Telescope, Vol.68:2, P.158, 1984,
12. vol. 62, no. 2, p. 158, 1984.
13. M. Solomon, "Algorithms for the vehicle routing and scheduling problems with time window constraints," Operations Research, vol. 35, pp. 254-265, 1987.
14. P. Toth and D. Vigo, Eds., The vehicle routing problem. Siam, 2002.