Skip to content

Java genetic algorithm for the vehicle routing and travelling salesman problems

License

Notifications You must be signed in to change notification settings

thebitspud/Surveyor-GA

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Surveyor GA

Java implementation of a genetic algorithm that finds optimal paths for the vehicle routing and travelling salesman problems.

Usage

Requirements: Java 1.8+ locally installed.

  1. Clone or download the repository.
  2. Modify parameters in Main.java as desired.
  3. Run Main.java using an IDE or CLI.

I will most likely add an executable applet at some point, but for now the program must be run via command line.

Example Progression

This is an example of what the best route will look like as the genetic algorithm iteratively optimizes its solutions.

Part 1 Part 2
Part 3 Part 4

More Examples

Here are some additional examples of vehicle routing problems solved by the algorithm (along with the approximate number of generations it took to settle on an optimal solution).

100 Nodes 1 Agent 128 Nodes 4 Agents
250 Nodes 2 Agents 300 Nodes 3 Agents
500 Nodes 1 Agent 500 Nodes 10 Agents

About

Java genetic algorithm for the vehicle routing and travelling salesman problems

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages