You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Competitive C++ solution to the Travelling Salesperson 2D problem, that includes the implementation of 6 algorithms: greedy, Clarke-Wright, Christofides, 2-opt, 3-opt, and Lin-Kernighan (k-opt). Done as part of the project assignment in the *DD22440 Advanced Algorithms* course at KTH, by Prof. Danupon Nanongkai.
This project aims to optimize the routing of electric vehicles for deliveries in urban areas. The objective is to minimize the total distance traveled and the overall cost, considering the limitations of vehicle capacity and battery autonomy.
This program is a solution to the Vehicle Routing Problem for Pickup and Delivery (VRPPD) with constraint on distance travelled by each driver. It efficiently assigns loads to drivers while minimizing total distance travelled using Clark-Wright Savings algorithm
Résolution à l'aide du problème de tournée des véhicules (VRP) à l'aide d'algorithmes heuristiques. Utilisation de l'algorithme Clarke and Wright doublé d'un algorithme de recherche local (2opt) et d'une heuristique faite main, plus globale. Travail effectué dans le cadre des TIPE en classes préparatoires.
Algorithms for solving large instances of the Capacitated Vehicle Routing Problem (CVRP). Project for the Advanced Data Structures and Algorithms curricular unit.