• Journal of the Korean Society for Railway
• /
• v.17 no.4
• /
• pp.313-319
• /
• 2014

Additional train scheduling is often required to increase the capacity of transporting passengers or freight. In most previous studies on scheduling additional trains, operation time of the added train is designated first; and then the train operation feasibility is examined. However, it is often difficult to apply this approach to domestic trains because the density of the railroad network in Korea is high and various types of trains are in use. Moreover, for freight trains, it is even more challenging because the delay is accumulated due to lower priority whenever a freight train and a passenger train contend for a common segment of rail. In this paper, we address the additional train scheduling problem which entails finding a feasible schedule for an additional train having a fixed departure time or departure time windows. The problem is modeled as a mixed integer programming and a column generation technique is used to solve it.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.1
• /
• pp.35-49
• /
• 2008

To load a container in a yard block onto a ship, a Transfer Crane (TC) moves to a target yard bay, then its hoist picks up a selected container and loads it onto a waiting Yard Truck (YT). An optimal routing problem of Transfer Crane is a decision problem which determines a given TC's the visiting sequence of yard-bays and the number of containers to transfer from each yard-bay. The objective is to minimize the travel time of the TC between yard-bays and setup time for the TC in a visiting yard. In this paper, we shows that the problem is NP-complete, and suggests a new formulation for it. Using the new formulation for the problem, we investigate some characteristics of solutions, a lower and upper bounds for it. Moreover, our lower and upper bound is very efficient to applying some instances suggested in a previous work.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.381-385
• /
• 2003

We consider the bandwidth parking problem arising from telecommunication networks The problem is to determine the set of calls to be routed and an assignment or them to the paths in arc capacitated network. The objective is to maximize profit. We formulate the problem as an integer programming and propose an algorithm to solve it. Column generation technique to solve the linear programming relxation is proposed with two types of columns in addition, to obtain an optimum integer solution, we consider a new branching strategy. Computational experiments show that the algorithm gives option at solutions within reasonably small time limits.

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

Multicast technology allows the transmission of data from one source node to a selected group of destination nodes. Multicast routes typically use trees, called multicast routing trees, to minimize resource usage such as cost and bandwidth by sharing links. Moreover, the quality of service (QoS) is satisfied by distributing data along a path haying no more than a given number of arcs between the root node of a session and a terminal node of it in the routing tree. Thus, a multicast routing tree for a session can be represented as a hop constrained Steiner tree. In this paper, we consider the hop-constrained multicast route packing problem with bandwidth reservation. Given a set of multicast sessions, each of which has a hop limit constraint and a required bandwidth, the problem is to determine a set of multicast routing trees in an arc-capacitated network to minimize cost. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a modified cover inequality is used to strengthen the integer programming formulation.

• ETRI Journal
• /
• v.24 no.2
• /
• pp.131-141
• /
• 2002

This paper considers a routing and wavelength assignment problem (RWAP) for the implementation of efficient Wavelength Division Multiplexing all-optical mesh networks without wavelength conversion. For a given physical network and required connections, the solution to the RWAP consists in how to select a suitable path and wavelength among the many possible choices for each connection so that no two paths using the same wavelength pass through the same link, while minimizing the number of required wavelengths. We introduce an integer programming formulation of the RWAP, which has an exponential number of variables, and propose an algorithm to solve it based on the column generation technique. The proposed algorithm can yield high quality solutions and tight lower bounds at the same time. Though the proposed algorithm cannot guarantee optimal solutions, computational results show that the algorithm yields provably good solutions within a reasonable time.

• IE interfaces
• /
• v.13 no.4
• /
• pp.556-563
• /
• 2000

In this paper, we consider wavelength assignment problem (WAP) in Wavelength division multiplexed (WDM) unidirectional optical telecommunication ring networks. We show that, even though WAP on unidirectional ring belongs to NP-hard, WAP can be exactly solvable in real-sized WDM rings for near future demand. To accomplish this, we convert WAP to the vertex coloring problem of the related graph and choose a special integer programming formulation for the vertex coloring problem. We use a column generation technique in a branch-and-price framework for the suggested formulation. We also propose some generic heuristics and do the performance comparison with the suggested optimization algorithm.

• Journal of the Korean Society for Marine Environment & Energy
• /
• v.13 no.1
• /
• pp.12-17
• /
• 2010

Oscillating Water Column (OWC) device has been widely employed in the wave energy conversion. Wave Focusing Device (WFD) is proposed to be helpful for improving the operating performance of OWC chamber. In the present paper, a Numerical Wave Tank (NWT) using two-phase VOF model is utilized to simulate the generation and propagation of incident regular waves, water column oscillation inside the chamber. The NWT consists of the continuity equation, Reynolds-averaged Navier-Stokes equations and two-phase VOF functions. The standard k- turbulence model, the finite volume method, NITA-PISO algorithm and dynamic mesh technique are employed. Effects of WFD on the operating performance of OWC chamber are investigated numerically.

• Journal of the Korea Concrete Institute
• /
• v.14 no.3
• /
• pp.291-298
• /
• 2002

Recently, construction of reinforced concrete tall buildings is widely increased according to the improvement of material quality and design technology. Therefore, differential shortenings of columns due to elastic, creep, and shrinkage have been an important issue. But it has been neglected to predict the Inelastic behavior of RC structures even though those deformations make a serious problem on the partition wall, external cladding, duct, etc. In this paper, analysis system for prediction and compensation of the differential column shortenings considering time-dependent deformations and construction sequence is developed using the objected-oriented technique. Developed analysis system considers the construction sequence, especially time-dependent deformation in early days, and is composed of input module, database module, database store module, analysis module, and analysis result generation module. Graphic user interface(GUI) is supported for user's convenience. After performing the analysis, the output results like deflections and member forces according to the time can be observed in the generation module using the graphic diagram, table, and chart supported by the integrated environment.

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

We consider the heterogeneous fleet vehicle routing problem (HVRP), a variant of the classical vehicle routing problem (VRP). The HVRP differs from the classical VRP in that it deals with a heterogeneous fleet of vehicles having various capacities, fixed costs, and variables costs. Therefore the HVRP is to find the fleet composition and a set of routes with minimum total cost. We give an integer programming formulation of the problem and propose an algorithm to solve it. Although the formulation has exponentially many variables, we can efficiently solve the linear programming relaxation of it by using the column generation technique. To generate profitable columns we solve a shortest path problem with capacity constraints using dynamic programming. After solving the linear programming relaxation, we apply a branch-and-bound procedure. We test the proposed algorithm on a set of benchmark instances. Test results show that the algorithm gives best-known solutions to almost all instances.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.1
• /
• pp.98-106
• /
• 2009

This work proposes a 1280-RGB $\times$ 800-Dot 70.78mW 0.l3um CMOS LCD driver IC (LDI) for high-performance 16M-color low temperature poly silicon (LTPS) thin film transistor liquid crystal display (TFT-LCD) systems such as ultra mobile PC (UMPC) and mobile applications simultaneously requiring high resolution, low power, and small size at high speed. The proposed LDI optimizes power consumption and chip area at high resolution based on a resistor-string based architecture. The single column driver employing a 1:12 MUX architecture drives 12 channels simultaneously to minimize chip area. The implemented class-AB amplifier achieves a rail-to-rail operation with high gain and low power while minimizing the effect of offset and output deviations for high definition. The supply- and temperature-insensitive current reference is implemented on chip with a small number of MOS transistors. A slew enhancement technique applicable to next-generation source drivers, not implemented on this prototype chip, is proposed to reduce power consumption further. The prototype LDI implemented in a 0.13um CMOS technology demonstrates a measured settling time of source driver amplifiers within 1.016us and 1.072us during high-to-low and low-to-high transitions, respectively. The output voltage of source drivers shows a maximum deviation of 11mV. The LDI with an active die area of $12,203um{\times}1500um$ consumes 70.78mW at 1.5V/5.5V.