Tagged in Travelling Salesman
Tech and Product
Solving Permanent Journey Planning at Locus
Author: Abhishek Goyal; Edited by: Kewal Krishna PJP aka Permanent Journey Planning – What is it? PJP refers to the day-level route planning mechanism for a fixed duration that a company or a distributor creates to visit several outlets in a specified region via several delivery partners for different products. Outlets can range from 500 […]
Route Optimization
Explained: Vehicle Routing Problem (VRP) and the most effective solution to address it
Vehicle Routing Problem is a constant in the last-mile delivery business. It happens due to the delivery and resource constraints planners face while coming up with minimum-cost vehicle routes. Solving it helps them reduce operational costs and enhance the quality of delivery services. With the massive spread of COVID-19, delivery businesses are handling larger delivery […]
Route Optimization
Traveling Salesman Problem (TSP) and How Tech Can Solve It
Updated: Mar 9, 2023 Salespersons are required to travel frequently as a part of their job, with the aim of maximizing their business opportunities. However, their daily schedules are often subject to sudden changes due to scheduled and last-minute customer appointments, making it difficult for them to plan optimal travel routes. As a result, salespersons […]
Route Optimization
Route Constraints: Locus Going the Extra Mile for Customers with Autoscaling
Graceful Scaling of Queue Workers: Locus uses Amazon Autoscaling to build a route optimization platform that can scale on-demand and helps in adapting to new last-mile challenges. Locus Route Planner Behind Scenes: One of the most utilized products of Locus’ best route planning software (Dispatcher), is used to solve the constrained vehicle routing problem. The constrained […]
Route Optimization
Travelling Salesman Problem Is Not A Problem, It’s A Herculean Task.
There is one problem that never goes out of fashion even though people in mathematics have tried to optimize solutions for it over decades. Yes, decades! To nobody’s surprise, the Travelling Salesman Problem (read: TSP) remains to be one of the most fascinating and complicated algorithms to innovate upon. The solutions to this problem only have a […]
MOST POPULAR
EDITOR’S PICKS