메뉴 건너뛰기




Volumn 14, Issue 2, 2006, Pages 209-228

Synchronized routing of seasonal products through a production/distribution network

Author keywords

Heterogeneous fleet; Inventory; Synchronization; Vehicle routing

Indexed keywords


EID: 33750919958     PISSN: 1435246X     EISSN: 16139178     Source Type: Journal    
DOI: 10.1007/s10100-006-0169-2     Document Type: Article
Times cited : (12)

References (25)
  • 1
    • 0041704620 scopus 로고    scopus 로고
    • An improved branch-and-cut algorithm for the capacitated vehicle routing problem
    • Achuthan N.R., Cacetta L. & Hill S.P. (2003) "An improved branch-and-cut algorithm for the capacitated vehicle routing problem." Transportation Science, 37, 2: 153-169.
    • (2003) Transportation Science , vol.37 , Issue.2 , pp. 153-169
    • Achuthan, N.R.1    Cacetta, L.2    Hill, S.P.3
  • 3
    • 0022059696 scopus 로고
    • Distribution strategies that minimize transportation and inventory costs
    • Burns L.D., Hall R.W., Blumenfeld D.E. & Daganzo C.F. (1985) "Distribution strategies that minimize transportation and inventory costs." Operations Research, 33, 469-490.
    • (1985) Operations Research , vol.33 , pp. 469-490
    • Burns, L.D.1    Hall, R.W.2    Blumenfeld, D.E.3    Daganzo, C.F.4
  • 5
    • 0000879068 scopus 로고
    • Optimal policies for a multi-echelon inventory problem
    • Clark A.J. & Scarf H. (1960) "Optimal Policies for a Multi-Echelon Inventory Problem." Management Science, 6, 475-490.
    • (1960) Management Science , vol.6 , pp. 475-490
    • Clark, A.J.1    Scarf, H.2
  • 6
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • Clarke G. & Wright J.W. (1964) "Scheduling of vehicles from a central depot to a number of delivery points." Operations Research, 12, 568-581.
    • (1964) Operations Research , vol.12 , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 10
    • 0034818424 scopus 로고    scopus 로고
    • Benefits of co-operation in a production distribution environment
    • Gavirneni S. (2001) "Benefits of co-operation in a production distribution environment." European Journal of Operational Research, 130, 612-622.
    • (2001) European Journal of Operational Research , vol.130 , pp. 612-622
    • Gavirneni, S.1
  • 12
    • 2542474653 scopus 로고    scopus 로고
    • Metaheuristics for the capacitated vehicle routing problem
    • The Vehicle Routing Problem, P. Toth & D. Vigo (ed.), Philadelphia
    • Gendreau M., Laporte G. & Potvin J.-Y. (2002) "Metaheuristics for the capacitated vehicle routing problem." In The Vehicle Routing Problem, P. Toth & D. Vigo (ed.), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 129-154.
    • (2002) SIAM Monographs on Discrete Mathematics and Applications , pp. 129-154
    • Gendreau, M.1    Laporte, G.2    Potvin, J.-Y.3
  • 13
    • 0034301999 scopus 로고    scopus 로고
    • An effective implementation of the Lin-Kernighan traveling salesman heuristic
    • Helsgaun K. (2000) "An effective implementation of the Lin-Kernighan traveling salesman heuristic." European Journal of Operational Research, 126, 106-130.
    • (2000) European Journal of Operational Research , vol.126 , pp. 106-130
    • Helsgaun, K.1
  • 14
    • 0026880159 scopus 로고
    • The Traveling Salesman Problem: An overview of exact and approximate algorithms
    • Laporte G. (1992a) "The Traveling Salesman Problem: An overview of exact and approximate algorithms." European Journal of Operational Research, 59, 231-247.
    • (1992) European Journal of Operational Research , vol.59 , pp. 231-247
    • Laporte, G.1
  • 15
    • 0026874435 scopus 로고
    • The Vehicle Routing Problem: An overview of exact and approximate algorithms
    • Laporte G. (1992b) "The Vehicle Routing Problem: An overview of exact and approximate algorithms." European Journal of Operational Research, 59, 345-358.
    • (1992) European Journal of Operational Research , vol.59 , pp. 345-358
    • Laporte, G.1
  • 16
    • 33744700744 scopus 로고
    • Recent algorithmic Developments for the traveling salesman problem and the vehicle routing problem
    • Laporte G. (1993) "Recent algorithmic Developments for the traveling salesman problem and the vehicle routing problem." Ricerca Operativa, 23, 68: 5-27.
    • (1993) Ricerca Operativa , vol.23 , Issue.68 , pp. 5-27
    • Laporte, G.1
  • 20
    • 0346009088 scopus 로고    scopus 로고
    • D-Ants: Savings Based Ants divide and conquer the vehicle routing problem
    • Reimann M., Doerner K. & Hartl R.F. (2004) "D-Ants: Savings Based Ants divide and conquer the vehicle routing problem." Computers and Operations Research, 31, 563-591.
    • (2004) Computers and Operations Research , vol.31 , pp. 563-591
    • Reimann, M.1    Doerner, K.2    Hartl, R.F.3
  • 21
    • 0036680973 scopus 로고    scopus 로고
    • A sweep-based algorithm for the fleet size and mix vehicle routing problem
    • Renaud J. & Boctor F.F. (2002) "A sweep-based algorithm for the fleet size and mix vehicle routing problem." European Journal of Operational Research, 140, 618-628.
    • (2002) European Journal of Operational Research , vol.140 , pp. 618-628
    • Renaud, J.1    Boctor, F.F.2
  • 24
    • 0002303174 scopus 로고    scopus 로고
    • Exact solution of the vehicle routing problem
    • T.G. Crainic & G. Laporte (ed.), Kluwer, Boston
    • Toth P. & Vigo D. (1998) "Exact solution of the Vehicle Routing Problem." Fleet Management and Logistics, T.G. Crainic & G. Laporte (ed.), Kluwer, Boston, 1-31.
    • (1998) Fleet Management and Logistics , pp. 1-31
    • Toth, P.1    Vigo, D.2


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