StoreNet is a program that addresses two key challenges in retail logistics: the Generalized Assignment Problem (GAP), which determines optimal store locations to minimize building costs, and the Vehicle Routing Problem (VRP), which optimizes truck routes for store restocking to minimize driving costs.
Find the full problem description here.
Explore the solution explanation here. In solving the GAP, linear programming techniques using AMPL were employed. For the VRP, a heuristic method was utilized to achieve polynomial execution time.
An interactive Python notebook is available here, offering detailed insights into the solution process.
