- Main Page
- Modules
- Namespaces
- Classes
- Files
- Related Pages

- File List
- File Members

# /home/coin/SVN-release/Blis-0.91.2/Blis/examples/VRP/VrpCommonTypes.h

Go to the documentation of this file.

    00001 /*===========================================================================*
    00002  * This file is part of a solver for the Vehicle Routing Problem             *
    00003  * developed using the BiCePS Linear Integer Solver (BLIS).                  *
    00004  *                                                                           *
    00005  * This solver is distributed under the Common Public License as part of     *
    00006  * the COIN-OR repository (http://www.coin-or.org).                          *
    00007  *                                                                           *
    00008  * Authors: Yan Xu, Lehigh University                                        *
    00009  *          Ted Ralphs, Lehigh University                                    *
    00010  *                                                                           *
    00011  * Copyright (C) 2007 Yan Xu and Ted Ralphs.                                 *
    00012  * All Rights Reserved.                                                      *
    00013  *===========================================================================*/
    00014
    00015 #ifndef VrpCommonTypes_h_
    00016 #define VrpCommonTypes_h_
    00017
    00018 //#############################################################################
    00019
    00020 typedef struct _NODE{
    00021    int next;
    00022    int route;
    00023 }_node;
    00024
    00025 typedef struct ROUTE_DATA{
    00026    int first;
    00027    int last;
    00028    int numcust;
    00029    int weight;
    00030    int cost;
    00031 }route_data;
    00032
    00033 typedef struct BEST_TOURS{
    00034    int algorithm;
    00035    double solve_time;
    00036    int cost;
    00037    int numroutes;
    00038    route_data *route_info;
    00039    _node *tour;
    00040 }best_tours;
    00041
    00042 typedef struct EDGE_DATA{
    00043   int v0;
    00044   int v1;
    00045   int cost;
    00046 }edge_data;
    00047
    00048 typedef struct SMALL_GRAPH{   /* this gets passed eg. to lin-kerninghan */
    00049    int vertnum;               /* vertnum in the restricted (small) graph */
    00050    int edgenum;               /* edgenum in the restricted (small) graph */
    00051    int allocated_edgenum;
    00052    int del_edgenum;
    00053    edge_data *edges;       /* The data for these edges */
    00054 }small_graph;
    00055
    00056 #endif