clarke-wright

Repository for the implementation of a solution to the Network Design Problem for a modified Two Echelon Vehicle Routing Problem

Code implementations based on the book "Inteligencia Artificial. Fundamentos, práctica y aplicaciones", 2nd. Edition, by Alberto García Serrano.

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.

R package implementing the Clarke-Wright algorithm to find a quasi-optimal solution to the Capacitated Vehicle Routing Problem.

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

Optimizing Capacitated Vehicle Routing Problem through Modified Discrete Tree-Seed Algorithm with Parallel Paessens' Clarke-Wright Heuristic

Project for the "Advanced Data Structures and Algorithms" Curricular Unit (FEUP) - VRP Solver

Vehicle Routing Problem (VRP)

Assignments of Artificial Intelligence Sessional Course CSE 318 in Level-3, Term-2 of CSE, BUET

The repository uses the the Clarke-Wright Heurisitic to solve a combinatorial vehicle routing problem with time windows and other constraints.

Algorithms for solving large instances of the Capacitated Vehicle Routing Problem (CVRP). Project for the Advanced Data Structures and Algorithms curricular unit.

School bus route planner and optimizer: assigns students to buses (capacitated vehicle routing / Clarke-Wright), balances travel time, enforces catchment radius, and draws road-accurate routes with OSRM. Built with Next.js, TypeScript, Leaflet & OpenStreetMap. Keyless, no API keys.

Aplicação que resolve um problema de roteamento de ônibus escolares em uma cidade, usando a heurística Clarke-Wright.

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.

Free-tier delivery route planner. Plan up to 20 stops per run with a local VRP solver. Upgrade to mml-route-planner for unlimited stops + Google Directions refinement + EV charging.