What is it about?

In this paper, we dive into the challenges of planning transportation routes, from picking up passengers to hospital transfers. It's like solving a puzzle with time limits and lots of pieces. We'll show you how we've found faster ways to crack this puzzle, introducing an exciting new algorithm called Linearly Decreasing - Deterministic Annealing (LD-DA). With this algorithm, we're making transportation smoother and faster, ensuring everyone gets where they need to go with ease.

Featured Image

Why is it important?

This topic is crucial because it directly impacts the efficiency and accessibility of transportation services for various groups, including the elderly, disabled individuals, patients needing medical transport, and even everyday commuters. By optimizing routes and schedules, we can reduce waiting times, minimize travel distances, and improve overall service quality. This not only enhances the experience for passengers but also helps transportation providers operate more effectively and sustainably. Additionally, as urban populations grow and transportation networks become more complex, finding efficient solutions to these challenges becomes increasingly vital for ensuring smooth and reliable transportation for everyone.


I am deeply passionate about improving transportation systems to enhance the quality of life for individuals in our communities. Through my work on this project, I've seen firsthand the impact that optimized transportation routes can have on the daily lives of people, whether it's ensuring timely medical care for patients or providing convenient transit options for the elderly and disabled. This paper is important because it offers practical solutions to real-world challenges faced by transportation providers and users alike. By introducing innovative algorithms like LD-DA, we're not just addressing theoretical problems; we're making tangible improvements that can make a difference in people's lives. As someone committed to creating positive change through research and innovation, I believe that our findings have the potential to drive significant improvements in transportation efficiency and accessibility, ultimately benefiting society as a whole.

Amir Mortazavi
University of New South Wales

Read the Original

This page is a summary of: A linearly decreasing deterministic annealing algorithm for the multi-vehicle dial-a-ride problem, PLoS ONE, February 2024, PLOS,
DOI: 10.1371/journal.pone.0292683.
You can read the full text:

Open access logo


The following have contributed to this page