الفهرس 
INTRODUCTIONOnly 14 pages are availabe for public view
 |  | from | 119 |  |  |
| | | from | 119 | | |
Abstract
This research discusses planning a flexible scheduling approach that aims to strike a delicate balance between cost efficiency and providing a personalized service experience. By optimizing the departure schedules of fixed-route vehicles, this approach considers crucial factors such as timing and capacity constraints. It departs from the rigid schedules of traditional fixed-route transportation systems, allowing for real-time adjustments that cater to passenger needs. A mixed-integer program is employed to achieve this, providing an exact solution. Additionally, the Adaptive Large Neighbourhood Search (ALNS) algorithm proves its efficiency for handling more complex scenarios involving larger instances. This study’s contribution extends beyond scheduling. It seamlessly integrates adaptable services with established fixed routes, reducing costs and improving overall system utilization. Flexibly adapting to changing demand patterns minimizes inefficiencies and operational costs, thereby revolutionizing urban mobility. However, this approach recognizes the need to address contingencies such as cancellations and unexpected events, ensuring a robust and reliable transportation system.