.png){kind=icon}
.png){kind=icon}
Return
Solving a mixed integer linear program approximation of the toll design problem using constraint generation within a branch-and-cut algorithm
.png){kind=icon}
OA
AI
DOI：10.1080/23249935.2013.813988.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses the global optimality of the toll design problem (TDP) by formulating a mixed integer linear program (MILP) approximation. In the TDP, the objective is to maximise the social surplus by adjusting toll locations and levels in a road traffic network. The resulting optimisation problem can be formulated as a mathematical program with equilibrium constraints. An MILP is obtained by piecewise linear approximation of the nonlinear functions in the TDP, and we present a domain reduction scheme to reduce the error introduced by these approximations. Previous approaches for solving the MILP approximation have been relying on a large number of MILPs to be solved iteratively within a cutting constraint algorithm (CCA). This paper instead focuses on the development of a solution algorithm for solving the MILP approximation in which the CCA is integrated within a branch-and-cut algorithm, which only requires one MILP to be solved.
Keywords:
global optimisation
bilevel optimisation
toll design
road pricing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.1
Papers:
927
Citations:
2.2K