| 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 SWEEP_H |
| 18 |
#define SWEEP_H |
| 19 |
|
| 20 |
#include <math.h> |
| 21 |
#include <stdlib.h> |
| 22 |
|
| 23 |
#include "heur_types.h" |
| 24 |
#include "heur_common.h" |
| 25 |
#include "sym_constants.h" |
| 26 |
#include "heur_routines.h" |
| 27 |
|
| 28 |
typedef struct SWEEP_DATA{ |
| 29 |
float angle; |
| 30 |
int cust; |
| 31 |
}sweep_data; |
| 32 |
|
| 33 |
|
| 34 |
void make_tour PROTO((heur_prob *p, sweep_data *data, best_tours *final_tour)); |
| 35 |
|
| 36 |
void sweep PROTO((int parent, heur_prob *p)); |
| 37 |
|
| 38 |
#endif |