• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.5D
• /
• pp.587-595
• /
• 2008

Many studies on bus scheduling optimization have been done from the 1960s to recent years for establishing rational bus schedule plan that can improve convenience of bus passengers and minimize unnecessary runs. After 2000, as part of the Intelligent Transport Systems (ITS), the importance of the schedule management and providing schedule information through bus schedule optimization has become a big issue, and much research is being done to develop optimization models that will increase bus passenger convenience and, on the side of bus management, minimize unnecessary bus operation. The purpose of this study is to calculate the optimal bus frequency and create a timetable for each bus stop by applying DTR or DTRC model that use data for each bus stop and route segment. Model verification process was implemented using data collected from bus management system (BMS) and integrated transit-fare card system for bus route of Seoul's No. 472 line. In order to evaluate the reliability and uncertainty of optimal solution, sensitivity analysis was implemented for the various parameters and assumptions used in the bus scheduling model.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.157.3-157
• /
• 2001

In this paper, the optimal maintenance scheduling for turbine with considering maintenance replacement rate was proposed in order to reduce the maintenance cost during the whole period of operation, meanwhile keeping current reliability of turbine. The proposed method is only based on a few limited available data with various factors relating to maintenance replacement and repair of turbine. The proposed method will be adopted by Kyushu Electric Power Co., Inc. from April in 2002 to determine the maintenance schedule of thermal power plants.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.4
• /
• pp.932-938
• /
• 2017

This paper presents the structure of an energy management system for distributed energy resources of a grid-connected microgrid. The energy management system of a grid-connected microgrid collects information of the microgrid such as the status of distributed energy resources and the time varying pricing plan through various protocols. The energy management system performs forecasting and optimization based on the collected information. It derives the operation schedule of distributed energy resources to reduce the microgrid electricity bill. In order to achieve optimal operation, the energy management system should include an optimal scheduling algorithm and a protocol that transfers the derived schedule to distributed energy resources. The energy management system operates as a rolling horizon controller in order to reduce the effect of a prediction error. Derived control schedules are transmitted to the distributed energy resources in real time through the international standard communication protocol.

• Journal of Korean Society of Transportation
• /
• v.25 no.5
• /
• pp.195-207
• /
• 2007

The urban railways connecting between the inner city and suburb of Seoul metropolitan area, has lost the competitiveness against cars because too many stops deteriorated operating speed and passenger's level of service. This paper suggests that an express train should be introduced into the urban railway system in order to sort out such a complication. There are two considerations in the present study. Firstly, train schedule problem should be taken into account. In this regard, a new model for urban railway system was developed by revising the existing models dealing with single line freight railway. Approximate branch and bound algorithm based on conflict group rather than a single conflict was adopted. Consequently, it was found that the time saving in calculating the optimal schedule is the most meaningful contribution of the algorithm. The second consideration is associated with the application of the model. A case study was carried out using the actual operation data from Ansan line. In conclusion, the operation speed of the line can increase considerably with minimal number of new sidings.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.1
• /
• pp.33-40
• /
• 2019

This study focuses on a job-shop scheduling problem with the objective of minimizing total tardiness for the job orders that have different due dates and different process flows. We suggest the dispatching rule based scheduling algorithm to generate fast and efficient schedule. First, we show the delay schedule can be optimal for total tardiness measure in some cases. Based on this observation, we expand search space for selecting the job operation to explore the delay schedules. That means, not only all job operations waiting for process but also job operations not arrived at the machine yet are considered to be scheduled when a machine is available and it is need decision for the next operation to be processed. Assuming each job operation is assigned to the available machine, the expected total tardiness is estimated, and the job operation with the minimum expected total tardiness is selected to be processed in the machine. If this job is being processed in the other machine, then machine should wait until the job arrives at the machine. Simulation experiments are carried out to test the suggested algorithm and compare with the results of other well-known dispatching rules such as EDD, ATC and COVERT, etc. Results show that the proposed algorithm, MET, works better in terms of total tardiness of orders than existing rules without increasing the number of tardy jobs.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.28 no.7
• /
• pp.299-304
• /
• 2016

In recent years, heat source systems which have a principal effect on the performance of buildings are difficult to design optimally as a great number of design factors and constraints in large and complicated buildings need to be considered. On the other hand, it is necessary to design an optimum system combination and operation planning for energy efficiency considering Life Cycle Cost (LCC). This study suggests a multi-level and multi-objective optimization method to minimize both LCC and investment cost using a genetic algorithm targeting an office building which requires a large cooling load. The optimum method uses a two stage process to derive the system combination and the operation schedule by utilizing the input data of cooling and heating load profile and system performance characteristics calculated by dynamic energy simulation. The results were assessed by Pareto analysis and a number of Pareto optimal solutions were determined. Moreover, it was confirmed that the derived operation schedule was useful for operating the heat source systems efficiently against the building energy requirements. Consequently, the proposed optimization method is determined by a valid way if the design process is difficult to optimize.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.34 no.5
• /
• pp.193-200
• /
• 1985

Increased attention has been given in recent years to the use of pumped hydrostorage plant to meet the requirements for peak generation and bottom pumping. Once a pumped hydrostorage plant is installed, its economic operation as an integral component of a steam generating system requires the selection of a pumping and generating schedule which will result in the most effective use of the hydro generating capacity. The general object of coordination of pumped hydrostorage plants with electric power system is the minimization of the overall procduction cost and the maximization of generation reserves. This paper presents a method for the optimal scheduling of pumped hydrostorage plant and a computer program which determines weekly operating schedules for a pumped hydrostorage plant by dynamic programming method.

• Proceedings of the KIEE Conference
• /
• 1998.07c
• /
• pp.1059-1062
• /
• 1998

This paper which can simulate FRIENDS(Flexible Reliable Intelligent Electrical eNergy Delivery System) model of distribution electrical system presents a new algorithm. In the operation of FRIENDS model, dispersed energy storage(DES) systems have an important role. We can use the active and reactive power of DES to control customer's voltage. In this, the former means load levelling operation and the later means voltage control operation of DES. We focus our research on load levelling operation of DES. We develope an algorithm to get an optimal capacity and operation schedule of DES and then apply it to the FRIENDS model. The results show the effectiveness of the proposed method.

• Korean Management Science Review
• /
• v.29 no.2
• /
• pp.143-155
• /
• 2012

The purpose of this study is to formulate and solve the scheduling problem to heat-treatment process in forging process and apply it to industries. Heat-treatment is a common process in manufacturing heavy forged products in ship engines and wind power generators. Total complete time of the schedule depends on how to group parts and assign them into heat furnace. Efficient operation of heat-treatment process increases the productivity of whole production system while scheduling the parts into heat-treatment furnace is a combinatorial problem which is known as an NP-hard problem. So the scheduling, on manufacturing site, relies on engineers' experience. To improve heat-treatment process schedule, this study formulated it into an MIP mathematical model which minimizes total complete time. Three methods were applied to example problems and the results were compared to each other. In case of small problems, optimal solutions were easily found. In case of big problems, feasible solutions were found and that feasible solutions were very close to lower bound of the solutions. ILOG OPL Studio 5.5 was used in this study.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.609-612
• /
• 2000

Job-shop scheduling problem(JSSP) is one of the best-known machine scheduling problems and essentially an ordering problem. A new encoding scheme which always give a feasible schedule is presented, by which a schedule directly corresponds to an assigned-operation ordering string. It is initialized with G&T algorithm and improved using the developed genetic operator; APMX or BPMX crossover operator and mutation operator. and the problem of infeasibility in genetic generation is naturally overcome. Within the framework of the newly designed genetic algorithm, the NP-hard classical job-shop scheduling problem can be efficiently solved with high quality. Moreover the optimal solutions of the famous benchmarks, the Fisher and Thompson's 10${\times}$10 and 20${\times}$5 problems, are found.