• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.3
• /
• pp.93-107
• /
• 1999

We consider the development of an integer programming model and algorithm for the ATM switching node location problem. There are two kinds of facilities, hub facilities and remote facilities, with different capacities and installation costs. Each customer needs to be connected to one or more hub facilities via remote facilities, where the hub(remote) facilities need to be installed at the same candidate installation site of hub(remote) facility. We are given a set of customers with each demand requirements, a set of candidate installation sites of facilities, and connection costs between facilities, We need to determine the locations to place facilities, the number of facilities for each selected location, the set of customers who are connected to each installed hub facilities via installed remote facilities with minimum costs, while satisfying demand requirements of each customer. We formulate this problem as a general integer programming problem and solve it to optimality. In this paper, we develop a branch-and-cut algorithm with path variables. In the algorithm, we consider the integer knapsack polytope and derive valid inequalities. Computational experiments show that the algorithm works well in the real world situation. The results of this research can be used to develop optimization algorithms to solve capacitated facility location problems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.2
• /
• pp.205-215
• /
• 2008

convergence networks (BcN). The problem seeks to minimize the total cost of switch and cable while satisfying the requirement of demand and quality of service (QoS). We develop mixed integer programming models to obtain the optimal switch location of the access network. We develop a Tabu Search (TS) heuristic algorithm for finding a good feasible solution within a reasonable time limit. We propose real networks with up to 25 nodes and 180 demands. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. Computational results show that the proposed heuristic algorithm provides upper bounds within 5% optimality gap in 10 seconds.

• Journal of the Korean Institute of Navigation
• /
• v.22 no.4
• /
• pp.15-19
• /
• 1998

This paper concerns a bulk or semibulk cargo ship scheduling problem with a single loading port. This type of ship scheduling problem is frequently needed in real world for carrying minerals or agricultural produce from a major single production zone to many destinations scattered over a large area of the world. The first optimization model for this problem was introduced by Ronen (1986) as a nonlinear mixed integer program. The model developed in this paper is an improvement of his model in the sense that nonlinearities and numerous unnecessary integer variables have been eliminated. By this improvement we could expect real world instances of moderate sizes to be solved optimal solutions by commercial integer programming software. Similarity between the ship scheduling model and the capacitated facility location model is also discussed.

• Proceedings of the Korea Water Resources Association Conference
• /
• 1992.07a
• /
• pp.479-489
• /
• 1992

A mathematical model for a long range water supply planning is develoted as a dynamic capacitated facility location problem, in which operation costs and two types of fixed costs are considered. The fixed costs are for water supply systems such as dams and reservoirs and for water conveyance systems of waterways or conduits from each water supply points. A Spreadsheet model is developed to support the efficiency of user interface and to implement a heuristic solution procedure. The proposed solution procedure utilizes SOLVER tool and it has been applied to a system with fictitious data but with reality and applicability in mind. As a result of the mathematical analysis, not only the most economic construction timings of surface water supply facilities and distribution systems but also the most economical water supply operating patterns are identified.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.12 no.3
• /
• pp.153-162
• /
• 1992

A mathematical model for a long range water supply planning is developed as a dynamic capacitated facility location problem, in which operating costs and two types of fixed costs are considered. The fixed costs are for water supply systems such as dams and reservoirs and for water conveyance systems of waterways or conduits from each water supply points. A spreadsheet model is developed to support the efficiency of user interface and to implement a heuristic solution procedure. The proposed solution procedure utilizes SOLVER tool and it has been applied to a system with fictitious data but with reality and applicability in mind. As a result of the mathematical analysis, not only the most economic construction timings of surface water facilities and distribution systems but also the most economical water supply operating patterns are identified.