• IE interfaces
• /
• v.15 no.4
• /
• pp.474-482
• /
• 2002

In this paper, we propose a parametric optimization approach to simultaneously determining trip distribution, mode choice, and user-equilibrium assignment. In our model, mode choice decisions are based on a binomial logit model and passenger and cargo demands are divided into appropriate mode according to the user equilibrium minimum travel time. Underlying network consists of road and rail networks combined and mode choice available is auto, bus, truck, passenger rail, and cargo rail. We provide an equivalent convex optimization problem formulation and efficient algorithm for solving this problem. The proposed algorithm was applied to a large scale network examples derived from the National Intermodal Transportation Plan (2000-2019).

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.327-331
• /
• 2006

This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands and the product is provided to the warehouse via procurement ordering from any manufacturing plant or market The Problem is formulated as an Mixed Integer Programming with the objective function of minimizing the sum of inventory holding cost (at the warehouse and retailers), and transportation cost and procurement ordering cost at the warehouse, subject to inventory-balancing constraints, ordering constraints, vehicle capacity constraints and transportation time constraints. The problem is Proven to be NP-hard. Accordingly, a Lagrangean heuristic procedure is derived and tested for its effectiveness through computational experiments with some numerical instances.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.463-468
• /
• 2002

Recently, a multi-facility, multi-product and multi-period industrial problem has been widely investigated in Supply Chain Management(SCM). One of the key issues in the current SCM research area involves reducing both production and distribution costs. We have developed an optimization model to tackle the above problems under the restricted conditions such as transportation time and a zero inventory. The model can be used to deride an appropriate factory and assign an optimal output the factory yields. This paper deals with the main idea of the proposed methodology in depth.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.580-582
• /
• 2005

This paper presents a new method which applies a genetic algorithm(GA) for determining which sectionalizing switch to operate in order to solve the distribution system loss minimization re-configuration problem. The distribution system loss minimization re-configuration problem is in essence a 0-1 planning problem which means that for typical system scales the number of combinations requiring searches becomes extremely large. In order to deal with this problem, a new a roach which applies a GA was presented. Briefly, GA are a type of random number search method, however, they incorporate a multi-point search feature. Further, every point is not is not separately and respectively renewed, therefore, if parallel processing is applied, we can expect a fast solution algorithm to result.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.33-51
• /
• 1998

The industrial operation is one of the three basic modes of shipping operation with liner and Tramp operations. Industrial operators usually control vessels of their own or on a time charter to minimize the cost of shipping their cargoes. Such operations abound in shipping of bulk commodities, such as oil, chemicals and ores. This work is concerned with an operational optimization analysis of the fleet owned by a major oil company. a typical industrial operator. The operational optimization problem of the fleet of a major oil company is divided Into two phase problem. The front end corresponds to the optimization problem of the transportation of crude oil. product mix. and the distribution of product oil to comply with the demand of the market. The back end tackles the scheduling optimization problem of the fleet to meet the seaborne transportation demand derived from the front end. A case study reflecting the practices of an international major oil company is demonstrated to make clear the underlying ideas.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.51
• /
• pp.29-40
• /
• 1999

The distribution center location and routing problem involves interdependent decisions among facility, transportation, and inventory decisions. The design of distribution system affects the customers' purchase decision by sets the level of customer service to be offered. Thus the lower product availability may cause a loss of demand as falls off the customers' purchase intention, and this is related to the firm's profit reduction. This study considers the product availability of the distribution centers as the measure of the demand level change of the demand points, and represents relation between customer service and demand level with linear demand function. And this study represents the distribution center location and routing to demand point in order to maximize the total profit that considers the products' sales revenue by customer service, the production cost and the distribution system related costs.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.3
• /
• pp.194-200
• /
• 2005

A stochastic dynamic lot sizing problem for multi-item is suggested in the case that the distribution of the cumulative demand is known over finite planning horizons and all unsatisfied demand is fully backlogged. Each item is produced simultaneously at a variable ratio of input resources employed whenever setup is incurred. A dynamic programming algorithm is proposed to find the optimal production policy, which resembles the Wagner-Whitin algorithm for the deterministic case problem but with some additional feasibility constraints.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.04a
• /
• pp.477-482
• /
• 2004

Due to the traffic congestion of the city and public transportation-oriented policies, public transportation is receiving more attention and being used increasingly However, relatively less research on the design and distribution of public transportation network and limitations in quantitative approaches have made implementation and operation practically difficult. Over- or under-supply of transportation routes caused unbalanced connectivity among areas and differences in time, expenses and metal burden of users. On the other hand, the Space Syntax theory, designed to calculate the connectivity of urban or architectural space, helps generate quantitative connectivity of whole space simply based on the spacial structure. This study modified the original Space Syntax algorithm to fit the public transportation problem and showed how it is appied to a network by creating an artificial network using the GIS.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.3278-3288
• /
• 2011

Bulk freight is transported by a freight car, ship and tank lorry without packaging in a state of particles or powders. In korea, the main bulk freight include oil, grain, coal, cement, iron ore and these are occupied nearly 30% of the volume of gross domestic freight transportation. Therefore it is in important to transport efficient bulk freight transport system for the improvement of national distribution competitive as raw material for industry. Generally environment-friendly transfer modes such as railway and sea transport play an important role in bulk freight transport due to the mass transfer characteristics of bulk freight. This study is carried out for examining the problem of oil, grain, coal, cement, ore transportation through analyzing distribution flow of items and understanding characters of transfer modes.

• Management Science and Financial Engineering
• /
• v.17 no.2
• /
• pp.1-21
• /
• 2011

This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands. The problem is to determine order planning at the warehouse, and also vehicle schedules and delivery quantities for the retailers with the objective of minimizing the sum of ordering cost at the warehouse, inventory holding cost at both the warehouse and retailers, and transportation cost. For the problem, we give a Mixed Integer Programming formulation and develop a Lagrangean heuristic procedure for computing lower and upper bounds on the optimal solution value. The Lagrangean dual problem of finding the best Lagrangrean lower bound is solved by subgradient optimization. Computational experiments on randomly generated test problems showed that the suggested algorithm gives relatively good solutions in a reasonable amount of computation time.