src/apps/vrp_glpk_sp.cpp File Reference

#include "OsiGlpkSolverInterface.hpp"
#include "CoinPackedMatrix.hpp"
#include "CoinPackedVector.hpp"
#include "VRPH.h"

Go to the source code of this file.

Defines
#define	MAX_ROUTES   50000
Functions
void	OSI_recover_route (int id, int **orderings, VRPRoute *r)
void	OSI_recover_solution (OsiSolverInterface *si, int **orderings, int *sol_buff)
void	OSI_add_route (OsiSolverInterface *si, VRP *V, VRPRoute *r, int id, int **orderings)
int	main (int argc, char **argv)
Variables
int	max_columns
int	num_cols_to_delete
bool	verbose
time_t	heur_time
time_t	mip_time

---

Define Documentation

#define MAX_ROUTES   50000

Definition at line 23 of file vrp_glpk_sp.cpp.

---

Function Documentation

int main	(	int	argc,
		char **	argv
	)

Definition at line 225 of file vrp_glpk_sp.cpp.

void OSI_add_route	(	OsiSolverInterface *	si,
		VRP *	V,
		VRPRoute *	r,
		int	id,
		int **	orderings
	)

Adds a column/route to the current set partitioning problem. The column is assigned the name of id, which is converted to a string.

Definition at line 108 of file vrp_glpk_sp.cpp.

void OSI_recover_route	(	int	id,
		int **	orderings,
		VRPRoute *	r
	)

Populates the route r with the information from orderings[i]. Computes the number of customers and the hash values of the route.

Definition at line 38 of file vrp_glpk_sp.cpp.

void OSI_recover_solution	(	OsiSolverInterface *	si,
		int **	orderings,
		int *	sol_buff
	)

Extracts the solution from the current set partitioning instance and places it in sol_buff[]. We need to access the column/variable names since these hold the orderings of the routes.

Definition at line 64 of file vrp_glpk_sp.cpp.

---

Variable Documentation

time_t heur_time

Definition at line 36 of file vrp_glpk_sp.cpp.

int max_columns

Definition at line 32 of file vrp_glpk_sp.cpp.

time_t mip_time

Definition at line 36 of file vrp_glpk_sp.cpp.

int num_cols_to_delete

Definition at line 33 of file vrp_glpk_sp.cpp.

bool verbose

Definition at line 35 of file vrp_glpk_sp.cpp.