https://github.com/ggeop/vehicle-routing-problem

Vehicle Routing Problem, based on Greedy algorythm.
https://github.com/ggeop/vehicle-routing-problem

greedy-algorithms java local-search optimization-algorithms tsp-problem tsp-solver

Last synced: 18 days ago
JSON representation

Vehicle Routing Problem, based on Greedy algorythm.

• Host: GitHub
• URL: https://github.com/ggeop/vehicle-routing-problem
• Owner: ggeop
• Created: 2018-05-15T21:02:41.000Z (over 6 years ago)
• Default Branch: master
• Last Pushed: 2018-05-15T21:19:19.000Z (over 6 years ago)
• Last Synced: 2024-12-06T19:02:04.216Z (27 days ago)
• Topics: greedy-algorithms, java, local-search, optimization-algorithms, tsp-problem, tsp-solver
• Language: Java
• Homepage:
• Size: 4.88 KB
• Stars: 0
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# VehicleRoutingProblem

The code is about a java application for dealing with the Vehicle Routing Problem.

In this impelementation we should include the depot, the customers, the set of routes, the solution and the

distance matrix.

### Local Search

The algorythm includes a local search method for improving the initial solution. This local

search method will consider intra & inter-route relocations. This means that at each iteration, the method

should explore all potential relocations of the customers within their routes. The relocation yielding the

best solution cost improvement should be selected to be applied to the candidate solution. The method

should terminate if no improving intra-route relocation can be identified