Capacitated Vehicle Routing Problem
Contents:
Notes on algorithm implementation
1. Greedy Solution
2. Local Search (Run on each vehicle individually) (LS)
3. Local Search (LS)
4. Tabu Search (TS)
5. Genetic Algorithm (GA)
6. Simulated Annealing (SA)
7. Hybrid Algorithm (HA)
Library API
Class Hierarchy
File Hierarchy
Full API
Classes and Structs
Struct Node
Struct PairHash
Struct Problem
Struct Vehicle
Class GASolution
Class GreedySolution
Class LocalSearchInterIntraSolution
Class LocalSearchIntraSolution
Class SimulatedAnnealingSolution
Class Solution
Class TabuSearchSolution
Functions
Function DisplaySolution(const Solution&)
Function DisplaySolution(const Solution&)
Function DrawCoordinates
Function main
Function operator<<(std::ostream&, const Node&)
Function operator<<(std::ostream&, const Vehicle&)
Function operator<<(std::ostream&, const Node&)
Function operator<<(std::ostream&, const Vehicle&)
Function PrintVehicleRoute(const Vehicle&)
Function PrintVehicleRoute(const Vehicle&)
Function UpdateColours
Variables
Variable margin_of_error
Variable margin_of_error
Variable margin_of_error
Variable p_insert_iter_dist
Variable p_mutate
Variable p_mutate_within_gene
Variable p_random_swap
Variable total_percentage
Directories
Directory cvrp
Directory include
Directory main
Directory src
Files
File genetic_algorithm.cpp
File genetic_algorithm.hpp
File graphics_utils.cpp
File graphics_utils.hpp
File greedy.cpp
File greedy.hpp
File local_search_inter_intra.cpp
File local_search_inter_intra.hpp
File local_search_intra.cpp
File local_search_intra.hpp
File main.cpp
File README.md
File simulated_annealing.cpp
File simulated_annealing.hpp
File tabu_search.cpp
File tabu_search.hpp
File utils.cpp
File utils.hpp
Capacitated Vehicle Routing Problem
Docs
»
Library API
»
Function PrintVehicleRoute(const Vehicle&)
View page source
Function PrintVehicleRoute(const Vehicle&)
¶
Defined in
File utils.cpp
Function Documentation
¶
void
PrintVehicleRoute
(
const
Vehicle
&
v
)
¶
Prints the vehicle route.
Return
void
Parameters
v
: vehicle who’s route is to be printed