메뉴 건너뛰기




Volumn 6, Issue 4, 2017, Pages 289-306

Minimizing the logistic ratio in the inventory routing problem

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; MATHEMATICAL PROGRAMMING; SALES;

EID: 85051295728     PISSN: 21924376     EISSN: 21924384     Source Type: Journal    
DOI: 10.1007/s13676-016-0097-9     Document Type: Article
Times cited : (27)

References (19)
  • 1
    • 84893873667 scopus 로고    scopus 로고
    • Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems
    • Adulyasak Y, Cordeau J-F, Jans R (2013) Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS J Comput 26:103–120
    • (2013) INFORMS J Comput , vol.26 , pp. 103-120
    • Adulyasak, Y.1    Cordeau, J.-F.2    Jans, R.3
  • 2
    • 75749108843 scopus 로고    scopus 로고
    • Industrial aspects and literature survey: combined inventory management and routing
    • Andersson H, Hoff A, Christiansen M, Hasle G, Løkketangen A (2010) Industrial aspects and literature survey: combined inventory management and routing. Comput Oper Res 37:1515–1536
    • (2010) Comput Oper Res , vol.37 , pp. 1515-1536
    • Andersson, H.1    Hoff, A.2    Christiansen, M.3    Hasle, G.4    Løkketangen, A.5
  • 3
    • 67349167929 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for a vendor managed inventory routing problem
    • Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) A branch-and-cut algorithm for a vendor managed inventory routing problem. Transp Sci 41:382–391
    • (2007) Transp Sci , vol.41 , pp. 382-391
    • Archetti, C.1    Bertazzi, L.2    Laporte, G.3    Speranza, M.G.4
  • 6
    • 84886100367 scopus 로고    scopus 로고
    • Inventory routing problems: an introduction
    • Bertazzi L, Speranza MG (2012) Inventory routing problems: an introduction. EURO J Transp Logist 1:307–326
    • (2012) EURO J Transp Logist , vol.1 , pp. 307-326
    • Bertazzi, L.1    Speranza, M.G.2
  • 7
    • 84886091814 scopus 로고    scopus 로고
    • Inventory routing problems with multiple customers
    • Bertazzi L, Speranza MG (2013) Inventory routing problems with multiple customers. EURO J Transp Logist 2:255–275
    • (2013) EURO J Transp Logist , vol.2 , pp. 255-275
    • Bertazzi, L.1    Speranza, M.G.2
  • 9
    • 84859708266 scopus 로고    scopus 로고
    • The inventory-routing problem with transhipment
    • Coelho LC, Cordeau J-F, Laporte G (2012) The inventory-routing problem with transhipment. Comput Oper Res 39:2537–2548
    • (2012) Comput Oper Res , vol.39 , pp. 2537-2548
    • Coelho, L.C.1    Cordeau, J.-F.2    Laporte, G.3
  • 10
    • 84867404407 scopus 로고    scopus 로고
    • The exact solution of several classes of inventory-routing problems
    • Coelho LC, Laporte G (2013) The exact solution of several classes of inventory-routing problems. Comput Oper Res 40:558–565
    • (2013) Comput Oper Res , vol.40 , pp. 558-565
    • Coelho, L.C.1    Laporte, G.2
  • 11
    • 84906080265 scopus 로고    scopus 로고
    • Improved solutions for inventory-routing problems through valid inequalities and input ordering
    • Coelho LC, Laporte G (2014) Improved solutions for inventory-routing problems through valid inequalities and input ordering. Int J Prod Econ 155:391–397
    • (2014) Int J Prod Econ , vol.155 , pp. 391-397
    • Coelho, L.C.1    Laporte, G.2
  • 13
    • 77249153242 scopus 로고    scopus 로고
    • Branch-and-price-and-cut for the split delivery vehicle routing problem with time windows
    • Desaulniers G (2010) Branch-and-price-and-cut for the split delivery vehicle routing problem with time windows. Oper Res 58(1):179–192
    • (2010) Oper Res , vol.58 , Issue.1 , pp. 179-192
    • Desaulniers, G.1
  • 15
    • 0000181889 scopus 로고
    • On nonlinear fractional programming
    • Dinkelbach W (1967) On nonlinear fractional programming. Manag Sci 13:492–498
    • (1967) Manag Sci , vol.13 , pp. 492-498
    • Dinkelbach, W.1
  • 16
    • 0021632689 scopus 로고
    • Analysis of a large scale vehicle routing problem with an inventory component
    • Golden B, Assad A, Dahl R (1984) Analysis of a large scale vehicle routing problem with an inventory component. Large Scale Syst 7:181–190
    • (1984) Large Scale Syst , vol.7 , pp. 181-190
    • Golden, B.1    Assad, A.2    Dahl, R.3
  • 17
    • 0002180205 scopus 로고
    • Plant location, set covering, and economic lot size: an o(mn)-algorithm for structured problems
    • Collatz L, Meinardus G, Wetterling WWE, (eds), Numerische Methoden bei Optimierungsverfahren, 3, Birkhäuser, Basel
    • Krarup J, Bilde O (1977) Plant location, set covering, and economic lot size: an o(mn)-algorithm for structured problems. In: Collatz L, Meinardus G, Wetterling WWE (eds) Optimierung bei graphentheoretischen und ganzzahligen Probleme, vol 3., Numerische Methoden bei OptimierungsverfahrenBirkhäuser, Basel, pp 155–180
    • (1977) Optimierung bei graphentheoretischen und ganzzahligen Probleme , pp. 155-180
    • Krarup, J.1    Bilde, O.2
  • 18
    • 85064289245 scopus 로고    scopus 로고
    • Société française de recherche opérationnelle et aide à la décision (ROADEF) (2016) ROADEF/EURO Challenge 2016: inventory routing problem. challenge.roadef.org/2016/en. Accessed 20 April 2016


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