Comparison of three Algorithms for solving the Convergent Demand Responsive Transportation Problem

IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

Volumn , Issue , 2006, Pages 1096-1101

  Chevrier, Rémy ^a   Canalda, Philippe ^b   Chatonnay, Pascal ^b   Josselin, Didier ^a  

^a UNIVERSITY OF AVIGNON   (France)

^b UNIVERSITÉ DE FRANCHE COMTÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; GENETIC ALGORITHMS; PROBLEM SOLVING; TREES (MATHEMATICS);

CONVERGENT DEMAND RESPONSIVE TRANSPORT PROBLEM (CDRTP); GEOGRAPHY LABORATORIES;

MOTOR TRANSPORTATION;

EID: 41849096416     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/itsc.2006.1707368     Document Type: Conference Paper

References (22)

1. G. Ambrosino, J. Nelson, and M. Romnazzo. Demand Responsive Transport Services: Towards the flexible Mobility Agency. Rome: ENEA, 2004, 325 p.
2. B. Julstrom and G. Raidl. Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. In Symposium on Applied Computing, pages 547-552, ACM Press, 2002.
3. Bryant A. Julstrom and Günther R. Raidl. A permutation-coded evolutionary algorithm for bounded-diameter minimum spanning tree problem. In 2003 Genetic and Evolutionary Computation Conference's Workshops Proceedings, Workshop on Analysis And Design of Representations, 2003.
4. E. Castex, R. Chevrier, D. Josselin, and P. Canalda. Le transport la demande en multi-convergence. In SAGEO'06, Strasbourg, France, sep 2006, 13 pages, to be published.
5. P. Chalasani and R. Motwani. Approximating capacitated routing and delivery problems. Technical report, Stanford University, 1995.
6. R. Chevrier, P. Canalda, P. Chatonnay, and D. Josselin. An oriented convergent mutation operator for solving a scalable convergent demand responsive transport problem. In ICSSSM'06, IEEE Int. Conf. on Service Systems and Service Management, Troyes, France, Oct. 2006, 6 pages, to be published.
7. R. Chevrier, P. Canalda, P. Chatonnay, and D. Josselin. Vers une solution robuste et flexible du transport à la demande en convergence : étude trans-disciplinaire et mise en oeuvre. In Actes du Workshop International : Logistique et Transport 2006 (LT 2006), pages 49-55, Hammamet, Tunisie, Apr. 2006.
8. D. Goldberg, Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, 1989.
9. D. Montana, M. Brinn, G. Bidwell, and S. Moore, Genetic algorithms for complex, real-time scheduling. In IEEE Conference on Systems, Man and Cybernetics, volume 3, pages 2213-2218, 1998.
10. D. Whitley, A genetic algorithm tutorial. Statistics and Computing, 4:65-85, 1994.
11. Günther R. Raidl and Bryant A. Julstrom. Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In SAC '03: Proceedings of the 2003 ACM symposium on Applied computing, pages 747-752, New York, NY, USA, 2003, ACM Press.
12. K.A. DeJong and W.M. Spears. Using genetic algorithms to solve np-complete problems. In Proceedings of the Third International Conference on Genetic Algorithms, pages 124-132, 1989.
13. M. Bielli, M. Caramia, and P. Carotenuto. Genetic algorithms in bus network optimization. Transportation Research, C: 19-34, 2002.
14. M. Forbes. Capacitated vehicle routing and the k-delivery n-traveling salesman problem. Master's thesis. Montgomery BlairHigh School, 2004.
15. M. Wall. Genetic algorithm library. http://lancet.mit.edu/ga/.
16. M.E.T. Horn, Fleet scheduling and dispatching for demand-responsive passenger services. Transportation Research, 10(1):35-63, 2002.
17. M.W.P. Savelsberg and M. Sol. The general pickup and delivery problem. Transportation Science, 1(29): 17-29, 1995.
18. N. Christophides, A. Mingozzi, and P. Toth. Exact algorithms for solving the vehicle routing problem based on spanning trees and shortest path relaxations. Mathematical Programming, 20:255-282, 1981.
19. Olli Bräysy and Michel Gendreau. Vehicle routing problem with time windows, part I and II. Transportation Science, 39(1): 104-118 and 119-139, 2005.
20. J. Renaud, F. F. Boctor, and J. Ouenniche. A heuristic for the pickup and delivery traveling salesman problem. Comput. Oper. Res., 27(9):905-916, 2000.
21. S. Arora, Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM, 45(5):753-782, 1998.
22. TCRP, D. Koffman. Operational experiences with flexible transit services, a synthesis of transit practice. Technical report, Washington : National Academy Press, Aug. 2004, 71p., http://www.trb.org/publications/tcrp/ tcrp_syn_53.pdf.