메뉴 건너뛰기




Volumn 58, Issue 10, 2007, Pages 1321-1331

Solving the dial-a-ride problem using genetic algorithms

Author keywords

Dial a Ride; Heuristics; Specialized transportation

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; OPERATIONS RESEARCH; QUALITY OF SERVICE; ROUTING ALGORITHMS;

EID: 35448994913     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602287     Document Type: Article
Times cited : (155)

References (11)
  • 1
    • 0031680443 scopus 로고    scopus 로고
    • Intractability of the Dial-a-Ride problem and a multiobjective solution using simulated annealing
    • Baugh Jr JW, Kakivaya DKR and Stone JR (1998). Intractability of the Dial-a-Ride problem and a multiobjective solution using simulated annealing. Eng Optim 30: 91-124.
    • (1998) Eng Optim , vol.30 , pp. 91-124
    • Baugh Jr, J.W.1    Kakivaya, D.K.R.2    Stone, J.R.3
  • 3
    • 4243951550 scopus 로고    scopus 로고
    • Telebus Berlin: Vehicle scheduling in a dial-a-ride system
    • Technical report, Konrad-Zuse-Zentrum für Informationstechnik, Berlin
    • Bomdorfer R, Grötschel M, Klostermeier F and Kuttner C (1997). Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Technical report, Konrad-Zuse-Zentrum für Informationstechnik, Berlin.
    • (1997)
    • Bomdorfer, R.1    Grötschel, M.2    Klostermeier, F.3    Kuttner, C.4
  • 4
    • 0041194626 scopus 로고    scopus 로고
    • A tabu search heuristic for periodic and multi-depot vehicle routing problems
    • Cordeau JF, Gendrau M and Laporte G (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30: 105-119.
    • (1997) Networks , vol.30 , pp. 105-119
    • Cordeau, J.F.1    Gendrau, M.2    Laporte, G.3
  • 5
    • 0038364102 scopus 로고    scopus 로고
    • A tabu search heuristic for the static multi-vehicle Dial-a-Ride problem
    • Cordeau JF and Laporte G (2003). A tabu search heuristic for the static multi-vehicle Dial-a-Ride problem. Transport Res B-Meth 37: 579-594.
    • (2003) Transport Res B-Meth , vol.37 , pp. 579-594
    • Cordeau, J.F.1    Laporte, G.2
  • 6
    • 12944272148 scopus 로고    scopus 로고
    • Two evolutionary metaheuristics for the vehicle routing problem with time windows
    • Homberger J and Gehring H (1999). Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 37: 297-318.
    • (1999) INFOR , vol.37 , pp. 297-318
    • Homberger, J.1    Gehring, H.2
  • 7
    • 0022851257 scopus 로고
    • A heuristic algorithm for the multi-vehicle advance request Dial-a-Ride problem with time windows
    • Jaw JJ, Odoni AR, Psaraftis HN and Wilson NHM (1986). A heuristic algorithm for the multi-vehicle advance request Dial-a-Ride problem with time windows. Transport Res B-Meth 20B(3): 243-257.
    • (1986) Transport Res B-Meth , vol.20 B , Issue.3 , pp. 243-257
    • Jaw, J.J.1    Odoni, A.R.2    Psaraftis, H.N.3    Wilson, N.H.M.4
  • 9
    • 35448978329 scopus 로고    scopus 로고
    • PhD thesis, Center for Traffic and Transportation, Technical University of Denmark
    • Jorgensen RM (2002). Dial-a-Ride. PhD thesis, Center for Traffic and Transportation, Technical University of Denmark.
    • (2002) Dial-a-Ride
    • Jorgensen, R.M.1
  • 10
    • 84937409040 scopus 로고    scopus 로고
    • Pereira FB, Tavares J, Machado P and Costa E (2002). Gvr: A New genetic representation for the vehicle routing problem. In: Proceedings of Artificial Intelligence and Cognitive Science. 13th Irish Conference, AICS 2002, 2464 of Lecture Notes in Artificial Intelligence. QAD Ireland, Limerick, Ireland, pp 95-102.
    • Pereira FB, Tavares J, Machado P and Costa E (2002). Gvr: A New genetic representation for the vehicle routing problem. In: Proceedings of Artificial Intelligence and Cognitive Science. 13th Irish Conference, AICS 2002, volume 2464 of Lecture Notes in Artificial Intelligence. QAD Ireland, Limerick, Ireland, pp 95-102.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.