메뉴 건너뛰기




Volumn 61, Issue 3, 2011, Pages 512-524

A model and a solution algorithm for the car pooling problem with pre-matching information

Author keywords

Car pooling problem; Lagrangian relaxation; Multiple commodity network flow problem; Pre matching information; Time space network

Indexed keywords

CAR POOLING; LAGRANGIAN RELAXATION; NETWORK FLOW PROBLEMS; PRE-MATCHING INFORMATION; TIME-SPACE NETWORKS;

EID: 80053188774     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2011.04.006     Document Type: Article
Times cited : (24)

References (22)
  • 1
    • 10844274173 scopus 로고    scopus 로고
    • An exact method for the car pooling problem based on Lagrangean column generation
    • DOI 10.1287/opre.1030.0106
    • R. Baldacci, V. Maniezzo, and A. Mingozzi An exact method for the car pooling problem based on Lagrangean column generation Operations Research 52 2004 422 439 (Pubitemid 40000792)
    • (2004) Operations Research , vol.52 , Issue.3 , pp. 422-439
    • Baldacci, R.1    Maniezzo, V.2    Mingozzi, A.3
  • 3
    • 2942720687 scopus 로고    scopus 로고
    • A distributed geographic information system for the daily car pooling problem
    • DOI 10.1016/S0305-0548(03)00186-2, PII S0305054803001862
    • R.W. Calvo, F.L. Luigi, P. Haastrup, and V. Maniezzo A distributed geographic information system for the daily car pooling problem Computers and Operations Research 31 2004 2263 2278 (Pubitemid 38791074)
    • (2004) Computers and Operations Research , vol.31 , Issue.13 , pp. 2263-2278
    • Wolfler Calvo, R.1    De Luigi, F.2    Haastrup, P.3    Maniezzo, V.4
  • 6
    • 33748922235 scopus 로고    scopus 로고
    • A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
    • DOI 10.1016/j.ejor.2005.02.038, PII S0377221705002262
    • L. Coslovich, R. Pesenti, and W. Ukovich A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem European Journal of Operational Research 175 2006 1605 1615 (Pubitemid 44436743)
    • (2006) European Journal of Operational Research , vol.175 , Issue.3 , pp. 1605-1615
    • Coslovich, L.1    Pesenti, R.2    Ukovich, W.3
  • 7
    • 1942468933 scopus 로고    scopus 로고
    • A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows
    • DOI 10.1016/j.trb.2003.07.001, PII S0191261503000912
    • 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 (Pubitemid 38527569)
    • (2004) Transportation Research Part B: Methodological , vol.38 , Issue.6 , pp. 539-557
    • Diana, M.1    Dessouky, M.M.2
  • 11
    • 80053181841 scopus 로고    scopus 로고
    • Master's thesis, National Taiwan University, Department of Civil Engineering, ROC
    • Guo, Y. J. (2003). Trip cost urban transportation. Master's thesis, National Taiwan University, Department of Civil Engineering, ROC.
    • (2003) Trip Cost Urban Transportation
    • Guo, Y.J.1
  • 12
  • 13
    • 33748771730 scopus 로고    scopus 로고
    • A dial-a-ride problem for client transportation in a health-care organization
    • DOI 10.1016/j.cor.2005.03.024, PII S0305054805001188
    • E. Melachrinoudis, A.B. Ilhan, and H. Min A dial-a-ride problem for client transportation in a healthcare organization Computers & Operations Research 34 2007 742 759 (Pubitemid 44404098)
    • (2007) Computers and Operations Research , vol.34 , Issue.3 , pp. 742-759
    • Melachrinoudis, E.1    Ilhan, A.B.2    Min, H.3
  • 16
    • 33646944409 scopus 로고    scopus 로고
    • Handicapped Person Transportation: An application of the Grouping Genetic Algorithm
    • DOI 10.1016/j.engappai.2005.12.013, PII S0952197606000339
    • B. Rekiek, A. Delchambre, and H.A. Saleh Handicapped person transportation: An application of the grouping genetic algorithm Engineering Application of Artificial Intelligence 19 2006 511 520 (Pubitemid 43795040)
    • (2006) Engineering Applications of Artificial Intelligence , vol.19 , Issue.5 , pp. 511-520
    • Rekiek, B.1    Delchambre, A.2    Saleh, H.A.3
  • 17
    • 34250189938 scopus 로고    scopus 로고
    • Models and branch-and-cut algorithms for pickup and delivery problems with time windows
    • DOI 10.1002/net.20177
    • 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 (Pubitemid 47324734)
    • (2007) Networks , vol.49 , Issue.4 , pp. 258-272
    • Ropke, S.1    Cordeau, J.-F.2    Laporte, G.3
  • 18
    • 0034325093 scopus 로고    scopus 로고
    • A fuzzy logic approach to dynamic dial-a-ride problem
    • D. Teodorovic, and G. Radivojevic A fuzzy logic approach to dynamic dial-a-ride problem Fuzzy Sets and Systems 116 2000 23 33
    • (2000) Fuzzy Sets and Systems , vol.116 , pp. 23-33
    • Teodorovic, D.1    Radivojevic, G.2
  • 19
    • 34250178130 scopus 로고    scopus 로고
    • Solution of the dial-a-ride problem with multi-dimensional capacity constraints
    • K.I. Wong, and M.G.H. Bell Solution of the dial-a-ride problem with multi-dimensional capacity constraints International Transactions in Operational Research 13 2006 195 208
    • (2006) International Transactions in Operational Research , vol.13 , pp. 195-208
    • Wong, K.I.1    Bell, M.G.H.2
  • 20
    • 33746218336 scopus 로고    scopus 로고
    • A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
    • DOI 10.1016/j.ejor.2004.09.060, PII S0377221705003346
    • Z. Xiang, C. Chu, and H. Chen A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints European Journal of Operational Research 174 2006 1117 1139 (Pubitemid 44093902)
    • (2006) European Journal of Operational Research , vol.174 , Issue.2 , pp. 1117-1139
    • Xiang, Z.1    Chu, C.2    Chen, H.3
  • 21
    • 56549118368 scopus 로고    scopus 로고
    • Optimal scheduling of emergency roadway repair and subsequent relief distribution
    • S. Yan, and Y.L. Shih Optimal scheduling of emergency roadway repair and subsequent relief distribution Computers & Operations Research 36 2009 2049 2065
    • (2009) Computers & Operations Research , vol.36 , pp. 2049-2065
    • Yan, S.1    Shih, Y.L.2
  • 22
    • 0030244759 scopus 로고    scopus 로고
    • A decision support framework for multi-fleet routing and multi-stop flight scheduling
    • DOI 10.1016/0965-8564(95)00029-1
    • S. Yan, and H.F. Young A decision support framework for multi-fleet routing and multi-stop flight scheduling Transportation Research Part A 30 1996 379 398 (Pubitemid 126401353)
    • (1996) Transportation Research Part A: Policy and Practice , vol.30 , Issue.5 PART A , pp. 379-398
    • Yan, S.1    Young, H.-F.2


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