Date : 10 October 2024
snacks : 5:05 PM - 5:30 PM
stORIEs : 5:30 PM - 6:30 PM
Venue : LC - 301
Speaker : Arvind Kumar, Senior Advisor, Optym.
The Traveling Salesman, his crew and some last mile roadblocks.
The traveling salesman problem is one of the most celebrated OR problems specifically seeking an answer to the question, "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" Now how about doing the same if you had a crew? Divide and conquer? This specific story will take you through the journey of this problem along with its more contemporary generalisations in the form of the Vehicle Routing problem (VRP) and some new insights using neighbourhood search algorithms for optimizing last mile deliveries.
IEOR Talk Series : "stORIEs and snacks"
Date Posted