공장설계및실습 과제2. Multiple Sources Continuous Location Problem
- 최초 등록일
- 2017.03.07
- 최종 저작일
- 2017.03
- 32페이지/
한컴오피스
- 가격 3,000원
![할인쿠폰받기](/images/v4/document/ico_det_coupon.gif)
목차
Ⅰ. Multiple Sources Continuous Location Problem
Ⅱ. Solve the problem - a. if m = 1
Ⅲ. Solve the problem - b. if m = 2
Ⅳ. Solve the problem - c. if m = 3
Ⅶ. Conclusion
Ⅷ. Appendix
Ⅸ. Reference
본문내용
Ⅰ. Multiple Sources Continuous Location Problem
Given : Location of each of n destination, Requirements of each destination
Shipping costs (Linear in the Euclidean distance), Operating cost of facilities
Find : Number of sources, Location of each source,
Allocation of destinations' to sources
"To minimize the total shipping cost plus operating cost of source"
A company wishes to construct a new fertilizer mixing plant to serve ten retail outlets as following table. Suppose that the operating costs are $75 per day per mixing plant. Then, solve the following questions using by the heuristic approach given the following heuristic algorithm.
Step1. Choose m = # of sources (trial)
Step2. Divide the set of n destinations into m approximately equal subsets
Step3. For each subset, solve a sing source location problem.
Step4. Examine each destination to see if it is closer to a source found in step 3 than the one to which it is currently allocated. If so, re-allocate the destination
Step5. Return to step 3 if any destination was re-allocated in step 4.
참고 자료
없음