• Title/Summary/Keyword: Optimal Solution algorithm

Search Result 1,318, Processing Time 0.031 seconds

A Design and Control of Bi-directional Non-isolated DC-DC Converter with Coupled Inductors for Rapid Electric Vehicle Charging System

  • Kang, Taewon;Kim, Changwoo;Suh, Yongsug;Park, Hyeoncheol;Kang, Byungil;Kim, Daegyun
    • Proceedings of the KIPE Conference
    • /
    • 2011.07a
    • /
    • pp.429-430
    • /
    • 2011
  • This paper presents a simple and cost-effective stand-alone rapid battery charging system of 30kW for electric vehicles. The proposed system mainly consists of active front-end rectifier of neutral point clamped 3-level type and non-isolated bi-directional dc-dc converter of multi-phase interleaved half-bridge topology with coupled inductors. The charging system is designed to operate for both lithium-polymer and lithium-ion batteries. The complete charging sequence is made up of three sub-interval operating modes; pre-charging mode, constant-current mode, and constant-voltage mode. The pre-charging mode employs the staircase shaped current profile to accomplish shorter charging time while maintaining the reliable operation of the battery. The proposed system is able to reach the full-charge state within less than 16min for the battery capacity of 8kWh by supplying the charging current of 67A. The optimal discharging algorithm for Vehicle to the Grid (V2G) operation has been adopted to maintain the discharging current of 1C. Owing to the simple and compact power conversion scheme, the proposed solution has superior module-friendly mechanical structure which is absolutely required to realize flexible power expansion capability in a very high-current rapid charging system.

  • PDF

Optimal Electricity and Heat Production Strategies of Fuel Cell Device in a Micro-grid Energy System (마이크로 전력계통에서 연료전지 발전시스템의 전기/열의 최적운영 기법 연구)

  • Lee, Joo-Won;Park, Jong-Bae;Kim, Su-Duk;Kim, Chang-Seop
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.6
    • /
    • pp.1093-1099
    • /
    • 2009
  • Alternative energy sources such as renewable energy like solar power systems, wind power systems, or fuel cell power systems has been the rising issue in the electrical power system. This paper discusses an economic study analysis of fuel cells in the korean electricity market. It includes the basic concept of a fuel cell and the korean electricity market. It also describes the need of renewable energy and how the fuel cell is connected with the local grid. This paper shows the impact of production and recovering thermal energy of a grid-connected fuel cell power system. The profit maximization approach has been structured including electrical power trade with the local grid and heat trade within the micro-grid. The strategies are evaluated using a local load that uses electric and thermal power which has different patterns between summer and winter periods. The solution algorithm is not newly developed one, but is solved by an application called GAMS. Results indicate the need and usefulness of a fuel cell power system.

A Method of Eliminating Exceptional Elements Attaining Minimum Machine Duplications and Intercell Moves In Cellular Manufacturing Systems (기계중복과 셀간 이동수의 최소화가 가능한 예외적 요소의 제거 방법 : 비용 및 설치대수 제약 고려)

  • Jang, Ik;Yun, Chang-Won;Chung, Byung-Hee
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.23 no.4
    • /
    • pp.87-96
    • /
    • 1998
  • Using the concept of cellular manufacturing systems(CMS) in job shop manufacturing system is one of the most innovative approaches to improving plant productivity. However. several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of maintaining an ideal CMS environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem because it is a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine ceil. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and ceil space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine Incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

  • PDF

A Method of Eliminating Exceptional Elements Attainting Minimum Machine Duplications and Intercell Moves In Cell Manufacturing Systems (기계중복과 셀간 이동수의 최소화가 가능한 예외적 요소의 제거 방법 : 비용 및 설치대수 제약 고려)

  • Chang, Ik;Yoon, Chang-Won;Chung, Byeong-Hui
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.263-266
    • /
    • 1998
  • Several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of ideal Cellular Manufacturin System (CMS) environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem as it's a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine cells. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and cell space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

  • PDF

Hardware and Software Implementation of a GPS Receiver Test Bed Running from PC (PC 기반 GPS 수신기 하드웨어 모듈 및 펌웨어 개발)

  • Long, Nguyen Phi;Hieu, Nguyen Hoang;Lee, Sang-Hoon;Park, Ok-Deuk;Kim, Hyun-Su;Kim, Han-Sil
    • Proceedings of the KIEE Conference
    • /
    • 2006.10c
    • /
    • pp.394-396
    • /
    • 2006
  • When developing a new GPS receiver module, the essential problems are evaluation of reliable algorithms, software debugging, and performance comparison between algorithms to find optimal solution. Most GPS receiver modules nowadays use a correlator to track signals from satellites and an MCU (Micro Controller Unit) to control operations of the entire module. The problem of software evaluation from MCU is very difficult, due to limitation of MCU resources and low ability of interfacing with user. Normally, user has to expense special tool kit for a limiting access to MCU but it is also hard to use. This article introduces an implementation of a GPS receiver test bed using correlator GP2021 interfacing with ISA (Industry Standard Architecture) PC bus. This way can give user complete control and visibility into the operation of the receiver, then user can easily debug program and test algorithms. For this article, the least square method is implemented to test the hardware and software performance.

  • PDF

A Model and Approaches for Smoothing Peaks of Traction Energy in Timetabling (동력운전 분산 시각표 작성을 위한 수리모형 및 해법)

  • Kim, Kyung-Min;Oh, Seog-Moon
    • Journal of the Korean Society for Railway
    • /
    • v.12 no.6
    • /
    • pp.1018-1023
    • /
    • 2009
  • This paper describes a reduction in the peaks of traction energy for metro railways in timetabling. We develope a mixed integer programming (MIP) model, which minimizes the number of trains running simultaneously. We suggest two approaches. In the first approach, we use the commercial MIP solver, CPLEX. In the second approach, we propose a heuristic algorithm. We apply both methods to the current daily timetable of the Korea Metropolitan Subway. We determine an optimal solution, which results in an improvement of approximately 25% over the current timetable.

Optimization of 3G Mobile Network Design Using a Hybrid Search Strategy

  • Wu Yufei;Pierre Samuel
    • Journal of Communications and Networks
    • /
    • v.7 no.4
    • /
    • pp.471-477
    • /
    • 2005
  • This paper proposes an efficient constraint-based optimization model for the design of 3G mobile networks, such as universal mobile telecommunications system (UMTS). The model concerns about finding a set of sites for locating radio network controllers (RNCs) from a set of pre-defined candidate sites, and at the same time optimally assigning node Bs to the selected RNCs. All these choices must satisfy a set of constraints and optimize an objective function. This problem is NP-hard and consequently cannot be practically solved by exact methods for real size networks. Thus, this paper proposes a hybrid search strategy for tackling this complex and combinatorial optimization problem. The proposed hybrid search strategy is composed of three phases: A constraint satisfaction method with an embedded problem-specific goal which guides the search for a good initial solution, an optimization phase using local search algorithms, such as tabu algorithm, and a post­optimization phase to improve solutions from the second phase by using a constraint optimization procedure. Computational results show that the proposed search strategy and the model are highly efficient. Optimal solutions are always obtained for small or medium sized problems. For large sized problems, the final results are on average within $5.77\%$ to $7.48\%$ of the lower bounds.

Multilevel Multiobjective Optimization for Structures (다단계 다목적함수 최적화를 이용한 구조물의 최적설계)

  • 한상훈;최홍식
    • Computational Structural Engineering
    • /
    • v.7 no.1
    • /
    • pp.117-124
    • /
    • 1994
  • Multi-level Multi-objective optimization(MLMO) for reinforced concrete framed structure is performed, and compared with the results of single-level single-objective optimization. MLMO method allows flexibility to meet the design needs such as deflection and cost of structures using weighting factors. Using Multi-level formulation, the numbers of constraints and variables are reduced at each levels, and the optimization formulation becomes simplified. The force approximation method is used to reflect the variation in design variables between the substructures, and thus coupling is maintained. And the linear approximated constraints and objective function are used to reduce the number of structural analysis in optimization process. It is shown that the developed algorithm with move limit can converge effectively to optimal solution.

  • PDF

Decomposition of Interference Hyperspectral Images Based on Split Bregman Iteration

  • Wen, Jia;Geng, Lei;Wang, Cailing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.7
    • /
    • pp.3338-3355
    • /
    • 2018
  • Images acquired by Large Aperture Static Imaging Spectrometer (LASIS) exhibit obvious interference stripes, which are vertical and stationary due to the special imaging principle of interference hyperspectral image (IHI) data. As the special characteristics above will seriously affect the intrinsic structure and sparsity of IHI, decomposition of IHI has drawn considerable attentions of many scientists and lots of efforts have been made. Although some decomposition methods for interference hyperspectral data have been proposed to solve the above problem of interference stripes, too many times of iteration are necessary to get an optimal solution, which will severely affect the efficiency of application. A novel algorithm for decomposition of interference hyperspectral images based on split Bregman iteration is proposed in this paper, compared with other decomposition methods, numerical experiments have proved that the proposed method will be much more efficient and can reduce the times of iteration significantly.

Production Scheduling for a Two-machine Flow Shop with a Batch Processing Machine (배치처리기계를 포함하는 두 단계 흐름생산라인의 일정계획)

  • Koh, Shie-Gheun;Koo, Pyung-Hoi;Kim, Byung-Nam
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.34 no.4
    • /
    • pp.481-488
    • /
    • 2008
  • This paper deals with a scheduling problem for two-machine flow shop, in which the preceding machine is a batch processing machine that can process a number of jobs simultaneously. To minimize makespan of the system, we present a mixed integer linear programming formulation for the problem, and using this formulation, it is shown that an optimal solution for small problem can be obtained by a commercial optimization software. However, since the problem is NP-hard and the size of a real problem is very large, we propose a number of heuristic algorithms including genetic algorithm to solve practical big-sized problems in a reasonable computational time. To verify performances of the algorithms, we compare them with lower bound for the problem. From the results of these computational experiments, some of the heuristic algorithms show very good performances for the problem.