Logit network pricing
Event details
| Date | 19.11.2014 |
| Hour | 11:00 › 12:00 |
| Speaker | Prof. Patrice Marcotte, Department of computer science and operations research of the University of Montreal |
| Location | |
| Category | Conferences - Seminars |
We consider the problem of setting profit-maximizing tolls on a subset of arcs of a multicommodity transportation network. The case where users are assigned to cheapest paths, which is naturally formulated as an NP-hard bilevel program, has been extensively studied and will serve as the background for an extension where user assignment is performed according to a discrete choice model of the logit family. Following a description of the model and its theoretical properties, we develop an algorithmic framework for determining a near-optimal solution of this nonconvex problem, based on a variety of approximations involving mixed integer programs, either linear or quadratic. Through a battery of tests performed on a variety of network topologies, we reach the conclusion that very crude approximations (that scale well) perform surprisingly well.
Practical information
- General public
- Free
- This event is internal
Organizer
- Prof. M. Bierlaire
Contact
- Marianne Ruegg