Main Page
Related Pages
Modules
Namespaces
Classes
Files
File List
File Members
home
coin
svn-release
Blis-0.94.3
Blis
examples
VRP
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
;
38
route_data
*
route_info
;
39
_node
*
tour
;
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 */
51
int
allocated_edgenum
;
52
int
del_edgenum
;
53
edge_data
*
edges
;
/* The data for these edges */
54
}
small_graph
;
55
56
#endif
SMALL_GRAPH::edgenum
int edgenum
Definition:
VrpCommonTypes.h:50
ROUTE_DATA::first
int first
Definition:
VrpCommonTypes.h:26
route_data
struct ROUTE_DATA route_data
BEST_TOURS::numroutes
int numroutes
Definition:
VrpCommonTypes.h:37
EDGE_DATA
Definition:
VrpCommonTypes.h:42
SMALL_GRAPH::allocated_edgenum
int allocated_edgenum
Definition:
VrpCommonTypes.h:51
_NODE::route
int route
Definition:
VrpCommonTypes.h:22
BEST_TOURS::route_info
route_data * route_info
Definition:
VrpCommonTypes.h:38
BEST_TOURS::cost
int cost
Definition:
VrpCommonTypes.h:36
edge_data
struct EDGE_DATA edge_data
_NODE::next
int next
Definition:
VrpCommonTypes.h:21
BEST_TOURS::solve_time
double solve_time
Definition:
VrpCommonTypes.h:35
ROUTE_DATA::last
int last
Definition:
VrpCommonTypes.h:27
ROUTE_DATA::numcust
int numcust
Definition:
VrpCommonTypes.h:28
SMALL_GRAPH::vertnum
int vertnum
Definition:
VrpCommonTypes.h:49
best_tours
struct BEST_TOURS best_tours
ROUTE_DATA
Definition:
VrpCommonTypes.h:25
_NODE
Definition:
VrpCommonTypes.h:20
EDGE_DATA::cost
int cost
Definition:
VrpCommonTypes.h:45
SMALL_GRAPH::del_edgenum
int del_edgenum
Definition:
VrpCommonTypes.h:52
_node
struct _NODE _node
BEST_TOURS
Definition:
VrpCommonTypes.h:33
BEST_TOURS::tour
_node * tour
Definition:
VrpCommonTypes.h:39
EDGE_DATA::v0
int v0
Definition:
VrpCommonTypes.h:43
SMALL_GRAPH
Definition:
VrpCommonTypes.h:48
small_graph
struct SMALL_GRAPH small_graph
EDGE_DATA::v1
int v1
Definition:
VrpCommonTypes.h:44
ROUTE_DATA::cost
int cost
Definition:
VrpCommonTypes.h:30
ROUTE_DATA::weight
int weight
Definition:
VrpCommonTypes.h:29
SMALL_GRAPH::edges
edge_data * edges
Definition:
VrpCommonTypes.h:53
BEST_TOURS::algorithm
int algorithm
Definition:
VrpCommonTypes.h:34
Generated by
1.8.5