AlgoIL #4: Mathematical Applications in the New World of Transportation
Details
This is #4 MeetUp of AlgoIL community :)
And this time two stories from The New World of Transportation - what sort of new problems are we tackling these days? and how can we come up with new algorithms to solve them?
Agenda:
18:00 - Gathering and snacks
18:30 - Opening words
18:40 - Ishay Mor, Optibus - The multi depot vehicle scheduling problem in real life
19:20 - Dalya Gartzman, Via - Sequence Alignment for Ride Sharing
Both talks will be in Hebrew.
Thanks Optibus for sponsoring this event!
____________________________________________________________________________________
Ishay Mor, Optibus - The multi depot vehicle scheduling problem in real life.
Abstract:
Elegant algorithms tend to encounter difficulties when applied outside of Academia. Part of the fun of developing an algorithm rich product is figuring out which solutions to apply to your real life problems, and how.
I’ll demonstrate one such challenge we faced during the early days of Optibus, when the bus schedules we created became less than optimal due to the demand for a bus to return to its home depot.
I will give a quick overview of how we used graph algorithms to create efficient vehicle schedules. Then I’ll present the problem regarding depot circularity, and how we incorporated relaxation methods into our graphs, resulting in efficient schedules once more.
About Ishay:
A physicist turned algorithm developer, and a devout meetups attender. Once I finished my Thesis in the field of neural computation, I joined a young startup “Optibus” as one of the first 3 employees, so I had the pleasure to search, research and implement new ideas while building a new product.
____________________________________________________________________________________
Dalya Gartzman, Via - Sequence Alignment for Ride Sharing
Abstract:
As researchers and developers, we constantly face new problems, and challenge existing solutions to old problems.
On beautiful circumstances, solved problems from one domain shed light on new problems from totally different domains.
This happened to me while I was researching a Ride Sharing problem, and got inspiration from a DNA Sequence Alignment algorithm.
The Ride Sharing problem we will discuss is a constrained optimization problem of finding efficient ways of grouping multiple riders on a single taxi.
We will also overview the biological context that was the inspiration, and take a close look at the hybrid algorithm that provided a significantly more efficient solution.
I will give a light-weight-suitable-for-after-work-hours overview of the steps of the algorithm, and include a selection of non-mandatory mathematical formulas, for people like me who enjoy the extra spice of supporting equations.
About Dalya:
A mathematician at heart, an algorithmatician in practice. After receiving my MSc. in math from TAU I ventured into data science and algorithms domains, glad to discover that the real world is at least as exciting as the abstract. Currently algorithms researcher at Via - On Demand Transit, applying both my theoretical and practical passions.