# KLI

### A Branch and Bound Algorithm for the Multi-period Capacitated Facilities Location Problem

Alternative Title
유통설비의 최적입지 선정에 관한 연구
Abstract

계획기간도안의 모든 수요를 충족시키면서 관련 총 비용을 최소로 하는 창고의 입지를 선정하기 위해, 이를 혼합 정수계획모형으로 정식화하고 이 모형의 최적해를 구하기 위한 새로운 分段探索法(branch and bound algorithm)을 제시하였다. 이때 分段探索나무(b &b tree)의 크기를 줄이기 위해 4가지 유형의 마디의 간략화단계(node simplification steps)를 보였다.
This paper is concerned with the problem of locating warehouses in a two-stage distribution system, where commodities are delivered from capacitated plants to customers via capacitated warehouses over a relatively long planning horizon. We want to decide which of a set of warehouses to poen, when to poen them, and how to allocate the production of each plant to satisfy the known demands to minimize the oatal discounted costs.

This problem is formulated as a mixed integer linear programming model. To obtain the optimal solution of this model, a new branch and bound algorithm is presented. To reduce the size of branch and bound tree and the tatal computation time, four kinds of node simplification steps are devised through exploiting the economic charateristics of the model.
This paper is concerned with the problem of locating warehouses in a two-stage distribution system, where commodities are delivered from capacitated plants to customers via capacitated warehouses over a relatively long planning horizon. We want to decide which of a set of warehouses to poen, when to poen them, and how to allocate the production of each plant to satisfy the known demands to minimize the oatal discounted costs.

This problem is formulated as a mixed integer linear programming model. To obtain the optimal solution of this model, a new branch and bound algorithm is presented. To reduce the size of branch and bound tree and the tatal computation time, four kinds of node simplification steps are devised through exploiting the economic charateristics of the model.
Author(s)
Issued Date
1980
Type
Research Laboratory
URI
http://oak.ulsan.ac.kr/handle/2021.oak/4862
http://ulsan.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000002025135
Alternative Author(s)
Publisher
연구논문집
Language
eng
Rights
울산대학교 저작물은 저작권에 의해 보호받습니다.
Citation Volume
11
Citation Number
2
Citation Start Page
179
Citation End Page
185
Appears in Collections:
Research Laboratory > University of Ulsan Report