메뉴 건너뛰기




Volumn 40, Issue 5, 2013, Pages 1410-1419

A branch-and-price guided search approach to maritime inventory routing

Author keywords

Heuristic search; Integer programming; Inventory routing

Indexed keywords

BRANCH AND PRICE; COMPUTATIONAL EXPERIMENT; FINITE HORIZONS; HETEROGENEOUS FLEET; HEURISTIC SEARCH; HIGH-QUALITY SOLUTIONS; INVENTORY ROUTING; MARITIME INVENTORY ROUTING;

EID: 84875210247     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.09.010     Document Type: Article
Times cited : (38)

References (18)
  • 2
    • 51649122201 scopus 로고    scopus 로고
    • An optimization-based heuristic for the split delivery vehicle routing problem
    • C. Archetti, M.G. Speranza, and M.W.P. Savelsbergh An optimization-based heuristic for the split delivery vehicle routing problem Transportation Science 42 2008 22 31
    • (2008) Transportation Science , vol.42 , pp. 22-31
    • Archetti, C.1    Speranza, M.G.2    Savelsbergh, M.W.P.3
  • 4
    • 0006681133 scopus 로고    scopus 로고
    • Decomposition of a combined inventory and time constrained ship routing problem
    • M. Christiansen Decomposition of a combined inventory and time constrained ship routing problem Transportation Science 33 1999 3 16
    • (1999) Transportation Science , vol.33 , pp. 3-16
    • Christiansen, M.1
  • 5
    • 36249030767 scopus 로고    scopus 로고
    • Robust inventory ship routing by column generation
    • G. Desaulniers, J. Desrosiers, M.M. Solomon, Springer US
    • M. Christiansen, and B. Nygreen Robust inventory ship routing by column generation G. Desaulniers, J. Desrosiers, M.M. Solomon, Column generation 2005 Springer US 197 224
    • (2005) Column Generation , pp. 197-224
    • Christiansen, M.1    Nygreen, B.2
  • 6
    • 29044449517 scopus 로고    scopus 로고
    • A new ILP-based refinement heuristic for vehicle routing problems
    • R. De Franceschi, M. Fischetti, and P. Toth A new ILP-based refinement heuristic for vehicle routing problems Mathematical Programming B 105 2006 471 499
    • (2006) Mathematical Programming B , vol.105 , pp. 471-499
    • De Franceschi, R.1    Fischetti, M.2    Toth, P.3
  • 7
    • 85042163696 scopus 로고
    • A new optimization algorithm for the vehicle routing problem with time windows
    • M. Desrochers, J. Desrosiers, and M. Solomon A new optimization algorithm for the vehicle routing problem with time windows Operations Research 40 1992 342 354
    • (1992) Operations Research , vol.40 , pp. 342-354
    • Desrochers, M.1    Desrosiers, J.2    Solomon, M.3
  • 9
    • 77949587087 scopus 로고    scopus 로고
    • A template for scatter search and path relinking
    • Glover F. A template for scatter search and path relinking. Lecture notes in computer science, vol. 1363; 1998. p. 13-54.
    • (1998) Lecture Notes in Computer Science , vol.1363 , pp. 13-54
    • Glover, F.1
  • 10
    • 77955624888 scopus 로고    scopus 로고
    • A branch-and-price method for a liquefied natural gas inventory routing problem
    • R. Gronhaug, M. Christiansen, and G. Desaulniers A branch-and-price method for a liquefied natural gas inventory routing problem Transportation Science 44 2010 400 415
    • (2010) Transportation Science , vol.44 , pp. 400-415
    • Gronhaug, R.1    Christiansen, M.2    Desaulniers, G.3
  • 13
    • 77952059163 scopus 로고    scopus 로고
    • Combining exact and heuristic approaches for the capacitated fixed charge network flow problem
    • M. Hewitt, G. Nemhauser, and M. Savelsbergh Combining exact and heuristic approaches for the capacitated fixed charge network flow problem INFORMS Journal on Computing 22 2009 314 325
    • (2009) INFORMS Journal on Computing , vol.22 , pp. 314-325
    • Hewitt, M.1    Nemhauser, G.2    Savelsbergh, M.3
  • 14
    • 84877960018 scopus 로고    scopus 로고
    • Branch-and-price guided search for integer programs with an application to the multicommodity fixed charge network flow problem
    • Hewitt M, Nemhauser G, Savelsbergh M. Branch-and-price guided search for integer programs with an application to the multicommodity fixed charge network flow problem. INFORMS Journal of Computing, 10.1287/ijoc.1120.0503, in press.
    • INFORMS Journal of Computing
    • Hewitt, M.1    Nemhauser, G.2    Savelsbergh, M.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 and Operations Research 34 2007 2403 2435
    • (2007) Computers and Operations Research , vol.34 , pp. 2403-2435
    • Pisinger, D.1    Ropke, S.2
  • 16
    • 36348944512 scopus 로고    scopus 로고
    • An optimization algorithm for inventory routing with continuous moves
    • M. Savelsbergh, and J.-H. Song An optimization algorithm for inventory routing with continuous moves Computers and Operations Research 35 2008 2266 2282
    • (2008) Computers and Operations Research , vol.35 , pp. 2266-2282
    • Savelsbergh, M.1    Song, J.-H.2
  • 18


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