Debian Codegraph @

SYMPHONY/Applications/VRP/include/heurs/ins_routines2.h

raw
1 /*===========================================================================*/
2 /* */
3 /* This file is part of a demonstration application for use with the */
4 /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */
5 /* the Vehicle Routing Problem and the Traveling Salesman Problem. */
6 /* */
7 /* This application was developed by Ted Ralphs ([email protected]) */
8 /* This file was modified by Ali Pilatin January, 2005 ([email protected]) */
9 /* */
10 /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */
11 /* */
12 /* This software is licensed under the Eclipse Public License. Please see */
13 /* accompanying file for terms. */
14 /* */
15 /*===========================================================================*/
16
17 #ifndef _INS_ROUTINES2_H
18 #define _INS_ROUTINES2_H
19
20 #include "sym_proto.h"
21 #include "heur_types.h"
22 #include "vrp_common_types.h"
23
24 void nearest_ins2 PROTO((
25 heur_prob *p, _node *tour, route_data *route_info, int from_size,
26 int to_size, neighbor *nbtree, int *intour, int *last, int *zero_cost));
27 int closest2 PROTO(( neighbor *nbtree, int *intour, int *last, int *host));
28 void ni_insert_edges2 PROTO((
29 heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last,
30 _node *tour, route_data *route_info));
31 int insert_into_tour2 PROTO((
32 heur_prob *p, _node *tour, int new_node, route_data *route_info));
33 void new_host2 PROTO((
34 heur_prob *p, int node, neighbor *nbtree, int *intour, int *last,
35 _node *tour, route_data *route_info, int *zero_cost));
36 void seeds2 PROTO((
37 heur_prob *p, int *numroutes, int *intour, neighbor *nbtree));
38 void farthest_ins_from_to2 PROTO((
39 heur_prob *p, _node *tour, int from_size,
40 int to_size, neighbor *nbtree,
41 int *intour, int *last));
42 int farthest2 PROTO((
43 neighbor *nbtree, int *intour, int *last));
44 void fi_insert_edges2 PROTO((
45 heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last));
46
47 #endif