README
1******************************************************************************
2* SYMPHONY CNRP Application *
3******************************************************************************
4
5The SYMPHONY CNRP application is a solver for Capacitated Node
6Routing Problems as described in the following technical report:
7
8T.K.R., M.J. Saltzman, and M.M. Wiecek, An Improved Algorithm for Biobjective
9Integer Programming and Its Application to Network Routing Problems, Lehigh
10University Industrial and Systems Engineering Technical Report 04T-004,
11available for download from
12
13http://www.lehigh.edu/~tkr2/research/papers/BICRIT.pdf.
14
15The CNRP application takes advantage of SYMPHONY's ability to solve bicriteria
16optimization problems and can analyze the tradeoff between fixed and variable
17cost in a class of network routing applications that include variants of the
18Traveling Salesman Problem, Vehicle Routing Problem, Capacitated Minimum
19Spanning Tree Problem, and Cable Trench Problem.
20
21******************************************************************************
22* INSTALLATION *
23******************************************************************************
24
25Please see the INSTALL file for a guide to compile SYMPHONY CNRP application.
26
27*******************************************************************************
28* USING THE SOLVER *
29*******************************************************************************
30
31This file briefly introduces the use of the SYMPHONY CNRP solver. To use the
32CNRP solver, type the executable name followed by one or more of the
33command-line switches. There are two required switches. You must specify the
34location of the data file by using "-F 'filename'" (type this after executable
35name) and you must specify the type of the problem by "-R". Below is a list
36of other parameters that can be set on the command line. This list can also
37be obtained by typing the executable name followed by "-H". Notice that all
38application-specific parameters are denoted by a capital letter.
39
40 -H: help
41 -E: use sparse edge set
42 -D level: verbosity level for displaying LP solutions
43 -R type: specify problem type
44 -S file: load sparse graph from 'file'
45 -F file: problem data is in 'file'
46 -B i: which candidates to check in strong branching
47 -V i: how to construct the base set of variables
48 -K k: use 'k' closest edges to build sparse graph
49 -N n: use 'n' routes
50 -M : use min cut subroutine
51 -C c: use capacity 'c'
52 -X t: toggles generation of X cuts
53 -Y t: toggles generation of capacity cuts
54 -Z t: toggles generation of tight capacity cuts
55 -G t: set tau to 't'
56
57There are a number of other (for now) undocumented parameters that can be used
58to fine-tune the performance of the solver. These must be set in a parameter
59file. The SYMPHONY User's Manual explains the use of the parameter file.
60
61Some of SYMPHONY's native parameters can also be set on the command
62line. Below is a list of these parameters. This list can also be obtained by
63typing the executable name with no command-line arguments. Note that all
64SYMPHONY parameters are denoted by a lowercase letter. Note that there are
65dozens of other parameters that can be set with the use of a parameter
66file. These parameters are listed in the SYMPHONY User's Manual.
67
68 -h: help
69 -a: no cut timeout
70 -d: enable graph drawing
71 -g: use cut generator
72 -r: do repricing in root
73 -t: trim the tree
74 -b: don't perform branch and cut
75 -u ub: use upper bound 'ub'
76 -p procs: allow 'procs' active nodes
77 -n i: use node selection rule 'i'
78 -v i: set verbosity to level 'i'
79 -s cands: use 'cands' candidates for strong branching
80 -c i: use rule 'i' to compare candidates
81 -k i: use rule 'i' to select child
82 -m n: allow a max of 'n' cuts to enter per iteration
83 -l n: allow a max of 'n' cut pools
84 -i n: allow a max of 'n' iterations in presolve
85 -f file: read parameters from parameter file 'file'
86
87AUTHORS
88
89The SYMPHONY CNRP application was developed by Ted Ralphs
90(ted@lehigh.edu).
91
92BUG REPORTS
93
94Please submit bug reports at https://projects.coin-or.org/SYMPHONY
95