• Title, Summary, Keyword: Bi-level Programming

Search Result 11, Processing Time 0.036 seconds

Optimization of Train Working Plan based on Multiobjective Bi-level Programming Model

  • Hai, Xiaowei;Zhao, Chanchan
    • Journal of Information Processing Systems
    • /
    • v.14 no.2
    • /
    • pp.487-498
    • /
    • 2018
  • The purpose of the high-speed railway construction is to better satisfy passenger travel demands. Accordingly, the design of the train working plan must also take a full account of the interests of passengers. Aiming at problems, such as the complex transport organization and different speed trains coexisting, combined with the existing research on the train working plan optimization model, the multiobjective bi-level programming model of the high-speed railway passenger train working plan was established. This model considers the interests of passengers as the center and also takes into account the interests of railway transport enterprises. Specifically, passenger travel cost and travel time minimizations are both considered as the objectives of upper-level programming, whereas railway enterprise profit maximization is regarded as the objective of the lower-level programming. The model solution algorithm based on genetic algorithm was proposed. Through an example analysis, the feasibility and rationality of the model and algorithm were proved.

A BI-Level Programming Model for Transportation Network Design (BI-Level Programming 기법을 이용한 교통 네트워크 평가방법 연구)

  • Kim, Byung-Jong;Kim, Won-Kyu
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.7
    • /
    • pp.111-123
    • /
    • 2005
  • A network design model has been proposed. which represents a transportation facility investment decision problem. The model takes the discrete hi-level programming form in which two types of decision makers, government and travelers, are involved. The model is characterized by its ability to address the total social costs occurring in transportation networks and to estimate the equilibrium link volumes in multi-modal networks. Travel time and volume for each link in the multi-modal network are predicted by a joint modal split/traffic assignment model. An efficient solution algorithm has been developed and an illustrative example has been presented.

A study on fuzzy goals of system with hierarchical structure (계층적구조를 갖는 시스템의 FUZZY GOALS에 관한 연구)

  • 박주녕;송서일
    • Journal of the Society of Korea Industrial and Systems Engineering
    • /
    • v.12 no.20
    • /
    • pp.97-104
    • /
    • 1989
  • In this thesis, each objective functions with hierarchical system Bi-level linear programming (BLPP) Problem applications to fuzzy set theory conducted multiple objective programming problem. Using linear fuzzy membership functions make a change typical BLPP and presents modified method turn to account established BLPP method, presents operation results lead to example. Fuzzy Bi-level linear programming problem (FBLPP) can be natural describe realities of life then BLPP.

  • PDF

A Fuzzy-Goal Programming Approach For Bilevel Linear Multiple Objective Decision Making Problem

  • Arora, S.R.;Gupta, Ritu
    • Management Science and Financial Engineering
    • /
    • v.13 no.2
    • /
    • pp.1-27
    • /
    • 2007
  • This paper presents a fuzzy-goal programming(FGP) approach for Bi-Level Linear Multiple Objective Decision Making(BLL-MODM) problem in a large hierarchical decision making and planning organization. The proposed approach combines the attractive features of both fuzzy set theory and goal programming(GP) for MODM problem. The GP problem has been developed by fixing the weights and aspiration levels for generating pareto-optimal(satisfactory) solution at each level for BLL-MODM problem. The higher level decision maker(HLDM) provides the preferred values of decision vector under his control and bounds of his objective function to direct the lower level decision maker(LLDM) to search for his solution in the right direction. Illustrative numerical example is provided to demonstrate the proposed approach.

Application of Adaptive Particle Swarm Optimization to Bi-level Job-Shop Scheduling Problem

  • Kasemset, Chompoonoot
    • Industrial Engineering and Management Systems
    • /
    • v.13 no.1
    • /
    • pp.43-51
    • /
    • 2014
  • This study presents an application of adaptive particle swarm optimization (APSO) to solving the bi-level job-shop scheduling problem (JSP). The test problem presented here is $10{\times}10$ JSP (ten jobs and ten machines) with tribottleneck machines formulated as a bi-level formulation. APSO is used to solve the test problem and the result is compared with the result solved by basic PSO. The results of the test problem show that the results from APSO are significantly different when compared with the result from basic PSO in terms of the upper level objective value and the iteration number in which the best solution is first identified, but there is no significant difference in the lower objective value. These results confirmed that the quality of solutions from APSO is better than the basic PSO. Moreover, APSO can be used directly on a new problem instance without the exercise to select parameters.

A Methodology of Path based User Equilibrium Assignment in the Signalized Urban Road Networks (도시부 도로 네트워크에서 교통신호제어와 결합된 경로기반 통행배정 모형 연구)

  • Han, Dong-Hee;Park, Jun-Hwan;Lee, Young-Ihn;Lim, Kang-Won
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.2
    • /
    • pp.89-100
    • /
    • 2008
  • In an urban network controlled by traffic signals, there is an interaction between the signal timing and the routes chosen by individual road users. This study develops a bi level programming model for traffic signal optimization in networks with path based traffic assignment. In the bi level programming model, genetic algorithm approach has been proposed to solve upper level problem for a signalized road network. Path based traffic assignment using column generation technique which is proposed by M.H. Xu, is applied at the lower-level. Genetic Algorithm provieds a feasible set of signal timings within specified lower and upper bounds signal timing variables and feeds into lower level problem. The performance of this model is investigated in numerical experiment in a sample network. In result, optimal signal settings and user equilibrium flows are made.

Optimal Placement of CRNs in Manned/Unmanned Aerial Vehicle Cooperative Engagement System

  • Zhong, Yun;Yao, Peiyang;Wan, Lujun;Xiong, Yeming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.52-68
    • /
    • 2019
  • Aiming at the optimal placement of communication relay nodes (OPCRN) problem in manned/unmanned aerial vehicle cooperative engagement system, this paper designed a kind of fully connected broadband backbone communication topology. Firstly, problem description of OPCRN was given. Secondly, based on problem analysis, the element attributes and decision variables were defined, and a bi-level programming model including physical layer and logical layer was established. Thirdly, a hierarchical artificial bee colony (HABC) algorithm was adopted to solve the model. Finally, multiple sets of simulation experiments were carried out to prove the effectiveness and superiority of the algorithm.

A Design Problem of a Service System with Bi-functional Servers (이중작업능력의 서버로 구성된 서비스시스템 설계)

  • Kim, Sung-Chul
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.32 no.3
    • /
    • pp.17-31
    • /
    • 2007
  • In this paper, we consider a service system with bi-functional servers, which can switch between the primary service room and the secondary room. A service policy is characterized by the switching paints which depend on the queue length in the primary service room and the service level requirement constraint of the secondary room. The primary service room is modeled as a Markovian queueing system and the throughput of the primary service room is function of the total number of bi-functional servers. the buffer capacity of the primary service room, and the service policy. There is a revenue obtained from throughput and costs due to servers and buffers. We study the problem of simuitaneously determining the optimal number of servers, buffer capacity, and service policy to maximize profit of the service system, and develop an algorithm which can be successfully applied with the small number of computations.

Strategy for Providing Optimal VMS Travel Time Information Using Bi-Level Programming (Bi-Level 프로그래밍 기법을 이용한 최적의 VMS 통행시간 정보제공 전략)

  • Baik, Nam Cheol;Kim, Byung Kwan;Lee, Sang Hyup
    • Journal of The Korean Society of Civil Engineers
    • /
    • v.26 no.4D
    • /
    • pp.559-564
    • /
    • 2006
  • The purpose of this study is to minimize negative effect of VMS travel time information service by sensitivity analysis, which forecasts the change in link traffic volume. As a result, strategies for providing travel information that can change driving patterns for minimizing travel time were found. The framework for analysis is recently expanded with the application of game theory. According to the experiment, the algorithm generated for travel time information service reduces total travel time and yields travel patterns that is very close to the system optimization. Also, this study found that the route the travel time service information is provided about could play the important role.

  • PDF

Solving Mixed Strategy Equilibria of Multi-Player Games with a Transmission Congestion (다자게임 전력시장에서 송전선 혼잡시의 복합전략 내쉬균형 계산)

  • Lee, Kwang-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.55 no.11
    • /
    • pp.492-497
    • /
    • 2006
  • Nash Equilibrium (NE) is essential to investigate a participant's bidding strategy in a competitive electricity market. The transmission line constraints make it difficult to compute the NE due to causing a mixed strategy NE instead of a pure strategy NE. Computing a mixed strategy is more complicated in a multi-player game. The competition among multi-participants is modeled by a two-level hierarchical optimization problem. A mathematical programming approach is widely used in finding this equilibrium. However, there are difficulties to solving a mixed strategy NE. This paper presents two propositions to add heuristics to the mathematical programming method. The propositions are based on empirical studies on mixed strategies in numerous sample systems. Based on the propositions a new formulation is provided with a set of linear and nonlinear equations, and an algorithm is suggested for using the prepositions and the newly-formulated equations.