• 제목/요약/키워드: Expanded muti-source Weber Problem

검색결과 1건 처리시간 0.017초

역물류 네트워크를 위한 확장된 복수 Weber 문제의 GRASP 해법 (A GRASP heuristics for Expanded multi-source Weber problem on Reverse Logistics Network)

  • 양병학
    • 대한안전경영과학회지
    • /
    • 제12권1호
    • /
    • pp.97-104
    • /
    • 2010
  • Expanded muti-source Weber problem (EWP), which introduced in this paper, is a reverse logistics network design problem to minimize the total transportation cost from customers thorough regional center to central center. Decision factor of EWP are the locations of regional centers and a central center. We introduce a GRASP heuristics for the EWP. In the suggested GRASP, an expanded iterative location allocation method (EILA) is introduced based on the Cooper's iterative location allocation method[3]. For the initial solution of GRASP, allocation first seed (AFSeed) and location first seed (LFSeed) are developed. The computational experiment for the objective value shows that the LFSeed is better than the AFSeed. Also the calculating time of the LFSeed is better than that of the AFSeed.