• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.1
• /
• pp.14-24
• /
• 2002

We focus on resource allocation planning in container terminal operation planning problems and present network design model and genetic algorithm. We present a network design model in which arc capacities must be properly dimensioned to sustain the container traffic. This model supports various planning aspects of container terminal and brings in a very general form. The integer programming model of network design can be extended to accommodate vertical or horizontal yard configuration by adding constraints such as restricting the sum of yard cranes allocated to a block of yards. We devise a genetic algorithm for the network design model in which genes have the form of general integers instead of binary integers. In computational experiments, it is found that the genetic algorithm can produce very good solution compared to the optimal solution obtained by CPLEX in terms of computation time and solution quality. This algorithm can be used to generate many alternatives of a resource allocation plan for the container terminal and to evaluate the alternatives using various tools such as simulation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.4
• /
• pp.289-296
• /
• 2011

In most distribution centers, products are received from the suppliers in units of pallet, stored in a rack, moved to the picking area for replenishment, picked according to customer orders, and shipped to customers. In some distribution centers, however, replenishment is made in not a whole pallet but only a portion of a pallet load, mainly due to the limited space in the order-picking area; as a result, partially loaded pallets occupy cells in the rack. As the number of slow-moving items increases, more cells are occupied by partially loaded pallets so that fewer empty cells are available for storing full, incoming pallets. This will necessitate the construction or leasing of additional storage space, which will entail significant cost. As an alternative, we propose pallet consolidation, which involves moving a partial load to another partially-loaded pallet in order to create one empty cell in the rack. In this paper, we define three pallet consolidation problems; formulate each problem as a binary integer programming model; and present heuristic algorithms for the problems. The average performance of each of the proposed heuristics is evaluated using simulation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.4
• /
• pp.63-82
• /
• 2008

The explosively growing attractiveness of the Web is commencing significant demands for a structuring analysis on various web objects. The larger the substantial number of web objects are available, the more difficult for the clients(i.e. common web users and web robots) and the servers(i.e. Web search engine) to retrieve what they really want. We have in mind focusing on the structure of web objects by introducing optimization models for more convenient and effective information retrieval. For this purpose, we represent web objects and hyperlinks as a directed graph from which the optimal structures are derived in terms of rooted directed spanning trees and Top-k trees. Computational experiments are executed for synthetic data as well as for real web sites' domains so that the Lagrangian Relaxation approaches have exploited the Top-k trees and Hop constraint resolutions. In the experiments, our methods outperformed the conventional approaches so that the complex web graph can successfully be converted into optimal-structured ones within a reasonable amount of computation time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2282-2303
• /
• 2021

To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

• Journal of Korean Society of Transportation
• /
• v.30 no.1
• /
• pp.125-133
• /
• 2012

This paper deals with the passenger transfer trips counted from smart bus-card data from Seoul transit network to understand the current operational condition of the system. Objective of this study is to relocate the location of the transit transfer centers. It delivers a bi-level programing model. The upper model is a linear 0-1 binary integer program having the objective of total travel cost minimization constrained by the number of transfer centers and the total construction budget. The lower model is an user equilibrium assignment model determining the passengers' route choice according to the transfer center locations. The proposed bi-level programming model was tested in an example network. The result showed that the proposed was able to find the optimal solution.

• Journal of Korea Society of Industrial Information Systems
• /
• v.24 no.6
• /
• pp.55-65
• /
• 2019

With the advent of the Fourth Industrial Revolution and changes in the educational environment, team-based assignments are increasing in university classes. Effective team formation in team-based class is an important issue that affects students' satisfaction and the effectiveness of education. However, previous studies mostly focused on post analysis on the results of team formation, which makes it difficult to use them in actual classes. In this paper, we present a mathematical model of how to create a balanced team that reflects students' abilities and other characteristics. Characteristic values for assignment may be scores, such as students' proficiency, binary values such as gender, and multi-values, such as grade or department. This problem is a type of equitable partitioning problem, which takes the form of 0-1 integer programming, and the objective function is linear or nonlinear, depending on how balance is achieved. The basic model or the extended model presented can be applied to the situation where teams are balanced in consideration of various factors in actual class.

• Journal of the Korean Society of Safety
• /
• v.11 no.2
• /
• pp.150-159
• /
• 1996

In this paper, an A-team(Asynchronous Team ) based approach for Reactive power and volage control considering static security assessment in a power system with infrastructural deficiencies is proposed. Reactive power and voltage control problem is the one of optimally establishing voltage level given several constraints such as reactive generation, voltage magnitude, line flow, and other switchable reactive power sources. It can be formulated as a mixed-integer linear programming(MILP) problem without deteriorating of solution accuracy to a certain extent. The security assessment is to estimate the relative robustness of the system in Its present state through the evaluation of data provided by security monitoring. Deterministic approach based on AC load flow calculations is adopted to assess the system security, especially voltage security. A security metric, as a standard of measurement for power system security, producting a set of discrete values rather than binary values, is employed. In order to analyze the above two problems, reactive power/voltage control problem and static security assessment problem, in an integrated fashion for real-time operations, a new organizational structure, called an A-team, is adopted. An A-team is an organization for agents which ale all autonomeus, work in parallel and communicate asynchronously, which is well-suited to the development of computer-based, multi-agent systems for operations. This A-team based approach, although it is still in the beginning stage, also has potential for handling other difficult power system problems.