• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.63-79
• /
• 1994

Many vehicle fleet planning systems have been suggested to minimize the routing distances of vehicles or reduce the transportation cost. But the more considerations the method takes, the higher complexites are involved in a large number of practical situations. The purpose of this paper is to vehicle fleet planning system. This paper is considered multi-objective optimization. The vehicle fleet planning system developed by this study involves such complicated and restricted conditions as one depot, multiple nodes (demand points), multiple vehicle types, multipel order items, and other many restrictions for operating vehicles. The proposed algorithm is compared with the nearest neighbor heuristic (NNH) and the savings heuristic (SAH) algorithm in terms of total logistics cost and driving time. This method constructs a route with a minimum number of vehicles for a given demand. This method can be used to any companys which vehicle fleet planning system under circumstances considered in this paper.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.2
• /
• pp.81-94
• /
• 1999

ATM network design procedure is different from the current circuit or packet networks design procedure because of the variety of the offered services and the variability of requested bandwidth for each connection of ATM network. A number of optimization models for the link dimensioning of ATM network design have been proposed in the literature. However, most of the literature did not consider the modularity of resources allocated to a transmission path and the non-bifurcation of a VP link over the more than one TP, which are standardized in recent ITU-T Recommendations. In thIs paper, we propose a mathematical model for link dimensioning of ATM networks, based on the network synthesis method and a generalized bin-packing problem. The suggested model satisfies the constraints mentioned in the ITU-T Recommendations. We also propose efficient and practical algorithms for the suggested model. Computational experiment shows that the suggested algorithm gives efficient solutions even for moderate and large-sized networks within reasonable time.

• IE interfaces
• /
• v.12 no.4
• /
• pp.557-566
• /
• 1999

This paper considers a door-to-door service system in which pickups or deliveries are performed by a trip of a single vehicle. Each customer request specifies the quantity of the load transported, the location, and the time window within which it is to be picked up or delivered. Since the system is demand responsive, i.e., new or emergent requests become available in real-time, the current vehicle route has to be reconstructed to include these requests. In this case, only continuous vehicle tracking enables control over the requests and ensures that the requests are satisfied on time. This paper suggests a pilot pickup/delivery management system integrating a geographic information system(GIS) and a global position system(GPS) to efficiently deal with such a dynamic environment. The GIS offers a way of displaying the vehicle route on digital maps for the region under concerned. Also displayed is the current location of the vehicle obtained from the GPS. A heuristic algorithm is used to dynamically determine the vehicle route. A practical example is provided to show the feasibility of the system.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.5
• /
• pp.492-500
• /
• 2014

Activity monitoring has been widely recognized as important and critical tools in system monitoring for detection of abnormal behavior. In this research, we propose a data-driven activity monitoring method to measure relative sales performance which is not sensitive to special event which frequently occur in marketing area. Moreover, the proposed method can automatically updates the monitoring threshold that accommodates a drastically changing business environment. The results from simulation and practical case study from sales of electronic devices demonstrate the usefulness and applicability of the proposed activity monitoring method.

• Industrial Engineering and Management Systems
• /
• v.12 no.1
• /
• pp.30-35
• /
• 2013

Motivated by the emergency scheduling in a transportation network, this paper considers a transportation problem, in which, the truck times and transportation costs are assumed as uncertain variables. To meet the demand in the practical applications, two optimization objectives are considered, one is the total costs and another is the completion times. And then, a multi-objective optimization model is developed according to the situation in applications. Because there are commensurability and conflicting between the two objectives commonly, a solution does not necessarily exist that is best with respective to the two objectives. Therefore, the problem is reduced to a single objective model, which is an uncertain programming with a chance-constrain. After some analysis, its equivalent deterministic form is obtained, which is a nonlinear programming. Based on a stepwise optimization strategy, a solution method is developed to solve the problem. Finally, the computational results are provided to demonstrate the effectiveness of our model and algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.745-748
• /
• 2003

HLA-RTI is Middleware for the distribute simulation that developed in the US Department of Defense. This provides fast accomplishment speed and reliability than distribute simulation Middleware by transfer. However, DDM(Data Distribution Management) service is used as data filtering technology in the existing HLA-RTI. As for this, the problem that network traffic increases in data exchange between the mobility simulation objects is generated. it proposes applying agent technology to the mobility simulation object in order to solve these problems in this paper in this. And this paper applies that to practical simulation and analyzes performance between each data filtering technology with comparison.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.95-100
• /
• 2006

While conventional business administration-based information technology management methods are applied to the risk analysis of information systems, no security risk analysis techniques have been used in relation to information protection. In particular, given the rapid diffusion of information systems and the demand for information protection, it is vital to develop security risk analysis techniques. Therefore, this paper will suggest an ideal risk analysis process for information systems. To prove the usefulness of this security risk analysis process, this paper will show the results of managed, physical and technical security risk analysis that are derived from investigating and analyzing the conventional information protection items of an information system.

• Korean Management Science Review
• /
• v.22 no.1
• /
• pp.167-178
• /
• 2005

The 2DBPP(Two-Dimensional Bin Packing Problem) is a problem of packing each item into a bin so that no two items overlap and the number of required bins is minimized under the set of rectangular items which may not be rotated and an unlimited number of identical .rectangular bins. The 2DBPP is strongly NP-hard and finds many practical applications in industry. In this paper we discuss a tabu search approach which includes tabu list, intensifying and diversification Strategies. The HNFDH(Hybrid Next Fit Decreasing Height) algorithm is used as an internal algorithm. We find that use of the proper parameter and function such as maximum number of tabu list and space utilization function yields a good solution in a reduced time. We present a tabu search algorithm and its performance through extensive computational experiments.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.4
• /
• pp.13-26
• /
• 1999

When we try to design a production planning system for a manufacturing company, it is a time consuming task to analyze various planning activities and identify inter-relationship among a lot of decisions made for the production planning. Most of the research efforts have been concentrated to well-organized independent decision-making problems that may usually be identified only after analyzing the characteristics of the decision-making process as a whole. In this paper, a methodology is suggested to characterize the whole process of the production planning for a manufacturing company and reduce the complexity of decision-making problems. The methodology is based on an experience of developing a production planning software for an automobile component manufacturer in korea. First, it is explained how to identify and represent the dependency among various decision-making variables. And a methodology is proposed to analyze the identified dependency among decision variables and identify decision-making process. Lastly, a practical example is provided to illustrate the analysis procedure in this paper.

• Korean Management Science Review
• /
• v.17 no.2
• /
• pp.87-95
• /
• 2000

This paper presents two analytical approaches to determine the vehicle fleet size for container shuttle service. The shuttle service can be defined as the repetitive travel between the designated places during working period. In the first approach, the transportation model is adopted in order to determine the number of vehicles required. Its advantages and disadvantages in practical application are also discussed. In the second approach, a logical network which is oriented on job is transformed from a physical network which is focused on demand site. Nodes on the logical network represent jobs which include loaded travel, loading and unloading and arcs represent empty travel for the next jobs which include loaded travel, loading and unloading and arcs represent empty travel for the next job. Then a mathematical formulation is constructed similar to the multiple traveling salesman problem (TSP). A solution procedure is carried out based on the well-known insertion heuristic with the real world data.