Authors: Abdelhakim Abdellaoui, Loubna Benabbou, Issmail El Hallaoui

Published on: March 20, 2024

Impact Score: 7.6

Arxiv code: Arxiv:2403.14013

Summary

• What is new: A novel approach that combines Constrained Centroid-Based Clustering (CCBC) with the Capacitated Vehicle Routing Problem (CVRP) to achieve polynomial complexity, incorporating enhancements for near-optimal solutions.
• Why this is important: Solving the CVRP efficiently within a practical runtime to improve delivery management.
• What the research proposes: A three-stage framework using CCBC for clustering, a Traveling Salesman Problem solver for ordering, and a cutting and relinking process for optimization.
• Results: Achieved near-optimal solutions on benchmark instances with improved solution quality and computational runtime.

Technical Details

Technological frameworks used: Cluster-first, route-second method extended with CCBC approach

Models used: Linear and integer programming models, TSP solver

Data used: Well-known benchmark instances for VRP

Potential Impact

Transportation and delivery management companies, logistics optimization software developers

Want to implement this idea in a business?

We have generated a startup concept here: OptiRoute.