6 research outputs found

    Two ways of estimating a transport model

    Get PDF
    In this article, it is shown how the parameters of a transport model can be estimated in a way that, in contrast to previously used methods, utilizes regional prices as well as of trade costs. The proposed method uses bi-level programming to minimize a weighted least squares' criterion under the restriction that the estimated parameters satisfy the Kuhn-Tucker conditions for an optimal solution of the transport model. We use Monte-Carlo simulations to trace out some properties of the estimator and compare it with a traditional calibration method. The analysis shows that the proposed technique estimates prices as well as trade costs more efficiently.Public Economics,

    Two Ways of Estimating a Transport Model

    Get PDF
    In this article, it is shown how the parameters of a transport model can be estimated in a way that, in contrast to previously used methods, utilizes observations of regional prices as well as of trade costs. The proposed method uses bi-level programming to minimize a weighted least squares criterion under the restriction that the estimated parameters satisfy the Kuhn-Tucker conditions for an optimal solution of the transport model. We use Monte-Carlo simulations to trace out some properties of the estimator and compare it with a traditional calibration method. The analysis shows that the proposed technique estimates prices as well as trade costs more efficiently.spatial equilibrium, transport model, bi-level programming, Research Methods/ Statistical Methods, C15, F11,

    Two- stage stochastic operation framework for optimal management of the water- energy- hub

    Full text link
    Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/166193/1/gtd2bf02716.pd

    Time-dependent discrete road network design with both tactical and strategic decisions

    Get PDF
    This paper aims to model and investigate the discrete urban road network design problem, using a multi-objective time-dependent decision-making approach. Given a base network made up with two-way links, candidate link expansion projects, and candidate link construction projects, the problem determines the optimal combination of one-way and two-way links, the optimal selection of capacity expansion projects, and the optimal lane allocations on two-way links over a dual time scale. The problem considers both the total travel time and the total CO emissions as the two objective function measures. The problem is modelled using a time-dependent approach that considers a planning horizon of multiple years and both morning and evening peaks. Under this approach, the model allows determining the sequence of link construction, the expansion projects over a predetermined planning horizon, the configuration of street orientations, and the lane allocations for morning and evening peaks in each year of the planning horizon. This model is formulated as a mixed-integer programming problem with mathematical equilibrium constraints. In this regard, two multi-objective metaheuristics, including a modified non-dominated sorting genetic algorithm (NSGA-II) and a multi-objective B-cell algorithm, are proposed to solve the above-mentioned problem. Computational results for various test networks are also presented in this paper.postprin
    corecore