| | | In this project, you will tackle an optimization problem for bus line planning. The goal is to decide which lines to open and with what capacity to maximize the satisfaction of the users.
For each fixed plan, you will solve an assignment problem, equivalent to a shortest-path problem for passengers. To handle vehicle capacities, passengers are processed in a random priority order, and their utility is sampled, creating multiple scenarios.
Your tasks will be to solve the assignment problem, then optimize the line plan for one scenario. You will then extend the resolution to multiple scenarios. The focus is on designing and implementing tailored algorithms using either Python, C++ or Julia.
|