Bus scheduling with heterogeneous fleets: Formulation and hybrid metaheuristic algorithms

Mohammad Sadrani · Alejandro Tirachini · Constantinos Antoniou

13 citations0/0 files storedExpert Systems with Applications

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Vehicle Routing Optimization Methods Transportation and Mobility Innovations

Abstract

This paper focuses on optimizing mixed-fleet bus scheduling (MFBS) with vehicles of different sizes in public transport systems. We develop a novel mixed-integer nonlinear programming (MINLP) model to address the MFBS problem by optimizing vehicle assignment and dispatching programs. The model considers user costs, operator costs, and the crowding inconvenience of standing and sitting passengers. To tackle the complexity of the MFBS problem, we employ Genetic Algorithm (GA) and Grey Wolf Optimizer (GWO). Besides, we develop two hybrid metaheuristics, including GA-SA [a combination of GA and Simulated Annealing (SA)] and GWO-SA (a combination of GWO and SA), to improve optimization capabilities for the MFBS problem. We also employ a Taguchi approach to fine-tune the metaheuristics’ parameters. We widely examine and compare the metaheuristics’ performance across various-sized samples (small, medium, and large), considering solution quality, computational time, and the result stability of each algorithm. We also compare the metaheuristics’ solutions with the optimal solutions acquired by GAMS software in small and medium-scale samples. Our findings show that the GWO-SA outperforms the other metaheuristics. Applying our model to a real bus corridor in Santiago, Chile, we find that precise dispatching plans generated by more sophisticated/advanced algorithms (GA-SA and GWO-SA) lead to larger cost savings and improved performance compared to simpler algorithms (GA and GWO). Interestingly, utilizing more advanced algorithms makes a difference in terms of fleet planning in crowded scenarios, whereas for low and medium-demand cases, simpler dispatching algorithms could be used without a drop in accuracy.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 13 citations exist upstream.

References

2020A review on genetic algorithm: past, present, and future 1971OPTIMIZATION AND SCALE ECONOMIES IN URBAN BUS TRANSPORTATION 2006Urban Transit: Operations, Planning and Economics 2013Crowding in public transport systems: Effects on users, operation and implications for the estimation of demand 2010Twenty Years of Rail Crowding Valuation Studies: Evidence and Lessons from British Experience 2021Designing a sustainable closed-loop supply chain network of face masks during the COVID-19 pandemic: Pareto-based algorithms 2021An integrated sustainable medical supply chain network during COVID-19 2006Chapter 2 Public Transit

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.