메뉴 건너뛰기




Volumn 7422 LNCS, Issue , 2012, Pages 249-260

Layered formulation for the robust vehicle routing problem with time windows

Author keywords

layered formulation; maritime transportation; robust programming; time windows; vehicle routing problem

Indexed keywords

EXTENDED FORMULATIONS; LAYERED FORMULATION; LAYERED REPRESENTATION; MARITIME TRANSPORTATION; POLYTOPES; TIME WINDOWS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE ROUTING PROBLEMS;

EID: 84865257974     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32147-4_23     Document Type: Conference Paper
Times cited : (23)

References (21)
  • 1
    • 0034259805 scopus 로고    scopus 로고
    • A polyhedral study of the asymmetric traveling salesman problem with time windows
    • Ascheuer, N., Fischetti, M., Grötschel, M.: A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2), 69-79 (2000)
    • (2000) Networks , vol.36 , Issue.2 , pp. 69-79
    • Ascheuer, N.1    Fischetti, M.2    Grötschel, M.3
  • 2
    • 0036567019 scopus 로고    scopus 로고
    • A branch-and-cut procedure for the vehicle routing problem with time windows
    • Bard, J.F., Kontoravdis, G., Yu, G.: A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science 36, 250-269 (2002)
    • (2002) Transportation Science , vol.36 , pp. 250-269
    • Bard, J.F.1    Kontoravdis, G.2    Yu, G.3
  • 5
    • 84863393058 scopus 로고    scopus 로고
    • Theory and applications of robust optimization
    • Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Review 53, 464-501 (2011)
    • (2011) SIAM Review , vol.53 , pp. 464-501
    • Bertsimas, D.1    Brown, D.B.2    Caramanis, C.3
  • 10
    • 41349118058 scopus 로고    scopus 로고
    • Combined route capacity and route length models for unit demand vehicle routing problems
    • Godinho, M.T., Gouveia, L., Magnanti, T.L.: Combined route capacity and route length models for unit demand vehicle routing problems. Discrete Optimization 5(2), 350-372 (2008)
    • (2008) Discrete Optimization , vol.5 , Issue.2 , pp. 350-372
    • Godinho, M.T.1    Gouveia, L.2    Magnanti, T.L.3
  • 12
    • 0001276437 scopus 로고    scopus 로고
    • Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints
    • Gouveia, L.: Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints. INFORMS J. on Computing 10, 180-188 (1998)
    • (1998) INFORMS J. on Computing , vol.10 , pp. 180-188
    • Gouveia, L.1
  • 13
    • 36348987653 scopus 로고    scopus 로고
    • Formulations and exact algorithms for the vehicle routing problem with time windows
    • Kallehauge, B.: Formulations and exact algorithms for the vehicle routing problem with time windows. Computers & OR 35(7), 2307-2330 (2008)
    • (2008) Computers & OR , vol.35 , Issue.7 , pp. 2307-2330
    • Kallehauge, B.1
  • 14
    • 34548209621 scopus 로고    scopus 로고
    • Path inequalities for the vehicle routing problem with time windows
    • Kallehauge, B., Boland, N., Madsen, O.B.G.: Path inequalities for the vehicle routing problem with time windows. Networks 49(4), 273-293 (2007)
    • (2007) Networks , vol.49 , Issue.4 , pp. 273-293
    • Kallehauge, B.1    Boland, N.2    Madsen, O.B.G.3
  • 16
    • 84945708767 scopus 로고
    • Integer programming formulation of traveling salesman problems
    • Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM 7, 326-329 (1960)
    • (1960) J. ACM , vol.7 , pp. 326-329
    • Miller, C.E.1    Tucker, A.W.2    Zemlin, R.A.3
  • 18
    • 49749135176 scopus 로고    scopus 로고
    • Vehicle routing with soft time windows and erlang travel times
    • Russell, R., Urban, T.: Vehicle routing with soft time windows and erlang travel times. Journal of the Operational Research Society 59, 1220-1228 (2008)
    • (2008) Journal of the Operational Research Society , vol.59 , pp. 1220-1228
    • Russell, R.1    Urban, T.2
  • 19
    • 0010680207 scopus 로고
    • Convex programming with set-inclusive constraints and applications to inexact linear programming
    • Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Operations Research 21, 1154-1157 (1973)
    • (1973) Operations Research , vol.21 , pp. 1154-1157
    • Soyster, A.L.1
  • 21
    • 40749112799 scopus 로고    scopus 로고
    • A robust optimization approach for the capacitated vehicle routing
    • Sungur, I., Ordóñez, F., Dessouky, M.: A robust optimization approach for the capacitated vehicle routing. IIE Transactions 40(5), 509-523 (2008)
    • (2008) IIE Transactions , vol.40 , Issue.5 , pp. 509-523
    • Sungur, I.1    Ordóñez, F.2    Dessouky, M.3


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