Debian Codegraph @

SYMPHONY/Applications/VRP/include/heurs/ins_routines.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_ROUTINES
18 #define _INS_ROUTINES
19
20 #include "sym_proto.h"
21 #include "heur_types.h"
22 #include "vrp_common_types.h"
23
24 int farthest_ins_from_to PROTO((heur_prob *p, _node *tour, int cost,
25 int from_size, int to_size, int starter, neighbor *nbtree,
26 int *intour, int *last, route_data *route_info, int cur_route));
27 int nearest_ins_from_to PROTO((heur_prob *p, _node *tour, int cost,
28 int from_size, int to_size, int starter, neighbor *nbtree,
29 int *intour, int *last, route_data *route_info, int cur_route));
30 int closest PROTO((neighbor *nbtree, int *intour, int *last));
31 void ni_insert_edges PROTO((heur_prob *p, int new_node, neighbor *nbtree,
32 int *intour,int *last, _node *tour, int cur_route));
33 int farthest PROTO((neighbor *nbtree, int *intour, int *last));
34 void fi_insert_edges PROTO((heur_prob *p, int new_node, neighbor *nbtree,
35 int *intour, int *last, _node *tour, int cur_route));
36 int insert_into_tour PROTO((heur_prob *p, _node *tour, int starter, int size,
37 int new_node, route_data *route_info, int cur_route));
38 void starters PROTO((heur_prob *p, int *starter, route_data *route_info,
39 int start));
40
41 #endif