ins_routines2.h File Reference

#include "sym_proto.h"
#include "heur_types.h"
#include "vrp_common_types.h"

Include dependency graph for ins_routines2.h:

Go to the source code of this file.

Functions
void nearest_ins2	PROTO ((heur_prob *p, _node *tour, route_data *route_info, int from_size, int to_size, neighbor *nbtree, int *intour, int *last, int *zero_cost))
int closest2	PROTO ((neighbor *nbtree, int *intour, int *last, int *host))
void ni_insert_edges2	PROTO ((heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last, _node *tour, route_data *route_info))
int insert_into_tour2	PROTO ((heur_prob *p, _node *tour, int new_node, route_data *route_info))
void new_host2	PROTO ((heur_prob *p, int node, neighbor *nbtree, int *intour, int *last, _node *tour, route_data *route_info, int *zero_cost))
void seeds2	PROTO ((heur_prob *p, int *numroutes, int *intour, neighbor *nbtree))
void farthest_ins_from_to2	PROTO ((heur_prob *p, _node *tour, int from_size, int to_size, neighbor *nbtree, int *intour, int *last))
int farthest2	PROTO ((neighbor *nbtree, int *intour, int *last))
void fi_insert_edges2	PROTO ((heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last))

Function Documentation

void nearest_ins2 PROTO

(

(heur_prob *p, _node *tour, route_data *route_info, int from_size, int to_size, neighbor *nbtree, int *intour, int *last, int *zero_cost)

)

int closest2 PROTO

(

(neighbor *nbtree, int *intour, int *last, int *host)

)

void ni_insert_edges2 PROTO

(

(heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last, _node *tour, route_data *route_info)

)

int insert_into_tour2 PROTO

(

(heur_prob *p, _node *tour, int new_node, route_data *route_info)

)

void new_host2 PROTO

(

(heur_prob *p, int node, neighbor *nbtree, int *intour, int *last, _node *tour, route_data *route_info, int *zero_cost)

)

void seeds2 PROTO

(

(heur_prob *p, int *numroutes, int *intour, neighbor *nbtree)

)

void farthest_ins_from_to2 PROTO

(

(heur_prob *p, _node *tour, int from_size, int to_size, neighbor *nbtree, int *intour, int *last)

)

int farthest2 PROTO

(

(neighbor *nbtree, int *intour, int *last)

)

void tsp_fi_insert_edges PROTO

(

(heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last)

)