VRPH  1.0
VRP Member List
This is the complete list of members for VRP, including all inherited members.
add_route(int *route_buff)VRP
append_route(int *sol_buff, int *route_buff)VRP
balance_parameterVRP [private]
before(int a, int b)VRP [private]
best_knownVRP [private]
best_sol_buffVRP [private]
best_total_route_lengthVRP [private]
can_displayVRP [private]
capture_best_solution()VRP [private]
check_feasibility(VRPViolation *VV)VRP [private]
check_fixed_edges(const char *message)VRP
check_move(VRPMove *M, int rules)VRP [private]
check_savings(VRPMove *M, int rules)VRP [inline, private]
check_tabu_status(VRPMove *M, int *old_sol)VRP [private]
ClarkeWright classVRP [friend]
clean_route(int r, int heuristics)VRP
clone(VRP *W)VRP
compute_route_center(int r)VRP [private]
Concatenate classVRP [friend]
cooling_ratioVRP [private]
coord_typeVRP [private]
count_num_routes()VRP [private]
create_default_routes()VRP
create_default_routes(int day)VRP
create_distance_matrix(int type)VRP
create_neighbor_lists(int nsize)VRP
create_pred_array()VRP
create_search_neighborhood(int j, int rules)VRP [private]
CrossExchange classVRP [friend]
current_sol_buffVRP [private]
dVRP [private]
depot_normalizedVRP [private]
deviationVRP [private]
display_typeVRP [private]
dummy_indexVRP [private]
edge_weight_formatVRP [private]
edge_weight_typeVRP [private]
eject_neighborhood(int j, int num, int *nodelist)VRP
eject_node(int k)VRP
eject_route(int r, int *route_buff)VRP
ejection_cost(int u)VRP [private]
export_canonical_solution_buff(int *sol_buff)VRP
export_solution_buff(int *sol_buff)VRP
find_cheapest_insertion(int j, int *edge, double *costs, int rules)VRP [private]
find_common_routes(int *sol1, int *sol2, int *route_nums)VRP
find_neighboring_routes()VRP [private]
fix_edge(int start, int end)VRP
fix_string(int *node_string, int k)VRP
fixedVRP [private]
fixed_service_timeVRP [private]
Flip classVRP [friend]
forbid_tiny_movesVRP [private]
get_best_known()VRP
get_best_sol_buff(int *sol_buff)VRP
get_best_total_route_length()VRP
get_distance_between(int a, int b)VRP [private]
get_max_route_length()VRP
get_max_veh_capacity()VRP
get_num_days()VRP
get_num_nodes()VRP
get_num_original_nodes()VRP
get_segment_info(int a, int b, struct VRPSegment *S)VRP [private]
get_string_end(int a, int len)VRP [private]
get_total_number_of_routes()VRP
get_total_route_length()VRP
get_total_service_time()VRP
has_service_timesVRP [private]
import_solution_buff(int *sol_buff)VRP
inject_node(int j)VRP
inject_set(int num, int *nodelist, int rules, int attempts)VRP
insert_node(int j, int i, int k)VRP [private]
insertion_cost(int u, int a, int b)VRP [private]
intersect_solutions(int *new_sol, int **routes, int *sol1, int *sol2, int min_routes)VRP
is_feasible(VRPMove *M, int rules)VRP [private]
list_fixed_edges(int *fixed_list)VRP
matrix_sizeVRP [private]
max_route_lengthVRP [private]
max_thetaVRP [private]
max_veh_capacityVRP [private]
min_route_lengthVRP [private]
min_thetaVRP [private]
min_vehiclesVRP [private]
MoveString classVRP [friend]
nameVRP
neighbor_list_sizeVRP [private]
next_arrayVRP [private]
nodesVRP [private]
normalize_route_numbers()VRP
num_daysVRP [private]
num_evaluationsVRP
num_movesVRP
num_nodesVRP [private]
num_original_nodesVRP [private]
OnePointMove classVRP [friend]
orig_max_route_lengthVRP [private]
orig_max_veh_capacityVRP [private]
OrOpt classVRP [friend]
osman_insert(int k, double alpha)VRP [private]
osman_perturb(int num, double alpha)VRP [private]
perturb()VRP
perturb_locations(double c)VRP [private]
plot(const char *filename, int options, int orientation)VRP
plot(const char *filename)VRP
plot_route(int r, const char *filename)VRP
Postsert classVRP [friend]
postsert_dummy(int i)VRP [private]
pred_arrayVRP [private]
Presert classVRP [friend]
presert_dummy(int i)VRP [private]
print_stats()VRP
problem_typeVRP [private]
read_fixed_edges(const char *filename)VRP
read_solution_file(const char *filename)VRP
read_TSPLIB_file(const char *infile)VRP
recordVRP [private]
refresh_routes()VRP
remove_dummy()VRP [private]
reset()VRP
reverse_route(int i)VRP
routeVRP [private]
route_numVRP [private]
route_whVRP
routedVRP [private]
RTR_solve(int heuristics, int intensity, int max_stuck, int num_perturbs, double dev, int nlist_size, int perturb_type, int accept_type, bool verbose)VRP
SA_solve(int heuristics, double start_temp, double cool_ratio, int iters_per_loop, int num_loops, int nlist_size, bool verbose)VRP
search_sizeVRP [private]
search_spaceVRP [private]
set_best_total_route_length(double val)VRP
set_daily_demands(int day)VRP
set_daily_service_times(int day)VRP
show_next_array()VRP
show_pred_array()VRP
show_route(int k)VRP
show_routes()VRP
solution_whVRP
split(double p)VRP
split_routes(double p, int **ejected_routes, double *t)VRP
summary()VRP
Swap classVRP [friend]
SwapEnds classVRP [friend]
Sweep classVRP [friend]
symmetricVRP [private]
tabu_listVRP [private]
temperatureVRP [private]
ThreeOpt classVRP [friend]
ThreePointMove classVRP [friend]
total_demandVRP [private]
total_number_of_routesVRP [private]
total_route_lengthVRP [private]
total_service_timeVRP [private]
TwoOpt classVRP [friend]
TwoPointMove classVRP [friend]
unfix_all()VRP
unfix_edge(int start, int end)VRP
update(VRPMove *M)VRP [private]
update_arrival_times()VRP [private]
update_route(int j, VRPRoute *R)VRP
update_solution_wh()VRP [private]
verify_routes(const char *message)VRP
violationVRP [private]
VRP(int n)VRP
VRP(int n, int ndays)VRP
write_solution_file(const char *filename)VRP
write_solutions(int num_sols, const char *filename)VRP
write_tex_file(const char *filename)VRP
write_TSPLIB_file(const char *outfile)VRP
~VRP()VRP