https://github.com/thuynguyentud/solving-vrp-with-metaheuristics-algorithm
Solving sustainable Capacitated Vehicle Routing Problem (CVRP) Optimization problem using C++ and local search metaheuristics algorithm
https://github.com/thuynguyentud/solving-vrp-with-metaheuristics-algorithm
cplusplus cvrp heuristic-algorithm
Last synced: 3 months ago
JSON representation
Solving sustainable Capacitated Vehicle Routing Problem (CVRP) Optimization problem using C++ and local search metaheuristics algorithm
- Host: GitHub
- URL: https://github.com/thuynguyentud/solving-vrp-with-metaheuristics-algorithm
- Owner: thuynguyentud
- License: mit
- Created: 2025-05-11T13:42:26.000Z (5 months ago)
- Default Branch: main
- Last Pushed: 2025-05-12T06:51:52.000Z (5 months ago)
- Last Synced: 2025-06-01T05:59:05.914Z (4 months ago)
- Topics: cplusplus, cvrp, heuristic-algorithm
- Language: C++
- Homepage:
- Size: 1.37 MB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Sustainable CVRP Optimization with Large-Scale Road Network Data in C++
I conducted this project during my master's degree, under the supervision of Prof. Dr. Jörn Schönberger, Chair of Transport Services and Logistics at TU Dresden, Germany.
This project tackles the **Capacitated Vehicle Routing Problem (CVRP)** with a focus on **minimizing fuel emissions** using **meta-heuristic algorithms in C++**. It handles real-world large-scale road networks (~2.5GB). Solving CVRP with large real-world data is computationally intensive. Exact methods are infeasible due to the **combinatorial search space**. Therefore, the **local search metaheuristics approach** was used in this case.
## 🏙️ Project Context
The project works on solving the problem: a **logistics provider** must deliver goods to **~100 supermarket locations** (hereafter will be called "delivery request") within the **urban area of Stuttgart, Germany**. The fleet consists of **different vehicle types** (e.g., small, medium, large trucks), each with **distinct fuel consumption characteristics**.
The optimization objective is to:
- **Minimize total fuel consumption**
- **Avoid overloading vehicles** (penalties applied when overloaded)
- The outcomes include the list of delivery requests **assigned** to different trucks, and the **sequences** of those requests.
---
# 🧱 Project Components
The project is structured in **four parts**:
### 1. 📦 Scenario Development
- I used **XML-based scenario files**, which describe the input data including delivery network (nodes, arcs, depot, fleet types, delivery request (quantities,...)). This constructed a basic component of the problem. In this project, I tried the same delivery network with 5 different fleets (each different fleet has different types of trucks, thus different in the fuel consumption profiles)
### 2. 🧮 Optimization Model
- The mathematical model for this project is based on the model developed by Kopfer, H.W., Schönberger, J., & Kopfer, H. Reducing greenhouse gas emissions of a heterogeneous vehicle fleet. Flex Serv Manuf J 26, 221–248 (2014), [https://doi.org/10.1007/s10696-013-9180-9](https://doi.org/10.1007/s10696-013-9180-9). Besides, the fuel consumption for different truck types was also referenced from this paper.
This is the Mathematical Model – Emission-Minimizing VRP (EVRP-VC) from the paper:
### 🔢 Objective Function
---
Minimize the total fuel consumed by all vehicles on all arcs: ∑ᵢ ∑ⱼ ∑ₖ [ dᵢⱼ × ( aₖ × xᵢⱼₖ + bₖ × qᵢⱼₖ ) ]
Where:
- `I`: Set of locations (including depot `0`)
- `K`: Set of vehicle types
- `dᵢⱼ`: Distance between node `i` and node `j`
- `aₖ`: Base fuel consumption per km for vehicle `k` (empty load)
- `bₖ`: Additional fuel consumption per ton per km for vehicle `k`
- `xᵢⱼₖ ∈ {0,1}`: 1 if vehicle `k` travels from `i` to `j`, 0 otherwise
- `qᵢⱼₖ ≥ 0`: Payload carried by vehicle `k` on arc (i, j)
subject to constraints:
- **Flow Conservation**: Each vehicle entering a node must also leave it: ∑ᵢ xᵢⱼₖ = ∑ᵢ xⱼᵢₖ ∀j ∈ I, ∀k ∈ K
- **Customer Served Once**: ∑ₖ yⱼₖ = 1 ∀j ∈ I \ {0}
- **Vehicle Starts at Depot**: ∑ⱼ x₀ⱼₖ ≤ 1 ∀k ∈ K
- **Vehicle Assignment Consistency**: ∑ᵢ xᵢⱼₖ = yⱼₖ ∀j ∈ I, ∀k ∈ K
- **Subtour Elimination (MTZ)**: uᵢ - uⱼ + n × xᵢⱼₖ ≤ n - 1 ∀i, j ∈ I \ {0}, ∀k ∈ K
- **Payload Flow Balance**: ∑ᵢ qᵢⱼₖ - ∑ᵢ qⱼᵢₖ = demandⱼ × yⱼₖ ∀j ∈ I \ {0}, ∀k ∈ K
- **Flow Only on Used Arcs**: qᵢⱼₖ ≤ Qₖ × xᵢⱼₖ ∀i, j ∈ I, ∀k ∈ K
- **Payload Non-negativity**: qᵢⱼₖ ≥ 0 ∀i, j ∈ I, ∀k ∈ K
- **Binary Variables**: xᵢⱼₖ ∈ {0,1}, yᵢₖ ∈ {0,1}
---
- The model code is based on the VRP++ application Version 4.02 by the Chair of Transport Services and Logistics, TU Dresden. You can downnload the application at this [link](https://tu-dresden.de/bu/verkehr/ivw/vbl/software/vrp)
- From the VRP++ application, I built:
- Add C++ objects to customize for the case of a heterogeneous fleet
- Model penalty costs for overloads (including penalty on the number of overloaded vehicles and pallets.
- Modify the objective function for **fuel-based optimization**
- The **Vehicle Routing Logic**: Sequential decision making: Assign requests to vehicles, Sequence deliveries per vehicle.
- Local search heuristics with **steepest descent** improve on an initial feasible solution.
### 3. 🌍 Real-Life Road-network Data Integration
- I downloaded data from [OpenStreetMap - Baden-Württemberg, Germany](https://download.geofabrik.de/europe/germany/baden-wuerttemberg.html).
- This data was stored in a local database using **PostgreSQL** and some extensions ( `hstore`: key-value road metadata, `postgis`: geospatial data types, and `pgrouting`: shortest path calculation).
### 4. 📊 Sensitivity Analysis
To test the algorithm’s performance and **evaluate robustness** across different operating conditions, the project includes a batch run of **405 XML scenario files**. Each scenario varies key model parameters:
| Parameter | Description |
|------------------|-----------------------------------------------------------------------------|
| `Seed` | Controls random behavior of the algorithm (diversification) |
| `nbh` | Size of the neighborhood in local search (exploration extent) |
| `P1`, `P2` | Penalties for exceeding vehicle capacity (weight and volume overloads) |
| Fleet Configuration | 5 Different combinations of heterogeneous vehicle types |
---
# 🧱 Project Results:
After successfully building the C++ code and running the batch process, it returned the solution in the text files. This image is an example of one scenario's initial solutions, in which the code returned the solution that assigned 100 delivery requests to 12 trucks, and the sequences of delivery points in each truck. Besides, the total fuel consumption is around 284 liters with total travel lengths of the whole fleet is ~995km.
The local search metaheuristic algorithm improved upon this initial solution, which decreased the objective function is 262.764 liters.
Across 405 scenarios, the best-performing configuration was:
| Parameter | Value |
|-----------------------------------|------------------------------|
| **Fleet Used** | Fleet 3 (heterogeneous) |
| **Vehicles Used** | 11 |
| **Random Seed (`S`)** | 24 |
| **Penalty Settings (`P1`, `P2`)** | 150 / 250 |
| **Neighborhood Size (`nbh_size`)**| 50 |
| **Final Objective (Fuel)** | **84.00 liters** |
| **Initial Objective (Fuel)** | 284.00 liters |
| **Improvement** | ~70% |
The result below illustrates this:
📸 This best solution was visualized using [uMap](https://wiki.openstreetmap.org/wiki/UMap/Guide)
---
## 🤝 Collaboration & Feedback
I'm open to ideas, improvements, and collaborations!
Feel free to fork, open an issue, or submit a pull request.
📬 Contact: thuynguyen.scm2022@gmail.com
🔗 LinkedIn: [Thu Thuy Nguyen](https://www.linkedin.com/in/thuynguyen-tudresden/)