https://github.com/ifimust/vrp_challenge_retrospective
Further improvements to vrp_challenge, outside the time limit
https://github.com/ifimust/vrp_challenge_retrospective
Last synced: 8 months ago
JSON representation
Further improvements to vrp_challenge, outside the time limit
- Host: GitHub
- URL: https://github.com/ifimust/vrp_challenge_retrospective
- Owner: ifIMust
- Created: 2024-08-25T17:32:18.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2024-08-25T19:54:18.000Z (almost 2 years ago)
- Last Synced: 2025-07-04T03:04:56.116Z (12 months ago)
- Language: Go
- Size: 197 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## Description
The [vrp_challenge](https://github.com/ifIMust/vrp_challenge) project was limited to 48 hours of time, so it cannot receive further updates.
This repository is based on that project, and serves to test additional improvements or variations without impacting the "hackathon" version.
See [vrp_challenge](https://github.com/ifIMust/vrp_challenge) for build instructions and more information.
The original solution produced these results (using given test data):
```
mean cost: 45744.88601842658
mean run time: 9035.528087615967ms
```
This version, using the same data:
```
mean cost: 45302.30033360918
mean run time: 18394.224894046783ms
```
The following improvements were made:
- **Enforce time limit.** 30s to complete a problem with 200 loads was a *requirement*. A timer is used to stop the Tabu search when time is running low.
- **Explore a larger neighbor space**
- Move loads within the same route.
- Remove limit on size of source routes for load reassignment.
- **Improve parallelism:** Use an additional goroutine to read and process results alongside queue workers.
By relying on the time limit to control iterations, the number of Tabu Search iterations was increased.
Using longer run times to optimize cost produces a very high quality solution.
The neighbor space is explored much more deeply, especially by removing the size limit of routes that might have loads moved from them.