• Journal of Korean Port Research
• /
• v.10 no.2
• /
• pp.7-15
• /
• 1996

A berth assignment problem has a direct impact on assessment of charges made to ships and goods. A berth can be assigned to incoming vessels and operated in tow different ways: as a common user berth, as a preference berth. A common user berth is a berth that any ship calling at a port may be permitted to use according to her time of arrival and to priorities as determined by the port authority. In this paper, we concerned with various types of mathematical programming models for a berth assignment problem to achive an efficient berth operation. In this paper, we focus on a reasonable berth assignment programming in a public container terminal in consideration of trade-off between server and user. We propose a branch and bound algorithm & heuristic algorithm for solving the problem. We suggest three models of berth assignment to minimizing the objective functions such as total port time, total berthing time and maximum berthing time by using a revised Maximum Position Shift(MPS) with which the trade-off between servers and users can be considered. The berth assignment problem is formulated by min-max and 0-1 integer programming and developed heuristic algorithm to solve the problem more easily instead of branch and bound method. Finally, we gave the numerrical solutions of the illustrative examples.

• Journal of the Korean Geographical Society
• /
• v.49 no.3
• /
• pp.423-437
• /
• 2014

Districting is a spatial decision making process to make a new regional framework for affecting human activities. Natural barriers such as rivers and mountains located within a reorganized district may reduce the efficiency of reorganized human activities. This implies that it is necessary to consider boundary characteristics in a districting process. The purpose of this research is to develop a new spatial optimization model based on boundary characteristics for districting problems. The boundary characteristics are evaluated as continuous value expressing the possibility of combining adjacent two basic spatial units rather than a dichotomous value with 1 or 0 and are defined as an objective function in the model. In addition, the model has explicitly formulated contiguity constraints as well as constraints enforcing demand balance among districts such as population and area. The boundary attributes are categorized into physical and relational characteristics. Suitability analysis is used to combine various variables related to each boundary characteristic and to evaluate the coupling possibility between two neighboring basic units. The model is applied to an administrative redistricting problem. The analytical results demonstrate that various boundary characteristics could be modeled in terms of mixed integer programming (MIP).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.183-191
• /
• 2011

This paper suggests emergency medical service vehicle (ambulance) algorithm when the emergency patient occurs in order to be sufficient the maximum permission time T of arrival about all sectors in one city that is divided in the various areas. This problem cannot be solved in polynomial times. One can obtains the solution using the integer programming. In this paper we suggest vertex set (or dominating set) algorithm and easily decide the location of ambulances. The core of the algorithm decides the location of ambulance is to the maximum degree vertex among the neighborhood of minimum degree vertex. For the 33 sectors Ostin city in Texas, we apply $3{\leq}T{\leq}20$ minutes. The traditional set cover algorithm with integer programming cannot obtains the solution in several T in 18 cases. But, this algorithm obtains solution for all of the 18 cases.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.11-18
• /
• 2006

The logical analysis of data(LAD) is a Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a novel optimization-based pattern generation methodology and propose two mathematical programming models, a mixed 0-1 integer and linear programming (MILP) formulation and a well-studied set covering problem (SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with ease patterns of high complexity that cannot be generated with the conventional approach.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.1
• /
• pp.53-53
• /
• 1989

Generally, the standard sizes of military combat fatigues should be determined by considering the coverage rate in order to minimize the military personnel who can't put on the ready made military combat fatigues. The coverage rate should be increased by the longer interval of the standard size but the satisfactory rate will be decreased due to the longer interval of size. This study develops a method selecting optimal standard sizes of the military combat fatigues in order to maximize the satisfactory rate that insures the coverage rate to meet a given level for ready made military combat fatigues. This method selects candidate standard sizes at second and finally, establishes a 0-1 integer programming model. The result shows that the method increases both coverage and satisfactory rate more than those of the previous method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.1-15
• /
• 2005

In this paper, we deal with a mesh network design problem arising from the deployment of WDM for the optical internet. The mesh network consists of mesh topology for satisfying traffic demand while minimizing the cost of WDM, OXC, and fiber cables. The problem seeks to find an optimal routing of traffic demands in the network such that the total cost is minimized. We formulate the problem as a mixed-integer programming model and devise a tabu search heuristic procedure. Also we develop an optical internet design system that implements the proposed tabu search heuristic procedure. We demonstrate the computational efficacy of the proposed algorithm, compared with CPLEX 8.0.

• Proceedings of the Safety Management and Science Conference
• /
• 2000.11a
• /
• pp.81-85
• /
• 2000

The purpose of this paper is to describe a new analytic method of capital budgeting projects that takes into account both customer wants and competitor's status and to give decision makers a tool for goal setting and planning for technology. This model, which is based on quality function deployment(QFD), has used the analytic hierarchy process(AHP) to determine the intensity of the relationship between the variables involved in each matrix of the model and the 0-1 integer programming to determine the allocation of funds to various technological projects. This paper also proposes how to calculate the new weight of columns to consider various strength levels of roof matrix, representing the correlation among the quality characteristics, using Lymsn's normalization procedure. To compare this model with Partovi's model, 1 adapt the same example which is suggested by Partovi and I show that the value of object function, has maximization problem, in this model is larger than that in Partovi's model.

• Journal of Korean Port Research
• /
• v.9 no.2
• /
• pp.1-8
• /
• 1995

Generally, berth assignment problem has conflicting factors according to the interested parties. In the view of shipping company, it is desirable that berth assignment is made according to the order of arrival. But in the view of port operator, it is better to be assigned regardless the order of arrival to promote the efficiency of berth operation. Thus, it is necessary to establish berth assignment planning which reflects both of interests in a practical situation. This paper aims to develop a reasonable berth assignment algorithm in a container terminal by considering the prescribed factors, and suggests three types of models minimizing the objective functions such as total port staying time, total mooring time and total maximum mooring time by using MPS concept. These models are formulated by 0-1 integer programming and min-max type function, but as the number of variables increases, an optimal solution cannot be achieved easily within a desired computational time. Thus, to tackle this problem this paper proposes a heuristic algorithm, and also the heuristic algorithm proposed in this paper is verified through the several examples.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.53-68
• /
• 1996

This paper focuses on the method of setting priorities for telecommunications standardization work areas (SWAs) and standardization work items (SWIs), detailed sub-areas of each SWA. It is based on prioritization of SWAs to make a strategic plan that usually includes prioritization, resource allocation and standardization schedules for each SWA in telecommunications field. We applied the simple Delphi technique and the Analytic Hierarchy Process (AHP) to the prioritization process. We also introduce 0-1 integer programming for resource allocation using the AHP result. We present analyzed results according to the proposed process. The result of this study will be useful input for telecommunications standardization policy making and practical implementation.

• Journal of the Korea Safety Management & Science
• /
• v.2 no.4
• /
• pp.125-138
• /
• 2000

The purpose of this paper is to describe a new analytic method of capital budgeting projects that takes into account both customer wants and competitor's status and to give decision makers a tool for goal setting and planning for technology. This model, which is based on quality function deployment(QFD), has used the analytic hierarchy process(AHP) to determine the intensity of the relationship between the variables involved in each matrix of the model and the 0-1 integer programming to determine the allocation of funds to various technological projects. This paper also proposes how to calculate the new weight of columns to consider various strength levels of roof matrix, representing the correlation among the quality characteristics, using Lyman's normalization procedure. To compare this model with Partovi's model, I adapt the same example which is suggested by Partovi and I show that the value of object function, has maximization problem, in this model is larger than that in Partovi's model.