메뉴 건너뛰기




Volumn 238, Issue 1, 2014, Pages 31-40

The Share-A-Ride Problem: People and parcels sharing taxis

Author keywords

Freight insertion problem; Multi commodity; Share A Ride Problem; Taxi; Transportation

Indexed keywords

INTEGER PROGRAMMING; MATHEMATICAL MODELS; TRANSPORTATION;

EID: 84901199004     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.03.003     Document Type: Article
Times cited : (222)

References (12)
  • 3
    • 0031680443 scopus 로고    scopus 로고
    • Intractability of the dial-A-ride problem and a multiobjective solution using simulated annealing
    • J. Baugh, G. Kakivaya, and J. 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.1    Kakivaya, G.2    Stone, J.3
  • 6
    • 0022851257 scopus 로고
    • A heuristic algorithm for the multi-vehicle advance request dial-A-ride problem with time windows
    • 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 B 20 1986 243 257
    • (1986) Transportation Research B , vol.20 , pp. 243-257
    • Jaw, J.1    Odoni, A.2    Psaraftis, H.3    Wilson, N.4
  • 8
    • 0019016763 scopus 로고
    • A dynamic programming approach to the single-vehicle, many-to-many immediate request dial-A-ride problem
    • H. Psaraftis A dynamic programming approach to the single-vehicle, many-to-many immediate request dial-A-ride problem Transportation Science 14 1980 130 154
    • (1980) Transportation Science , vol.14 , pp. 130-154
    • Psaraftis, H.1
  • 9
    • 34548825097 scopus 로고    scopus 로고
    • Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints
    • L. Quadrifoglio, M.M. Dessouky, and F. Ordóñez Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints European Journal of Operational Research 185 2 2008 481 494
    • (2008) European Journal of Operational Research , vol.185 , Issue.2 , pp. 481-494
    • Quadrifoglio, L.1    Dessouky, M.M.2    Ordóñez, F.3
  • 10
    • 33751011598 scopus 로고    scopus 로고
    • An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows
    • S. Ropke, and D. Pisinger An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transportation Science 40 4 2006 455 472
    • (2006) Transportation Science , vol.40 , Issue.4 , pp. 455-472
    • Ropke, S.1    Pisinger, D.2
  • 11
    • 84901222898 scopus 로고    scopus 로고
    • SF, 2008. Taxi trails in San Francisco
    • SF, 2008. Taxi trails in San Francisco.


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