• Management Science and Financial Engineering
• /
• v.18 no.1
• /
• pp.39-48
• /
• 2012

This article presents a way of tackling a special class of space optimization problems that arise in a number of practical applications in industry and elsewhere. It presents an elegant solution to a problem that was considered by (Das, 2005) in optimizing storage space in warehouse of a footwear manufacturing company. In (Das, 2005), the problem was formulated as a nonlinear programming problem. In this article, it is shown that the problem can be formulated as a generalized transportation problem which is a special case of generalized network flow problems. Further, an elegant scheme is devised to handle the dynamic situation of warehousing problem which can be easily translated into a decision support system for the warehouse management system. Also, the article points out certain obscurities and gaps in (Das, 2005).

• Journal of Navigation and Port Research
• /
• v.30 no.6 s.112
• /
• pp.457-464
• /
• 2006

Remarshalling operation is one of the operations considered important in an automated container terminal to perform quickly loading operations and delivery operations. It arranges the containers scattered at a verticla yard block in order to reduce the transfer time and the rehandling time of ATC(Automated Transfer Crane)s. This paper deals with the remarshalling planning problem minimizing the weighted operation time. This problem can be decomposed into 2 subproblems, storage space assignment problem and operation sequencing problem Storage space assignment problem decides to where containers are transported in terms of transportation time cost.. With results of a previous subproblem, operation sequence problem determines the ATC operation sequence, which minimizes the dead-heading of ATC This study formulates each subproblem with mixed integer program and dynamic program. To illustrate the proposed model, we propose an instance to explain the process of remarshalling planning.

• Journal of Korean Society of Transportation
• /
• v.27 no.4
• /
• pp.103-113
• /
• 2009

Quick accident spot reaching of 119ERU is the most important role in decrease of accident depth. If 4 minutes of wounded person pass after cardiac arrest, brain damage is begun. and If 10 minutes of wounded person pass after cardiac arrest, possibility to die rises. Accordingly, when establish 119ERU, need to consider travel time to traffic accidents spot. This treatise groped a facility location problem using SCLM and minisum location problem mutually. And existent minisum location problem has a problem that maximum travel time exceed $\lambda$. ERU to need in present situation and also can reduce average travel time. so this treatise propose modified minisum location problem. In case applying modified minisum location theory, 119ERU can arrive all demand and that is optimized about demand and travel time. Can minimise figure of 119 first aids to need in present situation applying this way, and also can reduce average passing time. Finally, this way can minimise figure of 119ERU to need in present situation and also can reduce average travel time.

• Journal of Construction Engineering and Project Management
• /
• v.4 no.1
• /
• pp.15-28
• /
• 2014

Completing road construction projects within the budget and time has been a problem for the Tanzania National Roads Agency (TANROADS); and the major problem highlighted in almost all projects being inadequate design. However, the extent to which inadequate design contributes to both time and cost overruns and its causes remained under-studied. The objective of this study is therefore to determine the extent of the effect of inadequate design, its causes and remedial measures. The methodology used in this study includes reviewing recent projects completion reports, holding roundtable discussions with consultants and TANROADS officials and analyzing the information. Cost and time overruns for the reviewed projects averaged 44% and 26% respectively. Similarly, the extents to which inadequate design contributes to cost and time overruns were on average found to be 61% and 85% respectively. The overruns are predominantly related to problems that occurred during the design process. To alleviate the problem, TANROADS is advised to improve the management of design projects, enhance the process of reviewing design reports, improve the design process including introducing Road Safety Audit and geometric design manuals, and increase staff to match the work-load.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.57-62
• /
• 2004

This paper deals with a waypoint trajectory following problem for the tilt-rotor UAV under development in Korea (TR-KUAV). In this problem, dynamic model inversion based on the linearized model and Sigma-Phi neural network with adaptive weight update are involved to realize the waypoint following algorithm for the vehicle in the helicopter flight mode (nacelle angle=0 deg). This algorithms consists of two main parts: outer-loop system as a command generator and inner-loop system as stabilizing controller. In this waypoint following problem, the position information in the inertial axis is given to the outer-loop system. From this information, Attitude Command/Attitude Hold logic in the longitudinal channel and Rate Command/Attitude Hold logic in the lateral channel are realized in the inner-loop part of the overall structure of the waypoint following algorithm. The nonlinear simulation based on the TR-KUAV is carried out to evaluate the stability and performance of the algorithm. From the numerical simulation results, the algorithm shows very good tracking performance of passing the waypoints given. Especially, it is observed that ACAH/RCAH logic in the inner-loop has the satisfactory performance due to adaptive neural network in spite of the model error coming from the linear model based inversion.

• Journal of Korean Society of Transportation
• /
• v.14 no.1
• /
• pp.51-67
• /
• 1996

The optimal path-finding problem becomes complicated when multiple variables are simultaneously considered such as physical route length, degree of congestion, traffic capacity of intersections, number of intersections and lanes, and existence of free ways. Therefore, many researchers in various fields (management science, computer science, applied mathematics, production planning, satellite launching) attempted to solve the problem by ignoring many variables for problem simplification, by developing intelligent algorithms, or by developing high-speed hardware. In this research, an integration of expert system technique and case-based reasoning in high level with a conventional algorithms in lower level was attempted to develop an optimal path-finding system. Early application of experienced driver's knowledge and case data accumulated in case base drastically reduces number of possible combinations of optimal paths by generating promising alternatives and by eliminating non-profitable alternatives. Then, employment of a conventional optimization algorithm provides faster search mechanisms than other methods such as bidirectional algorithm and $A^*$ algorithm. The conclusion obtained from repeated laboratory experiments with real traffic data in Seoul metropolitan area shows that the integrated approach to finding optimal paths with consideration of various real world constraints provides reasonable solution in a faster way than others.

• Journal of Korean Society of Transportation
• /
• v.18 no.1
• /
• pp.61-73
• /
• 2000

The equilibrium network design problem can be formulated as a mathematical Program with variational inequality constraints. We know this problem may have may multiple local solutions due to its inherent characteristics - Nonlinear Objective function and Nonlinear, Nonconvex constraints. Hence, it is difficult to solve for a globally optimal solution. In this paper, we propose a genetic algorithm to obtain a globa1 optimum among many local optima. A Proposed a1gorithm is compared with 4 different solution algorithms for 1 small test network and 1 real-size network. The results of some computational testing are reported.

• Journal of Engineering Education Research
• /
• v.15 no.4
• /
• pp.35-40
• /
• 2012

This study presents an analysis of the current situation (management, approach, adjustment, transportation, and others) of teaching portfolio by examining the teaching portfolio managers (staffs, researchers, teaching assistants, etc.) of 6 universities in the southeast of Korea. The rationale for the study focus is that the existing teaching portfolio either suffers a problem in the transportation, approach, adjustment and/or management or is likely to raise a problem in the future. In order to solve this problem, this study builds a web-based e-teaching portfolio. According to the analysis results, the engineering education system was established in all 6 universities (Ed- note that '6 universities' has already been specified as the study sample). The teaching portfolio was partially digitalized in this system, despite some problems of converting analog data into digital data, which induced difficulties in constructing the overall e-teaching portfolio. Therefore, this study focused on constructing an e-teaching portfolio without developing any additional system by using the existing system positively, and also on determining the appropriate components among the existing teaching portfolio components. Accordingly, in order to convert the analog data into the digital data required for this study, we used a digital camera as the conversion device and converted the teaching portfolio components into those appropriate for the e-teaching portfolio. Finally, we constructed an existing system appropriate for the e-teaching portfolio by using these devices and components.

• Journal of Information Technology Services
• /
• v.10 no.3
• /
• pp.49-59
• /
• 2011

A ship scheduling model is presented for the raw material transportation problem with yard storage constraints in a steel mill. The problem is formulated as 0, 1 mixed integer programming considering such constraints as loading port conditions, ship size and hold capacity, unloading conditions, and yard storage space. In addition, inventory related constraints including safety stock are taken into consideration to support the continuous operations of steel making process. The proposed model has been implemented and applied successfully to a real world problem, and its results show the improvement of performance compared to the traditional method. For example, the arrival dates of ships are determined satisfying the constraints. The total inventory level is minimized at the stock yard as a result. Also, the safety inventory level is always kept at the planning stage, and the standard deviation of total inventory level is reduced significantly. Further research is expected to develop efficient heuristics to have a better response time for even larger scale problems.

• Journal of Korean Society of Transportation
• /
• v.17 no.2
• /
• pp.127-135
• /
• 1999

Most existing progression bandwidth models maximize the single or multi weighted sum of bandwidths in the both directions to improve traffic mobility on an arterial, but they cannot be applied to general networks. Even though a few models formulating a looped network problem cannot be applied to networks have not loops. Also they have some defects in optimizing phase sequences. Therefore, the objective of this study is to develope a mathematical formulation of the synchronization problem for a general traffic network. The goal is achieved successfully by introducing the signal phasing for each movement and expanding the mixed integer linear programming of MAXBAND. The experiments indicate that the proposed model can formulate the general traffic network problem mere efficiently than any other model. In conclusion, this model may optimize signal time to smooth progression in the general networks.