• Title/Summary/Keyword: binary linear programming

Search Result 19, Processing Time 0.023 seconds

Efficient Ρ-median approach to GT cell formation (GT 셀 형성을 위한 효율적 Ρ-median 접근법)

  • Won, Youkyung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.40-43
    • /
    • 2000
  • This paper is concerned with development of an efficient Ρ-median approach applicable to large cell formation(CF) problems. A two-phase methodology that seeks to minimize the number of exceptional elements is proposed. In phase I, two efficient Ρ-median formulations which contain fewer binary variables than existing Ρ-median formulations are constructed. These make it possible to implement large CF problem within reasonable computer runtime with commercially available linear integer programming codes. Given the initial cell configuration found with the new p-median formulations, in phase II bottleneck machines and parts are reassigned to reduce the number of exceptional elements. This procedure has the flexibility to provide the cell designer with alternative solutions. Test results on large CF problems show a substantial efficiency of the new Ρ-median formulations.

  • PDF

Optimized Structures with Hop Constraints for Web Information Retrieval (Hop 제약조건이 고려된 최적화 웹정보검색)

  • Lee, Woo-Key;Kim, Ki-Baek;Lee, Hwa-Ki
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.4
    • /
    • pp.63-82
    • /
    • 2008
  • The explosively growing attractiveness of the Web is commencing significant demands for a structuring analysis on various web objects. The larger the substantial number of web objects are available, the more difficult for the clients(i.e. common web users and web robots) and the servers(i.e. Web search engine) to retrieve what they really want. We have in mind focusing on the structure of web objects by introducing optimization models for more convenient and effective information retrieval. For this purpose, we represent web objects and hyperlinks as a directed graph from which the optimal structures are derived in terms of rooted directed spanning trees and Top-k trees. Computational experiments are executed for synthetic data as well as for real web sites' domains so that the Lagrangian Relaxation approaches have exploited the Top-k trees and Hop constraint resolutions. In the experiments, our methods outperformed the conventional approaches so that the complex web graph can successfully be converted into optimal-structured ones within a reasonable amount of computation time.

A Study on the Design of Optimum Sidelobe Suppression Filter for Barker Codes (바커 코드에 대한 최적 부엽 억제 필터의 설계에 관한 연구)

  • 정경태
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1991.06a
    • /
    • pp.151-156
    • /
    • 1991
  • In this paper, we propose a new algorithm for designing the R-G filter that has optimum performance in terms of mean square sidelobe level(MSSL) for the Barker code. The advantage of the conventional R-G filter lies in its simple structure so that it can be easily implemented. However, the conventional R-G filter dose not have optimum performances in terms of peak sidelobe level(PSL), mean sidelobe level(MSL), and MSSL. Recently, a(R-G)LP filter of which filter coefficients are obtained by the linear programming algorithm was proposed and known to have optimum performance in PSL. The proposed (R-G)LS filter keeps the simple structure of the conventional R-G filter and has the filter coefficients that minimizes the sidelobe in the least square sense. The analytic results show that the proposed (R-G)LS filter has better performances than the conventional R-G filter in terms of PSL, MSL, and MSSL. Compared with (R-G)LP filter, the proposed (R-G)LS filter has better performances in terms of MSL and MSSL. The proposed filter design algorithm can be applied to the other binary codes such as truncated pseudonoise(PN) codes and concatenated codes.

  • PDF

A Cloud-Edge Collaborative Computing Task Scheduling and Resource Allocation Algorithm for Energy Internet Environment

  • Song, Xin;Wang, Yue;Xie, Zhigang;Xia, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2282-2303
    • /
    • 2021
  • To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

Optimization of Water Reuse System under Uncertainty (불확실성을 고려한 하수처리수 재이용 관로의 최적화)

  • Chung, Gun-Hui;Kim, Tae-Woong;Lee, Jeong-Ho;Kim, Joong-Hoon
    • Journal of Korea Water Resources Association
    • /
    • v.43 no.2
    • /
    • pp.131-138
    • /
    • 2010
  • Due to the increased water demand and severe drought as an effect of the global warming, the effluent from wastewater treatment plants becomes considered as an alternative water source to supply agricultural, industrial, and public (gardening) water demand. The effluent from the wastewater treatment plant is a sustainable water source because of its good quality and stable amount of water discharge. In this study, the water reuse system was developed to minimize total construction cost to cope with the uncertain water demand in future using two-stage stochastic linear programming with binary variables. The pipes in the water reuse network were constructed in two stages of which in the first stage, the water demands of users are assumed to be known, while the water demands in the second stage have uncertainty in the predicted value. However, the water reuse system has to be designed now when the future water demands are not known precisely. Therefore, the construction of a pipe parallel with the existing one was allowed to meet the increased water demands in the second stage. As a result, the trade-off of construction costs between a pipe with large diameter and two pipes having small diameters was evaluated and the optimal solution was found. Three scenarios for the future water demand were selected and a hypothetical water reuse network considering the uncertainties was optimized. The results provide the information about the economies of scale in the water reuse network and the long range water supply plan.

A Model and Algorithm for Optimizing the Location of Transit Transfer Centers (대중교통 환승센터 입지선정 모형 연구)

  • Yoo, Gyeong-Sang
    • Journal of Korean Society of Transportation
    • /
    • v.30 no.1
    • /
    • pp.125-133
    • /
    • 2012
  • This paper deals with the passenger transfer trips counted from smart bus-card data from Seoul transit network to understand the current operational condition of the system. Objective of this study is to relocate the location of the transit transfer centers. It delivers a bi-level programing model. The upper model is a linear 0-1 binary integer program having the objective of total travel cost minimization constrained by the number of transfer centers and the total construction budget. The lower model is an user equilibrium assignment model determining the passengers' route choice according to the transfer center locations. The proposed bi-level programming model was tested in an example network. The result showed that the proposed was able to find the optimal solution.

A Study on Balanced Team Formation Method Reflecting Characteristics of Students (학생들의 특성을 반영한 균형적인 팀 편성 방법에 관한 연구)

  • Kim, Jong-hwan
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.24 no.6
    • /
    • pp.55-65
    • /
    • 2019
  • With the advent of the Fourth Industrial Revolution and changes in the educational environment, team-based assignments are increasing in university classes. Effective team formation in team-based class is an important issue that affects students' satisfaction and the effectiveness of education. However, previous studies mostly focused on post analysis on the results of team formation, which makes it difficult to use them in actual classes. In this paper, we present a mathematical model of how to create a balanced team that reflects students' abilities and other characteristics. Characteristic values for assignment may be scores, such as students' proficiency, binary values such as gender, and multi-values, such as grade or department. This problem is a type of equitable partitioning problem, which takes the form of 0-1 integer programming, and the objective function is linear or nonlinear, depending on how balance is achieved. The basic model or the extended model presented can be applied to the situation where teams are balanced in consideration of various factors in actual class.

A-team Based Approach for Reactive Power/Voltage Control Considering Steady State Security Assessment (정태 안전성 평가를 고려한 무효전력 전압제어를 위한 A-team기반 접근법)

  • Kim, Doo-Hyun
    • Journal of the Korean Society of Safety
    • /
    • v.11 no.2
    • /
    • pp.150-159
    • /
    • 1996
  • In this paper, an A-team(Asynchronous Team ) based approach for Reactive power and volage control considering static security assessment in a power system with infrastructural deficiencies is proposed. Reactive power and voltage control problem is the one of optimally establishing voltage level given several constraints such as reactive generation, voltage magnitude, line flow, and other switchable reactive power sources. It can be formulated as a mixed-integer linear programming(MILP) problem without deteriorating of solution accuracy to a certain extent. The security assessment is to estimate the relative robustness of the system in Its present state through the evaluation of data provided by security monitoring. Deterministic approach based on AC load flow calculations is adopted to assess the system security, especially voltage security. A security metric, as a standard of measurement for power system security, producting a set of discrete values rather than binary values, is employed. In order to analyze the above two problems, reactive power/voltage control problem and static security assessment problem, in an integrated fashion for real-time operations, a new organizational structure, called an A-team, is adopted. An A-team is an organization for agents which ale all autonomeus, work in parallel and communicate asynchronously, which is well-suited to the development of computer-based, multi-agent systems for operations. This A-team based approach, although it is still in the beginning stage, also has potential for handling other difficult power system problems.

  • PDF

The Prediction of DEA based Efficiency Rating for Venture Business Using Multi-class SVM (다분류 SVM을 이용한 DEA기반 벤처기업 효율성등급 예측모형)

  • Park, Ji-Young;Hong, Tae-Ho
    • Asia pacific journal of information systems
    • /
    • v.19 no.2
    • /
    • pp.139-155
    • /
    • 2009
  • For the last few decades, many studies have tried to explore and unveil venture companies' success factors and unique features in order to identify the sources of such companies' competitive advantages over their rivals. Such venture companies have shown tendency to give high returns for investors generally making the best use of information technology. For this reason, many venture companies are keen on attracting avid investors' attention. Investors generally make their investment decisions by carefully examining the evaluation criteria of the alternatives. To them, credit rating information provided by international rating agencies, such as Standard and Poor's, Moody's and Fitch is crucial source as to such pivotal concerns as companies stability, growth, and risk status. But these types of information are generated only for the companies issuing corporate bonds, not venture companies. Therefore, this study proposes a method for evaluating venture businesses by presenting our recent empirical results using financial data of Korean venture companies listed on KOSDAQ in Korea exchange. In addition, this paper used multi-class SVM for the prediction of DEA-based efficiency rating for venture businesses, which was derived from our proposed method. Our approach sheds light on ways to locate efficient companies generating high level of profits. Above all, in determining effective ways to evaluate a venture firm's efficiency, it is important to understand the major contributing factors of such efficiency. Therefore, this paper is constructed on the basis of following two ideas to classify which companies are more efficient venture companies: i) making DEA based multi-class rating for sample companies and ii) developing multi-class SVM-based efficiency prediction model for classifying all companies. First, the Data Envelopment Analysis(DEA) is a non-parametric multiple input-output efficiency technique that measures the relative efficiency of decision making units(DMUs) using a linear programming based model. It is non-parametric because it requires no assumption on the shape or parameters of the underlying production function. DEA has been already widely applied for evaluating the relative efficiency of DMUs. Recently, a number of DEA based studies have evaluated the efficiency of various types of companies, such as internet companies and venture companies. It has been also applied to corporate credit ratings. In this study we utilized DEA for sorting venture companies by efficiency based ratings. The Support Vector Machine(SVM), on the other hand, is a popular technique for solving data classification problems. In this paper, we employed SVM to classify the efficiency ratings in IT venture companies according to the results of DEA. The SVM method was first developed by Vapnik (1995). As one of many machine learning techniques, SVM is based on a statistical theory. Thus far, the method has shown good performances especially in generalizing capacity in classification tasks, resulting in numerous applications in many areas of business, SVM is basically the algorithm that finds the maximum margin hyperplane, which is the maximum separation between classes. According to this method, support vectors are the closest to the maximum margin hyperplane. If it is impossible to classify, we can use the kernel function. In the case of nonlinear class boundaries, we can transform the inputs into a high-dimensional feature space, This is the original input space and is mapped into a high-dimensional dot-product space. Many studies applied SVM to the prediction of bankruptcy, the forecast a financial time series, and the problem of estimating credit rating, In this study we employed SVM for developing data mining-based efficiency prediction model. We used the Gaussian radial function as a kernel function of SVM. In multi-class SVM, we adopted one-against-one approach between binary classification method and two all-together methods, proposed by Weston and Watkins(1999) and Crammer and Singer(2000), respectively. In this research, we used corporate information of 154 companies listed on KOSDAQ market in Korea exchange. We obtained companies' financial information of 2005 from the KIS(Korea Information Service, Inc.). Using this data, we made multi-class rating with DEA efficiency and built multi-class prediction model based data mining. Among three manners of multi-classification, the hit ratio of the Weston and Watkins method is the best in the test data set. In multi classification problems as efficiency ratings of venture business, it is very useful for investors to know the class with errors, one class difference, when it is difficult to find out the accurate class in the actual market. So we presented accuracy results within 1-class errors, and the Weston and Watkins method showed 85.7% accuracy in our test samples. We conclude that the DEA based multi-class approach in venture business generates more information than the binary classification problem, notwithstanding its efficiency level. We believe this model can help investors in decision making as it provides a reliably tool to evaluate venture companies in the financial domain. For the future research, we perceive the need to enhance such areas as the variable selection process, the parameter selection of kernel function, the generalization, and the sample size of multi-class.