• Title/Summary/Keyword: nonlinear programming

Search Result 516, Processing Time 0.029 seconds

OD trip matrix estimation from urban link traffic counts (comparison with GA and SAB algorithm) (링크관측교통량을 이용한 도시부 OD 통행행렬 추정 (GA와 SAB 알고리즘의 비교를 중심으로))

  • 백승걸;김현명;임용택;임강원
    • Journal of Korean Society of Transportation
    • /
    • v.18 no.6
    • /
    • pp.89-99
    • /
    • 2000
  • To cope with the limits of conventional O-D trip matrix collecting methods, several approaches have been developed. One of them is bilevel Programming method Proposed by Yang(1995), which uses Sensitivity Analysis Based(SAB) algorithm to solve Generalized Least Square(GLS) problem. However, the SAB a1gorithm has revealed two critical short-comings. The first is that when there exists a significant difference between target O-D matrix and true O-D matrix, SAB algorithm may not produce correct solution. This stems from the heavy dependance on the historical O-D information, in special when gravel Patterns are dramatically changed. The second is the assumption of iterative linear approximation to original Problem. Because of the approximation, SAB algorithm has difficulty in converging to Perfect Stackelberg game condition. So as to avoid the Problems. we need a more robust and stable solution method. The main purpose of this Paper is to show the problem of the dependency of Previous models and to Propose an alternative solution method to handle it. The Problem of O-D matrix estimation is intrinsically nonlinear and nonconvex. thus it has multiple solutions. Therefore it is necessary to require a method for searching globa1 solution. In this paper, we develop a solution algorithm combined with genetic algorithm(GA) , which is widely used as probabilistic global searching method To compare the efficiency of the algorithm, SAB algorithm suggested by Yang et al. (1992,1995) is used. From the results of numerical example, the Proposed algorithm is superior to SAB algorithm irrespective of travel patterns.

  • PDF

A Single Allocation Hub Network Design Model for Intermodal Freight Transportation (단일할당 복합운송 허브 네트워크 설계 모형 개발)

  • Kim, Dong-Gyu;Gang, Seong-Cheol;Park, Chang-Ho;Go, Seung-Yeong
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.1
    • /
    • pp.129-141
    • /
    • 2009
  • Intermodal freight transportation is defined as the movement of freight from origins to destinations by two or more transportation modes. When implemented in hub networks, it could enhance the efficiency of the networks because consolidated flows are transported by more suitable modes and technologies. In spite of this advantage, the intermodal hub network design problem has received limited attention in the literature partly because of the complex nature of the problem. This paper aims to develop an optimization model for designing intermodal hub networks with sin91e allocation strategy. The model takes into account various cost components of intermodal hub networks including transportation, stationary inventory, and service delay costs. Moreover, using transport frequency variables, it is capable of endogenously determining the transportation economies of scale achieved by consolidation of flows. As such, the model is able to realistically represent the characteristics of intermodal hub networks in practice. Since the model Is a complicated nonlinear integer programming problem, we perform model simplification based on the analytical study of the model, which could facilitate the development of solution algorithms in the future. We expect that this study contributes to the design of intermodal hub networks as well as to the assessment of existing logistics systems.

CAPACITY EXPANSION MODELING OF WATER SUPPLY IN A PLANNING SUPPORT SYSTEM FOR URBAN GROWTH MANAGEMENT (도시성장관리를 위한 계획지원체계에서 상수도의 시설확장 모델링)

  • Hyong-Bok, Kim
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 1995.12a
    • /
    • pp.9-21
    • /
    • 1995
  • A planning support system enhances our ability to use water capacity expansion as an urban growth management strategy. This paper reports the development of capacity expansion modeling of water supply as part of the continuing development of such a planning support system (PEGASUS: Planning Environment for Generation and Analysis of Spatial Urban Systems) to incorporate water supply, This system is designed from the understanding that land use and development drive the demand for infrastructure and infrastructure can have a significant influence on the ways in which land is developed and used. Capacity expansion Problems of water supply can be solved in two ways: 1) optimal control theory, and 2) mixed integer nonlinear programming (MINLP). Each method has its strengths and weaknesses. In this study the MINLP approach is used because of its strength of determining expansion sizing and timing simultaneously. A dynamic network optimization model and a water-distribution network analysis model can address the dynamic interdependence between water planning and land use planning. While the water-distribution network analysis model evaluates the performance of generated networks over time, the dynamic optimization model chooses alternatives to meet expanding water needs. In addition, the user and capacity expansion modeling-to-generate-alternatives (MGA) can generate alternatives. A cost benefit analysis module using a normalization technique helps in choosing the most economical among those alternatives. GIS provide a tool for estimating the volume of demanded water and showing results of the capacity expansion model.

  • PDF

unifying solution method for logical topology design on wavelength routed optical networks (WDM의 논리망 구성과 파장할당 그리고 트래픽 라우팅을 위한 개선된 통합 해법)

  • 홍성필
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.9A
    • /
    • pp.1452-1460
    • /
    • 2000
  • A series of papers in recent literature on logical topology design for wavelength routed optical networks have proposed mathematical models and solution methods unifying logical topology design wavelength assignment and traffic routing. The most recent one is by Krishnaswamy and Sivarajan which is more unifying and complete than the previous models. Especially the mathematical formulation is an integer linear program and hence regarded in readiness for an efficient solution method compared to the previous nonlinear programming models. The solution method in [7] is however elementary one relying on the rounding of linear program relaxation. When the rounding happens to be successful it tends to produce near-optimal solutions. In general there is no such guarantee so that the obtained solution may not satisfy the essential constraints such as logical -path hop-count and even wavelength number constraints. Also the computational efforts for linear program relaxation seems to be too excessive. In this paper we propose an improved and unifying solution method based on the same to be too excessive. In this paper we propose an improved and unifying solution method based on the same model. First its computation is considerably smaller. Second it guarantees the solution satisfies all the constraints. Finally applied the same instances the quality of solution is fairly competitive to the previous near optimal solution.

  • PDF

Breakage and Liberation Characteristics of Iron Ore from Shinyemi Mine by Ball Mill (신예미 광산 철광석의 볼밀 분쇄 및 단체분리 특성 연구)

  • Lee, Donwoo;Kwon, Jihoe;Kim, Kwanho;Cho, Heechan
    • Resources Recycling
    • /
    • v.29 no.3
    • /
    • pp.11-23
    • /
    • 2020
  • This study aims to investigate breakage and liberation characteristics of iron ore from Shinyemi mine, Jeongseon by ball mill. Parameters of breakage functions for three grade samples of iron ore were obtained using single-sized-feed breakage test and back-calculation based on nonlinear programming. The results showed that with the increase in the grade of iron ore, the breakage rate factor decrease whereas the particle size sensitivity decreases. This results from retardation of microcrack-propagation by magnetite grain in the ore. Breakage distribution analysis showed that the breakage mechanism appear to be impact fracture dominant with the increase of grade owing to the stress distribution effect by magnetite grain. Degree of liberation (DOL) increased with the increase in grade and decrease in particle size, respectively. Using the breakage function and size-DOL relationship, a model that can predict time-dependent-DOL is established. When scale-up factors from operating condition are available, the model is expected to be capable of predicting size and DOL with time in actual mining process.

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.