Travel Demand and Traffic Prediction with Cell Phone Data: Calibration by Mathematical Program with Equilibrium Constraints

Author(s):  
Ronan Doorley ◽  
Luis Alonso ◽  
Atnaud Grignard ◽  
Nuria Macia ◽  
Kent Larson
2021 ◽  
Author(s):  
Mihály Dolányi ◽  
Kenneth Bruninx ◽  
Jean-François Toubeau ◽  
Erik Delarue

In competitive electricity markets the optimal trading problem of an electricity market agent is commonly formulated as a bi-level program, and solved as mathematical program with equilibrium constraints (MPEC). In this paper, an alternative paradigm, labeled as mathematical program with neural network constraint (MPNNC), is developed to incorporate complex market dynamics in the optimal bidding strategy. This method uses input-convex neural networks (ICNNs) to represent the mapping between the upper-level (agent) decisions and the lower-level (market) outcomes, i.e., to replace the lower-level problem by a neural network. In a comparative analysis, the optimal bidding problem of a load agent is formulated via the proposed MPNNC and via the classical bi-level programming method, and compared against each other.


2020 ◽  
Vol 12 (4) ◽  
pp. 704 ◽  
Author(s):  
Xiangyang Kong ◽  
Yongqiang Zhao ◽  
Jize Xue ◽  
Jonathan Cheung-Wai Chan ◽  
Seong G. Kong

This paper presents a global and local tensor sparse approximation (GLTSA) model for removing the stripes in hyperspectral images (HSIs). HSIs can easily be degraded by unwanted stripes. Two intrinsic characteristics of the stripes are (1) global sparse distribution and (2) local smoothness along the stripe direction. Stripe-free hyperspectral images are smooth in spatial domain, with strong spectral correlation. Existing destriping approaches often do not fully investigate such intrinsic characteristics of the stripes in spatial and spectral domains simultaneously. Those methods may generate new artifacts in extreme areas, causing spectral distortion. The proposed GLTSA model applies two ℓ 0 -norm regularizers to the stripe components and along-stripe gradient to improve the destriping performance. Two ℓ 1 -norm regularizers are applied to the gradients of clean image in spatial and spectral domains. The double non-convex functions in GLTSA are converted to single non-convex function by mathematical program with equilibrium constraints (MPEC). Experiment results demonstrate that GLTSA is effective and outperforms existing competitive matrix-based and tensor-based destriping methods in visual, as well as quantitative, evaluation measures.


2016 ◽  
Vol 17 (9) ◽  
pp. 2466-2478 ◽  
Author(s):  
Merkebe Getachew Demissie ◽  
Santi Phithakkitnukoon ◽  
Titipat Sukhvibul ◽  
Francisco Antunes ◽  
Rui Gomes ◽  
...  

Author(s):  
Ming-Heng Wang ◽  
Steven D. Schrock ◽  
Nate Vander Broek ◽  
Thomas Mulinazzi

Sign in / Sign up

Export Citation Format

Share Document