애스크로AIPublic Preview
← 학술논문 검색
학술논문대한안전경영과학회지2010.03 발행

역물류 네트워크를 위한 확장된 복수 Weber 문제의 GRASP 해법

A GRASP heuristics for Expanded multi-source Weber problem on Reverse Logistics Network

양병학(경원대학교)

12권 1호, 97~104쪽

초록

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.

Abstract

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.

발행기관:
대한안전경영과학회
분류:
안전공학

AI 법률 상담

이 논문의 주제에 대해 더 알고 싶으신가요?

460만+ 법률 자료에서 관련 판례·법령·해석례를 찾아 답변합니다

AI 상담 시작