• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.45 no.4
• /
• pp.134-141
• /
• 2022

Transportation in urban area has been getting hard to fulfill the demand on time. There are various uncertainties and obstacles related with road conditions, traffic congestions, and accidents to interrupt the on-time deliveries. With this situation, the last mile logistics has been a keen issue for researchers and practitioners to find the best strategy of the problem. A way to resolve the problem is to use parcel lockers. Parcel locker is a storage that customers can pick up their products. Transportation vehicles deliver the products to parcel lockers instead of all customer sites. Using the parcel lockers, the total delivery costs can be reduced. However, the inconvenience of customer has to increase. Thus, we have to optimal solution to balance between the total delivery costs and customers' inconvenience. This paper formulates a mathematical model to find the optimal solution for the vehicle routing problem and the location problem of parcel lockers. Experimental results provide the viability to find optimal strategy for the routing problem as well as the location problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.2
• /
• pp.124-131
• /
• 2011

In this research report, we propose a heuristic algorithm with some primal recovery strategies for capacitated facility location problems (CFLP), which is a well-known combinatorial optimization problem with applications in distribution, transportation and production planning. Many algorithms employ the branch-and-bound technique in order to solve the CFLP. There are also some different approaches which can recover primal solutions while exploiting the primal and dual structure simultaneously. One of them is a MVCD (Mean Value Cross Decomposition) ensuring convergence without solving a master problem. The MVCD was designed to handle LP-problems, but it was applied in mixed integer problems. However the MVCD has been applied to only uncapacitated facility location problems (UFLP), because it was very difficult to obtain "Integrality" property of Lagrangian dual subproblems sustaining the feasibility to primal problems. We present some heuristic strategies to recover primal feasible integer solutions, handling the accumulated primal solutions of the dual subproblem, which are used as input to the primal subproblem in the mean value cross decomposition technique, without requiring solutions to a master problem. Computational results for a set of various problem instances are reported.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.107-116
• /
• 2010

The facility location problem is one of the traditional optimization problems. In this paper, we deal with the single source capacitated facility location problem (SSCFLP) and it is known as an NP-hard problem. Thus, it seems to be natural to use a heuristic approach such as evolutionary algorithms for solving the SSCFLP. This paper introduces a new efficient evolutionary algorithm for the SSCFLP. The proposed algorithm is devised by incorporating a general adaptive link adjustment evolutionary algorithm and three heuristic local search methods. Finally we compare the proposed algorithm with the previous algorithms and show the proposed algorithm finds optimum solutions at almost all middle size test instances and very stable solutions at larger size test instances.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.3
• /
• pp.250-259
• /
• 2001

Given a tree structured network in which each node has its own demand and also stands for a candidate location of a potential facility, such as plant or warehouse, a capacitated facility location problem on the network (CFLPOT) is to decide capacitated facility locations so that the total demand occurred on the network can be satisfied from those facilities with the minimum cost. In this paper, we first introduce a mixed integer programming formulation for CFLPOT with two additional assumptions, the indivisible demand assumption and the contiguity assumption and then show that it can be reformulated as a tree partitioning problem with an exponential number of variables. We then show that it can be solved in O($n^2b$) time by utilizing the limited column generation method developed by Shaw (1993), where n is the total number of nodes in the network and b is the maximum facility capacity. We also develop a depth-first dynamic programming algorithm with a running time of O(nb) for finding the locally maximal reduced cost which plays an important role in the limited column generation method. Finally, we implement our algorithms on a set of randomly generated problems and report the computational results.

• Journal of Industrial Technology
• /
• v.38 no.1
• /
• pp.9-13
• /
• 2018

FRP(Fiber Reinforced Plastic) ships are easy to manufacture and repair. Also they are more durable and cheaper than steel wires and neck lines. Therefore FRP ships are widely used in small ships. In Korea, the amount of waste FRP ships is increasing. It is expected that a large amount of waste FRP ships will be generated. Waste FRP ships are emerging as a social problem, such as the difficulty in preserving the marine environment. To improve this, a waste FRP ship melting process system has been developed. In order to construct an effective waste FRP ship processing system, it is necessary to study the treatment facilities location problem. In this paper, we suggest mathematical model to solve optimal location problem of waste FRP Ships and discuss on results by applying it to nine regions selected as candidates for treatment facilities.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.316-321
• /
• 2007

The hierarchical covering location problem emphasizes the issue of locating of hierarchical facilities in order to maximize the number of customers that can be covered. In the classical HCLP(Hierarchical Covering Location Problem), it is assumed that the customers are covered completely if they are located within a specific distance from the facility, and not covered otherwise. The generalized HCLP is introduced that the coverage of customers is measured to be any real value rather than 0 or 1, where the service level may decrease according to the distance. Mixed integer programming formulation for the generalized HCLP is suggested with a partial coverage of service. Solutions are found using OPL Studio, and are evaluated for various cases.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.1
• /
• pp.77-93
• /
• 1998

It is discussed how to locate idle vehicles of AGVS on unidirectional guide paths. The problem is modeled as a median location problem on a cyclic network. The characteristics of the optimal location are analyzed and some useful properties are suggested to reduce the solution space. Based on the properties found, several special types of networks - a pure single-loop type, the loop type with a single branching intersection and the loop type with local branching node - are also analyzed as well as the general cyclic network. In each case of the networks, a solution procedure is suggested. Some numerical examples are provided to illustrate the algorithms developed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.37 no.4
• /
• pp.197-209
• /
• 2012

This paper studies an emergency service vehicle location problem, where minimum reliability level pre-specified at each demand point is assured. Several models are suggested depending on the busy fraction, which is the time proportion of unavailability for the ambulances. In this paper a new model on computing the busy fraction is suggested, where it varies depending on the distance between the demand point and ambulances, hence it may respond the more realistic situation. The busy fraction for the ambulance location determined by the optimization model is computed by the simulation, and updated through the iterative procedure. It has been shown that the performances of the solutions obtained by the algorithm suggested for the instances appeared in the literature.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.6
• /
• pp.1265-1273
• /
• 2011

This article deals with the problem of testing the equality of the location parameters in the half-normal distributions. We propose Bayesian hypothesis testing procedures for the equality of the location parameters under the noninformative prior. The non-informative prior is usually improper which yields a calibration problem that makes the Bayes factor to be defined up to arbitrary constants. This problem can be deal with the use of the fractional Bayes factor or intrinsic Bayes factor. So we propose the default Bayesian hypothesis testing procedures based on the fractional Bayes factor and the intrinsic Bayes factors under the reference priors. Simulation study and an example are provided.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.7
• /
• pp.355-362
• /
• 2003

The fault analysis problem of a distribution network has many difficulties comes from the unbalance of loads or networks and the lacks of load information. The unbalance of loads or networks make the fault location difficult when it use the classical sequence transformation. Moreover the amount of load in the distribution networks fluctuates with time. This paper introduces a recent fault location algorithm using iterative method which handle the unbalance of the problem. But, the fault location errors comes from the load fluctuations still left. For the real application of the new fault location algorithm in distribution networks, this paper studied the effect of the load fluctuations in the algorithm.