Welfare Measurement with Expenditure-Constrained Demand Models

1989 ◽  
Vol 71 (1) ◽  
pp. 164 ◽  
Author(s):  
Robert Mendelsohn ◽  
George Peterson
Keyword(s):  
Demand Models ◽  
Welfare Measurement

PENGEMBANGAN ”REAL TIME TRAFFIC INFORMATION SYSTEM” BAGI PENGGUNA JALAN

2013 ◽  
Vol 12 (3) ◽  
Author(s):  
Rusmadi Suyuti
Keyword(s):  
Information System ◽  
Real Time ◽  
Travel Demand ◽  
Urban Traffic ◽  
Road User ◽  
Traffic Information ◽  
Estimation Methods ◽  
Traffic Counts ◽  
Real Time Traffic ◽  
Demand Models

Traffic information condition is a very useful  information for road user because road user can choose his best route for each trip from his origin to his destination. The final goal for this research is to develop real time traffic information system for road user using real time traffic volume. Main input for developing real time traffic information system is an origin-destination (O-D) matrix to represent the travel pattern. However, O-D matrices obtained through a large scale survey such as home or road side interviews, tend to be costly, labour intensive and time disruptive to trip makers. Therefore, the alternative of using traffic counts to estimate O-D matrices is particularly attractive. Models of transport demand have been used for many years to synthesize O-D matrices in study areas. A typical example of the approach is the gravity model; its functional form, plus the appropriate values for the parameters involved, is employed to produce acceptable matrices representing trip making behaviour for many trip purposes and time periods. The work reported in this paper has combined the advantages of acceptable travel demand models with the low cost and availability of traffic counts. Two types of demand models have been used: gravity (GR) and gravity-opportunity (GO) models. Four estimation methods have been analysed and tested to calibrate the transport demand models from traffic counts, namely: Non-Linear-Least-Squares (NLLS), Maximum-Likelihood (ML), Maximum-Entropy (ME) and Bayes-Inference (BI). The Bandung’s Urban Traffic Movement survey has been used to test the developed method. Based on several statistical tests, the estimation methods are found to perform satisfactorily since each calibrated model reproduced the observed matrix fairly closely. The tests were carried out using two assignment techniques, all-or-nothing and equilibrium assignment.  

scholarly journals Address-based computation of intra-cell distances for travel demand models

2021 ◽  
Vol 184 ◽  
pp. 123-130
Author(s):  
Matthias Heinrichs ◽  
Rita Cyganski ◽  
Daniel Krajzewicz
Keyword(s):  
Travel Demand ◽  
Demand Models

scholarly journals Single-Manufacturer Multi-Retailer Supply Chain Models with Discrete Stochastic Demand

2021 ◽  
Vol 13 (15) ◽  
pp. 8271
Author(s):  
Yaqing Xu ◽  
Jiang Zhang ◽  
Zihao Chen ◽  
Yihua Wei
Keyword(s):  
Dynamic Programming ◽  
Supply Chain ◽  
Computational Complexity ◽  
Stackelberg Game ◽  
Programming Model ◽  
Dynamic Programming Method ◽  
Game Model ◽  
Chain Model ◽  
Stochastic Demands ◽  
Demand Models

Although there are highly discrete stochastic demands in practical supply chain problems, they are seldom considered in the research on supply chain systems, especially the single-manufacturer multi-retailer supply chain systems. There are no significant differences between continuous and discrete demand supply chain models, but the solutions for discrete random demand models are more challenging and difficult. This paper studies a supply chain system of a single manufacturer and multiple retailers with discrete stochastic demands. Each retailer faces a random discrete demand, and the manufacturer utilizes different wholesale prices to influence each retailer’s ordering decision. Both Make-To-Order and Make-To-Stock scenarios are considered. For each scenario, the corresponding Stackelberg game model is constructed respectively. By proving a series of theorems, we transfer the solution of the game model into non-linear integer programming model, which can be easily solved by a dynamic programming method. However, with the increase in the number of retailers and the production capacity of manufacturers, the computational complexity of dynamic programming drastically increases due to the Dimension Barrier. Therefore, the Fast Fourier Transform (FFT) approach is introduced, which significantly reduces the computational complexity of solving the supply chain model.

A copula-based continuous cross-nested logit model for tour scheduling in activity-based travel demand models

2021 ◽  
Vol 145 ◽  
pp. 324-341
Author(s):  
Sepehr Ghader ◽  
Carlos Carrion ◽  
Liang Tang ◽  
Arash Asadabadi ◽  
Lei Zhang
Keyword(s):  
Logit Model ◽  
Travel Demand ◽  
Nested Logit ◽  
Nested Logit Model ◽  
Demand Models ◽  
Tour Scheduling

Ensemble learning activity scheduler for activity based travel demand models

2021 ◽  
Vol 123 ◽  
pp. 102972
Author(s):  
Mohammad Hesam Hafezi ◽  
Naznin Sultana Daisy ◽  
Hugh Millward ◽  
Lei Liu
Keyword(s):  
Ensemble Learning ◽  
Travel Demand ◽  
Learning Activity ◽  
Demand Models

scholarly journals Optimal Pricing of Vehicle-to-Grid Services Using Disaggregate Demand Models

Energies ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 1090
Author(s):  
Charilaos Latinopoulos ◽  
Aruna Sivakumar ◽  
John W. Polak
Keyword(s):  
Power Systems ◽  
Electric Vehicles ◽  
Power Grids ◽  
Local Distribution ◽  
Technical Problems ◽  
Vehicle To Grid ◽  
Distribution Transformers ◽  
Demand Models ◽  
Multiple Vehicles ◽  
Infrastructure Investments

The recent revolution in electric mobility is both crucial and promising in the coordinated effort to reduce global emissions and tackle climate change. However, mass electrification brings up new technical problems that need to be solved. The increasing penetration rates of electric vehicles will add an unprecedented energy load to existing power grids. The stability and the quality of power systems, especially on a local distribution level, will be compromised by multiple vehicles that are simultaneously connected to the grid. In this paper, the authors propose a choice-based pricing algorithm to indirectly control the charging and V2G activities of electric vehicles in non-residential facilities. Two metaheuristic approaches were applied to solve the optimization problem, and a comparative analysis was performed to evaluate their performance. The proposed algorithm would result in a significant revenue increase for the parking operator, and at the same time, it could alleviate the overloading of local distribution transformers and postpone heavy infrastructure investments.

Sign in / Sign up

Export Citation Format

Share Document