VrpCommonTypes.h
Go to the documentation of this file.
1 /*===========================================================================*
2  * This file is part of a solver for the Vehicle Routing Problem *
3  * developed using the BiCePS Linear Integer Solver (BLIS). *
4  * *
5  * This solver is distributed under the Eclipse Public License as part of *
6  * the COIN-OR repository (http://www.coin-or.org). *
7  * *
8  * Authors: Yan Xu, Lehigh University *
9  * Ted Ralphs, Lehigh University *
10  * *
11  * Copyright (C) 2007 Yan Xu and Ted Ralphs. *
12  * All Rights Reserved. *
13  *===========================================================================*/
14 
15 #ifndef VrpCommonTypes_h_
16 #define VrpCommonTypes_h_
17 
18 //#############################################################################
19 
20 typedef struct _NODE{
21  int next;
22  int route;
23 }_node;
24 
25 typedef struct ROUTE_DATA{
26  int first;
27  int last;
28  int numcust;
29  int weight;
30  int cost;
31 }route_data;
32 
33 typedef struct BEST_TOURS{
34  int algorithm;
35  double solve_time;
36  int cost;
37  int numroutes;
40 }best_tours;
41 
42 typedef struct EDGE_DATA{
43  int v0;
44  int v1;
45  int cost;
46 }edge_data;
47 
48 typedef struct SMALL_GRAPH{ /* this gets passed eg. to lin-kerninghan */
49  int vertnum; /* vertnum in the restricted (small) graph */
50  int edgenum; /* edgenum in the restricted (small) graph */
53  edge_data *edges; /* The data for these edges */
55 
56 #endif
struct ROUTE_DATA route_data
int allocated_edgenum
int route
route_data * route_info
struct EDGE_DATA edge_data
int next
double solve_time
struct BEST_TOURS best_tours
struct _NODE _node
_node * tour
struct SMALL_GRAPH small_graph
edge_data * edges