메뉴 건너뛰기




Volumn 225, Issue 1, 2013, Pages 106-117

Synchronized dial-a-ride transportation of disabled passengers at airports

Author keywords

Airport operations; Dial a ride; Heuristics; PRM; Simulated annealing; Transportation planning

Indexed keywords

AIRPORT OPERATIONS; DIAL-A-RIDE; HEURISTICS; PRM; TRANSPORTATION PLANNING;

EID: 84868500517     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.09.008     Document Type: Article
Times cited : (63)

References (19)
  • 1
    • 0031680443 scopus 로고    scopus 로고
    • Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing
    • J.W. Baugh, G.K.R. Kakivaya, and J.R. Stone Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing Engineering Optimization 30 1998 91 123
    • (1998) Engineering Optimization , vol.30 , pp. 91-123
    • Baugh, J.W.1    Kakivaya, G.K.R.2    Stone, J.R.3
  • 3
    • 34250181291 scopus 로고    scopus 로고
    • The dial-a-ride problem: Models and algorithms
    • J. Cordeau, and G. Laporte The dial-a-ride problem: models and algorithms Annals of Operations Research 153 2007 29 46
    • (2007) Annals of Operations Research , vol.153 , pp. 29-46
    • Cordeau, J.1    Laporte, G.2
  • 4
    • 0038364102 scopus 로고    scopus 로고
    • A tabu search heuristic for the static multi-vehicle dial-a-ride problem
    • J.-F. Cordeau, and G. Laporte A tabu search heuristic for the static multi-vehicle dial-a-ride problem Transportation Research Part B: Methodological 37 6 2007 579 594
    • (2007) Transportation Research Part B: Methodological , vol.37 , Issue.6 , pp. 579-594
    • Cordeau, J.-F.1    Laporte, G.2
  • 6
    • 69749116580 scopus 로고    scopus 로고
    • The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method
    • C.E. Cortes, M. Matamala, and C. Contardo The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method European Journal of Operational Research 200 3 2010 711 724
    • (2010) European Journal of Operational Research , vol.200 , Issue.3 , pp. 711-724
    • Cortes, C.E.1    Matamala, M.2    Contardo, C.3
  • 7
    • 73349084298 scopus 로고    scopus 로고
    • Models for evaluating and planning city logistics systems
    • T.G. Crainic, N. Ricciardi, and G. Storchi Models for evaluating and planning city logistics systems Transportation Science 43 2009 432 454
    • (2009) Transportation Science , vol.43 , pp. 432-454
    • Crainic, T.G.1    Ricciardi, N.2    Storchi, G.3
  • 8
    • 1942468933 scopus 로고    scopus 로고
    • A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows
    • M. Diana, and M.M. Dessouky A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows Transportation Research Part B 38 2004 539 557
    • (2004) Transportation Research Part B , vol.38 , pp. 539-557
    • Diana, M.1    Dessouky, M.M.2
  • 9
    • 80755188936 scopus 로고    scopus 로고
    • The vehicle routing problem with time windows and temporal dependencies
    • A. Dohn, M.S. Rasmussen, and J. Larsen The vehicle routing problem with time windows and temporal dependencies Networks 58 2011 273 289
    • (2011) Networks , vol.58 , pp. 273-289
    • Dohn, A.1    Rasmussen, M.S.2    Larsen, J.3
  • 10
    • 84868502442 scopus 로고    scopus 로고
    • Publisher: < www.gatwickairport.com >
    • A. Flower, Gatwick Managing Directors Report. < http://www2. westsussex.gov.uk/ds/cttee/gat/gat230709i7.pdf >, 2009. Publisher: < www.gatwickairport.com >.
    • (2009) Gatwick Managing Directors Report
    • Flower, A.1
  • 12
    • 0022851257 scopus 로고
    • A heuristic algorithm for the multi-vehicle advance request deal-a-ride problem with time windows
    • J. Jaw, A. Odoni, N. Psaraftis, and H.M. Nigel A heuristic algorithm for the multi-vehicle advance request deal-a-ride problem with time windows Transportation Research part B 20 1986 243 257
    • (1986) Transportation Research Part B , vol.20 , pp. 243-257
    • Jaw, J.1    Odoni, A.2    Psaraftis, N.3    Nigel, H.M.4
  • 13
    • 84855776210 scopus 로고    scopus 로고
    • A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
    • L.F. Muller, S. Spoorendonk, and D. Pisinger A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times European Journal of Oprational Research 218 2012 614 623
    • (2012) European Journal of Oprational Research , vol.218 , pp. 614-623
    • Muller, L.F.1    Spoorendonk, S.2    Pisinger, D.3
  • 15
    • 33846068585 scopus 로고    scopus 로고
    • A general heuristic for vehicle routing problems
    • D. Pisinger, and S. Ropke A general heuristic for vehicle routing problems Computers & Operations Research 34 2007 2403 2435
    • (2007) Computers & Operations Research , vol.34 , pp. 2403-2435
    • Pisinger, D.1    Ropke, S.2
  • 16
    • 84864379201 scopus 로고    scopus 로고
    • A branch and cut algorithm for the container shipping network design problem
    • L. Reinhardt, and D. Pisinger A branch and cut algorithm for the container shipping network design problem Flexible Services and Manufacturing Journal 24 2012 349 374
    • (2012) Flexible Services and Manufacturing Journal , vol.24 , pp. 349-374
    • Reinhardt, L.1    Pisinger, D.2
  • 17
    • 34250189938 scopus 로고    scopus 로고
    • Models and branch-and-cut algorithms for pickup and delivery problems with time windows
    • S. Ropke, J.-F. Cordeau, and G. Laporte Models and branch-and-cut algorithms for pickup and delivery problems with time windows Networks 49 2007 258 272
    • (2007) Networks , vol.49 , pp. 258-272
    • Ropke, S.1    Cordeau, J.-F.2    Laporte, G.3
  • 19
    • 33746218336 scopus 로고    scopus 로고
    • A fast heuristic for solving a large-scale dial-a-ride problem under complex constraints
    • Z. Xiang, C. Chu, and H. Chen A fast heuristic for solving a large-scale dial-a-ride problem under complex constraints European Journal of Operational Research 174 2006 1117 1139
    • (2006) European Journal of Operational Research , vol.174 , pp. 1117-1139
    • Xiang, Z.1    Chu, C.2    Chen, H.3


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