The Rental Substitution Effect and Welfare Comparisons in Urban Housing Security System

2012 ◽  
Vol 174-177 ◽  
pp. 3513-3518
Author(s):  
Zhi Qing Li ◽  
Jin Xin Tian ◽  
Yu Ying Cui
Keyword(s):  
Bilevel Programming ◽  
Programming Model ◽  
Substitution Effect ◽  
Consumer Welfare ◽  
Urban Housing ◽  
Security System ◽  
Optimal Decision ◽  
Housing Security ◽  
The Government ◽  
Bilevel Programming Model

A bilevel programming model, in which the government could maximize its efficiency and the vulnerable housing group could maximize its utility, was constructed under the market-cleaning assumption in urban housing security, and then the optimal decision by vulnerable housing groups is discussed in government’s price for affordable housing with property right, and the existence of the optimal decision by consumers and government is proved, respectively. And at the same time, the constructed bilevel model is solved through the use of the smoothing method. Finally, the bilevel programming model is constructed under the uncertainty and the non-market-cleaning accordingly. The conclusion shows that it is reasonable to maximize consumer welfare and the efficiency of government in urban housing security system, and it makes recommendations for government decision-making accordingly.

scholarly journals A Simultaneous Solution for Reserve Capacity Maximization and Delay Minimization Problems in Signalized Road Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-18 ◽  
Author(s):  
Ozgur Baskan ◽  
Huseyin Ceylan ◽  
Cenk Ozan
Keyword(s):  
Bilevel Programming ◽  
Road Network ◽  
Programming Model ◽  
Numerical Test ◽  
User Equilibrium ◽  
Reserve Capacity ◽  
Delay Minimization ◽  
Weighted Sum Method ◽  
Capacity Maximization ◽  
Bilevel Programming Model

In this study, we present a bilevel programming model in which upper level is defined as a biobjective problem and the lower level is considered as a stochastic user equilibrium assignment problem. It is clear that the biobjective problem has two objectives: the first maximizes the reserve capacity whereas the second minimizes performance index of a road network. We use a weighted-sum method to determine the Pareto optimal solutions of the biobjective problem by applying normalization approach for making the objective functions dimensionless. Following, a differential evolution based heuristic solution algorithm is introduced to overcome the problem presented by use of biobjective bilevel programming model. The first numerical test is conducted on two-junction network in order to represent the effect of the weighting on the solution of combined reserve capacity maximization and delay minimization problem. Allsop & Charlesworth’s network, which is a widely preferred road network in the literature, is selected for the second numerical application in order to present the applicability of the proposed model on a medium-sized signalized road network. Results support authorities who should usually make a choice between two conflicting issues, namely, reserve capacity maximization and delay minimization.

scholarly journals Emergency Vehicle Dispatching and Redistribution in Highway Network Based on Bilevel Programming

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Xiaohong Duan ◽  
Shouxin Song ◽  
Jiandong Zhao
Keyword(s):  
Bilevel Programming ◽  
Programming Model ◽  
Time Windows ◽  
Emergency Vehicle ◽  
Shuffled Frog Leaping Algorithm ◽  
Coverage Area ◽  
Vehicle Dispatching ◽  
Emergency Vehicles ◽  
Shuffled Frog Leaping ◽  
Bilevel Programming Model

Response time is a key factor in the emergency vehicle dispatching problem. Because regional emergency vehicles are limited, vehicle gaps will be created in the rescue station after vehicles are dispatched to several accidents, which affects quick response to the subsequent incidents. To solve this problem, a bilevel programming model for emergency vehicle dispatching and redistribution is established, of which the optimal objectives are the shortest rescue time for current accidents and the shortest time for vehicle redistribution, and the key constraints are emergency vehicle requirements and accident time windows. In the precondition of effective rescue of current accidents, emergency vehicles are redistributed according to the potential risks in the rescue station coverage area. A bilevel shuffled frog leaping algorithm is proposed to solve the bilevel programming model. The dispatching results of examples show that the model conforms to dispatching decision rule and the bilevel shuffled frog leaping algorithm can resolve the bilevel programming model fast and efficiently.

Sign in / Sign up

Export Citation Format

Share Document