Algorithms And Models For Schedule Design And Bus/Car Fleet Assignment To Build Large-Scale Continuous Freight Routes

Abstract

This research presents the results of our research project on optimizing the utilization of intercity bus trips by combining them into a single transportation route. The project focuses on efficiently utilizing available bus vehicles to create cost-effective and efficient routes. Instead of operating individual bus trips, we investigate the consolidation of intercity bus trips into a single route to enhance transportation efficiency and reduce unnecessary vehicle usage. Our research methodology is based on optimization models and algorithms to determine optimal routes and schedules for intercity bus trips. We utilize information such as distances, travel times, and passenger capacities of the bus vehicles to identify the optimal combinations and allocations of trips. This paper provides a detailed description of our approach, including the mathematical models and algorithms used to optimize the consolidation of intercity bus trips and construct efficient transportation routes. We applied our method to real-world data to validate the effectiveness and practicality of our research. Our research project has achieved positive results, and the optimized trip consolidation method has been implemented in practice to improve efficiency and cost savings in intercity bus transportation. The main scope of the project was to solve fleet-assignment, bus-routing, crew-pairing, and crew-rostering problems on real-world data. The special characteristics of the bus carrier, operating between specific time windows every day, have motivated us to design models and algorithms that are tailored to the unique requirements of the bus industry rather than relying on approaches typically developed for large bus companies.