Java implementation of the Heterogenous Vehicle Routing Problem using four heuristic algorithms:
Program can be started by downloading the file App.jar (in app folder) and run the command:
java -jar App.jar
Minimal required java version: 11
Parameters:
- Method: selection of the algorithm version - greedy or steepest
Parameters:
- Probability: the probability of accepting the initial solutions, which is used to determine the initial temperature
- T0 iteration number: value specifying the number of iterations during which the neighborhood solution is found when the initial temperature is determined
- Cooling factor: temperature cooling coefficient
- Iteration number: number of iterations for a given temperature
Parameters:
- Iteration number: number of iterations
- Tabu iteration number: the number of iterations in which the use of taboo motion is prohibited
Parameters:
- Population size: population size
- Iteration number: the number of iterations
- Crossover probability: crossover probability
- Mutation probability: mutation probability
- Repeating crossover number: a number that specifies how many times the crossing will be repeated, in case of receiving a solution that does not meet the assumptions
- Selection method: method of selection, the available methods are: roulette method, rank selection, tournament selection
- Tournament size: the number of individuals taking part in the tournament. An important parameter when choosing a tournament selection
- Selective pressure: selection coefficient important during ranking selection, the coefficient value is a floating-point number in the range [1.0,2.0]
The input file should have an extension compatible with Excel, e.g. xlsx. The first row is a header informing about the values that are in each cell. The values in the columns are as follows:
- A. City name
- B. City amount
- C. City latitude
- D. City longitude
- E. Empty column
- F. Vehicle name
- G. Vehicle amount
- H. Empty column
- I. City name of depot
- J. Depot latitude
- K. Depot longitude
Example input file
After successful completion of the program, the solution is saved to a file with the same extension as the input file. The first line contains information about the total distance traveled by the vehicles, and the next line shows the individual routes of vehicles.
Example output file
