Welcome to SYMPHONY. SYMPHONY is distributed under the Eclipse Public License and is freely redistributable. All source code and documentation is Copyright 2000-2019 by Ted Ralphs and others. This README may be redistributed freely.
Binaries for most platforms are available for download from Bintray
If you have downloaded a source distribution, LaTex source for the full documentation is available in the SYMPHONY/Doc/ subdirectory. Quick start guides and pointers to other on-line documentation can be found at the project Wiki:
https://projects.coin-or.org/SYMPHONY
The on-line version of the manual is available here:
http://www.coin-or.org/SYMPHONY/man-5.6/
What follows is a very brief and possibly out-of-date quick summary of installation and usage. Please see the documentation for more details.
If you downloaded a source distribution and would like instructions on building SYMPHONY or you downloaded a binary distribution and would like to know how to install it, please see the INSTALL file.
To use SYMPHONY as a generic solver, type the executable name on the command line, followed by one or more of the command-line switches. On the command-line, there is one required switch---you must specify the location of the input file by using either "-F 'filename'" (MPS file or automatic detection with file extension) or "-L 'filename'" (LP format). If the "-D" switch is also present, the file will be assumed to be a GMPL model file with the data file specified after the "-D" switch. In LINUX, the following command would solve the instance "sample.mps"
symphony -F sample.mps
The remaining switches are used to set SYMPHONY's native parameters on the command line. Below is a list of these parameters. This list can also be obtained by executng
symphony -h
Note that all SYMPHONY parameters are denoted by a lowercase letter. Many other parameters can be set with the use of a parameter file (specified with -f). These parameters are listed in the SYMPHONY user's manual.
symphony [ -FL file ] [ -f parameter_file_name ]
[ -hd ] [-a 0/1] [-b 0/1 ] [-s cands] [-l 0/1] [ -q 0/1 ] [ -r 0/1]
[-j 0/1 ] [ -e n ] [ -i iters ] [ -t time ] [ -g gap ] [ -n nodes ]
[ -u ub ] [ -p procs ] [ -k rule ] [ -v level ] [ -c rule ]
[ -m max ] [ -z n ] [-o tree_out_file] [-w 0/1]
-F model: model should be read in from file 'model'
(MPS format is assumed unless -D is also present)
-L model: LP format model should be read in from file 'model'
-D data: model is in AMPL format and data is in file 'data'
-T dir: run test with MIPLIB3 models
-h: help
-f file: read parameters from parameter file 'file'
-d: stop at first feasible solution
-a 0/1: whether to use primal heuristics
-b 0/1: whether to use reliability branching
-s cands: use at most 'cands' candidates for strong branching
-l 0/1: whether to impose a limit on strong branching time
-q 0/1: whether or not to tighten root bounds
-r 0/1: whether or not to do reduced cost tightening
-j 0/1: whether or not to generate cgl cuts
-w 0/1: whether or not to use hot starting in strong branching
-e n: set pre-processing level to 'n'
-i iters: allow a max of 'iters' iterations in presolve
-t time: set wallclock time limit to 'time'
-g gap: set gap limit to 'gap'
-n nodes: set node limit to 'nodes'
-u ub: use initial upper bound 'ub'
-p procs: allow 'procs' additional threads or processors
-k i: use node selection rule 'i'
-v n: set verbosity to level 'n'
-c i: use rule 'i' to compare candidates
-m max: allow a max of 'max' cuts to enter per iteration
-z n: set diving threshold to 'n'
-o file: output vbc-like tree information to file 'file'
To use SYMPHONY's Interactive shell, run the executable name without any command line arguments. Then type "help" or "?" to see a list of available commands which are as follows for this version:
load : read a problem in mps or ampl format
solve : solve the problem
lpsolve : solve the lp relaxation of the problem
set : set a parameter
display : display optimization results and stats
reset : restart the optimizer
help : show the available commands/params/options
quit/exit : leave the optimizer
So, if you want to load and solve an ampl/gmpl file, you will need to type "load sample.mod sample.dat" and then "solve".
To use SYMPHONY as a generic callable library, compile SYMPHONY as described above. The library that is created along with the solver itself can be linked to using the API described in the user's manual. For examples of using the callable library in this way, see the Examples/ subdirectory.
To customize SYMPHONY by implementing the custom callback functions, simply modify the files in the SYMPHONY/Applications/USER/ subdirectory, as described in the user's manual and follow the compilation procedures in the file SYMPHONY/Applications/USER/README. There are a number of sample applications available as examples of how to do this kind of development with SYMPHONY. These include solvers for the matching problem, the set partitioning problem (simple and advanced versions), the vehicle routing and traveling salesman problems, and the mixed postman problem. These applications are distributed as separate packages and can be downloaded from http://www.branchandcut.org. There is a white paper that guides the user through the development of the matching solver.
SYMPHONY can now be used in a very large number of possible configurations and we simply aren't able to test them all. Below is a rough idea of the testing status of various configurations to date. If you need a certain configuration, I would be happy to help you get it running. Please let me know.
The native interfaces for OSL and CPLEX have now been deprecated Only LP solvers with OSI interfaces are supported
Well tested: CPLEX, CLP
Well tested, but have some stability or other issues: GLPK
Compiled, but not well tested: SPX
Sequential configurations are now automatically built and tested on Linux, OS X, and Windows using
Builds and passes unit test with gcc 4 and 5 and CLP on LINUX.
Known configurations that build and pass unit test
- gcc 4.* on LINUX with PVM 3.4
-
SYMPHONY (used as a generic MILP solver): Well tested.
-
MATCH (matching): Tested, but not very extensively.
-
MPP (mixed postman problem): Tested, but not very extensively.
-
VRP (vehicle routing problem): Well tested.
-
CNRP (capacitates network routing problem): Well tested.
-
MCKP (multi criteria knapsack problem): Well tested.
-
SPP (set partitioning problem): Tested, but not very extensively.
-
SPP+CUTS (set partitioning problem with cutting planes): Tested, but not very extensively.
Cut generators are supplied by the Cut Generation Library (CGL). The cut generators that are turned on by default have been well tested. Two cut generators that are part ofthe CGL are turned off by default because of known issues. These are lift and project cuts and the simple rounding cuts. The generator for Gomory cuts works well, but has somenumerical issues. We found a few cases where the optimal solution was not found when using the Gomory cut generator, especially in combination with CPLEX. If the solver is not performing as it should, try turning off some of the cut generators to see if that fixes the problem.
See the Depdencies file for a list of the external COIN-OR libraries on which SYMPHONY depends.
There is a list serve for SYMPHONY users. To subscribe, go to http://list.coin-or.org/mailman/listinfo/coin-symphony
SYMPHONY was jointly developed by Ted Ralphs ([email protected]) and Laci Ladanyi ([email protected]). Menal Guzelsoy ([email protected]) and Ashutosh Mahajan ([email protected]) have been instrumental in development since version 5.0.
To report a bug please file a ticket at
https://projects.coin-or.org/SYMPHONY/newticket
Please note the version of SYMPHONY you are using when filing the ticket.
SYMPHONY was developed with support from
- National Science Foundation (Grants CMMI-1435453, CMMI-0728011, DMI-0522796, DMI-0534862, DMS-9527124, CMMI-1130914)
- Texas ATP Grant 97-3604-010
- Cornell University
- Lehigh University
- Zuse Institute Berlin
- Research Campus Modal "Mathematical Optimization and Data Analysis Laboratories" funded by the German Federal Ministry of Education and Research (BMBF Grant 05M14ZAM) and by the DFG SFB/Transregio 154
- Update appveyor
- Fix several reported bugs (see PRs 10-12, Issue 2)
- Fix problem with appveyor configuration
- Fix for configuration issue with OpenMP when building with Visual Studio compiler under Msys2
- Fix for bugs in PVM version
- Fix for bugs in computing lower bounds
- Fix for compilation error with gcc 6
- Other minor fixes
- Enabling binary uploads with BinTray
- Fixing small bug with re-setting environment in user applications.
- Fixing some memory errors arising with applications when extra variables are used.
- Fixing small bug with tracking variable indices in branching.
- Moving code inside critical block to prevent memory access errors in shared memory parallel mode.
- Added switches for turning hot starting on and off
- Updates to documentation
- Small fixes
- Added support for Travis and Appveyor
- Release to update externals and pick up bug fixes in other projects
- Fixed function for determining duals and reduced costs.
- Making it possible to build with cut validity checking enabled.
- Fixed bug with re-using of environment for new instances.
- Added parameter that allows saving of LP relaxations for debugging.
- Added function for writing LP files.
- Fixed bug that arose when we fixed a variable in strong branching (now, we keep going with LP loop when this happens).
- Fixed long-standing bug that arose when child 0 could be pruned while generating children.
- Updated externals
- Fixed bug with using more the 1 process in PVM
- Print to stderr on ctrl-c
- Fixed double free with prep level < 1
- Fixed memory leak
- Fixed double free when nodes are retained in memory after pruning
- Added ability to access solution pool after solve to retrieve additional suboptimal solutions.
- Updates to documentation
- Fix to dependency linking.
- Fix for installation with
DESTDIR
- Fixes to distributed parallel (PVM) version.
- Enable primal heuristics in distributed version.
- Update externals to most recent stables.
- Make dependency linking default.
- Disabling pre-processor for multicriteria instances.
- Added explicit dependence on libgomp, which is needed for linking with compilers that don't supprt OpenMP (clang on OS X)
-
Fix to pkgconfig file to add flags for OpenMP.
-
Fixes for documentation.
-
More fixes for dependency linking.
-
Fixes to applications to allow some preprocessing, which is needed for some primal heuristics to work.
-
Fixes to preprocessor settings so that the minimal amount of preprocessing is always done.
-
Fixes to some methods so they still work preprely even when preprocessing is not done.
-
Fixes to pre-processor for applications that construct the LP relaxation algorithmically.
-
Fix to pkgconfig file for applications.
-
Fix for dependency linking.
-
Other small bug fixes.
-
Updates and fixes to manual and documentation files.
-
Fixes for configuring with PVM.
-
Fixes to allow dependency linking with the application library.
-
Bug fix for reliability branching.
-
Bug fix for addition of column cuts
-
Updates to externals to fix bugs in dependent projects.
- Small fixes for OpenMP
-
Major re-design of shared memory parallel mode for increased efficiency and stability.
-
Fixes for distributed memory parallel version (PVM)
-
Fixes for bicriteria version
- More updates to build harness
- More updates to build harness
- More updates to build harness
- Fix memory leak
- Delete superfluous header file
- More updates to build harness
- More updates to build harness
- Fix problems with Visual Studio project files
- Update to build tools
- Fix bug that caused all user applications to crash
- Updates to MSVC++ files (applications now use property sheets and VRP app file is fixed).
- Other fixes for build tools.
- Updates to documentation
- Improvements to preprocessing
- Improvements to heuristics
- Improvements to MSVC++ support
- Bug fixes
- Significant performance gains
- More fixes to allow use of CPLEX as LP solver
- Fixes to interface with GMPL
- Fixes to allow use of CPLEX as LP solver
- Fixes to interface with GMPL
- Fixes for build system
- Other minor fixes
- Updates to documentation.
- Fix to allow box-constrained integer programs.
- Fix for GMPL integration
- Fix for readline versions
- Updates to MSVC++ version 10 files
- Addition of MSVC++ version 9 files
-
Change license to EPL.
-
Support for MSVC++ version 10 added.
-
Support for BuildTools version 0.7 to incoorporate recent enhancements, including proper library versioning in Linux, prohibiting installation of private headers, etc.
-
Enhancements to unit testing.
-
Updating externals to new stable versions of dependent projects.
-
Fixes to the shared memory parallel version (OpenMP). It is now pretty stable, though some minor memory conflict conditions may arise (infrequently).
-
Fixes to allow all applications to build and run properly.
-
Updates to documentation.
- Fixes to the build system.
- Fixes to the build system.
- Fixes to the build system.
- Major changes to the build system to allow buinding against installed binaries, provide pkg-config support, etc.
-
Fixes to restore functionality of the bicriteria solution capability.
-
Fixes to examples.
-
Updates to manual.
-
Added hooks to enable the use of VRPH (https://projects.coin-or.org/VRPH) within the VRP solver.
- Bug fix release.
- Bug fix release.
-
SYMPHONY has a preprocessor now.
-
Feasibility pump primal heuristic implemented.
-
Reliability branching is now the default branching strategy.
-
Several new statistics now part of default output.
-
Correct setting of granularity of objective function value by calculating GCD of coefficients.
-
Several changes in management of valid inequalities, quality checks and detection of duplicacy.
-
Minor changes in management of LP solver interface.
-
Several small bug-fixes and improvements.
- New dependencies.
- New dependencies.
-
Introduced use of LP hot starting.
-
Improved management of cut generation.
-
Updated externals
-
Minor bug fixes
- Minor bug fixes
-
Only a single header file (symphony.h) needs to be installed and user applications only need to be able to find this one header file.
-
Fixes to MSVC++ project files.
-
Removed dependence on qsortucb routines.
-
Added support for automatic download and build of Glpk (for reading of GMPL files).
-
Minor bugs fixed and compiler warnings eliminated.
-
Updates to MS Visual Studio files.
-
Added short installation verification test.
-
Added ability to read files in LP format.
-
Additional configuration options.
-
Support for new classes of cutting planes.
-
Improved algorithm control mechanism.
-
Improved output format and additional output options.
-
Improved signal handling.
-
Shared memory parallel version tested with OpenMP in Linux and Windows.
-
Added release configuration to MSVC++ build files.
-
Improved warm starting.
-
Fixes for configuration with SoPlex and Xpress.
-
Fixed configuration on PowerPC architectures.
-
Support for building static executables in Unix-like environments.
-
Improved signal-catching behavior in Unix-like environments.
-
Updated documentation.
-
Update of externals.
-
Updated documentation.
-
Fixes for building in the Solaris operating system.
-
Fixes for using the GNU autotools to build with the cl compiler.
-
Fixes for sym.mak file in order to allow building with MSVC++ nmake utility.
-
Fixes for building the unit test in the MSVC++ IDE.
-
Updated documentation
-
SYMPHONY now has an interactive optimizer that can be used through a command shell. In both the sequential and parallel configurations, the user can set parameters, load and solve instances interactively, and display results and statistics (see below).
-
SYMPHONY now supports automatic configuration using the new COIN-OR build system and the GNU autotools.Using autotools utilities, it is now possible to build SYMPHONY in most operating systems and with most common compilers compilers without user intervention.
-
Both the distributed and shared memory parallel configurations are now fully debugged, tested, and supported. The user can now build and execute custom SYMPHONY applications in parallel, as well as solving generic MILPs in parallel "out of the box."
-
There are now additional options for warm starting. The user can trim the warm starting tree before starting to resolve a problem. More specifically, the user can decide to initiate warm starting with a predefined partition of the final branch-and-cut tree resulting from a previous solution procedure. This partition can include either a number of nodes created first during the solution procedure or all of the nodes above a given level of the tree.
-
The COIN-OR repository, the current host of SYMPHONY has recently undergone some significant improvements of its own that have resulted in improved services to users. These include:
-
SYMPHONY has a new development Web site, where users can submit trouble tickets, browse the source code interactively, and get up-to-date information on development. The address of the new site is https://projects.coin-or.org/SYMPHONY.
-
SYMPHONY is now hosted using subversion, a version control system with features vastly improved over CVS, the previous hosting software. This has required some reorganization and renaming of the header files.
-
SYMPHONY is now more tightly integrated with other COIN-OR projects. Due to improved procedures for producing stable releases, it will now be much easier for us to determine the exact version of SYMPHONY and all other COIN projects you are using when you report a bug.
-
SYMPHONY is now distributed with all COIN software needed to build a complete solver. Previously, other COIN softrware packages had to be downloaded and installed separately.
-
-
Two features have been deprecated and are no longer supported:
-
The native interfaces to OSL and CPLEX are now deprecated and no longer supported. These solvers can be called through the COIN-OR OSI interface.
-
Column generation functionality has also been officially deprecated. For now, there are a number of other software packages that offer better functionality than SYMPHONY for implementing branch and price algorithms.
-
-
CHANGES TO THE USER INTERFACE (FROM SYMPHONY 5.0)
- There was one minor change to the user callback API from version 5.0 to
5.1. The user can now execute a primal heuristic in the
user_is_feasible() callback and return the solution to SYMPHONY. The API
for the user_is_feasible() subroutine is now
int user_is_feasible(void *user, double lpetol, int varnum, int *indices, double *values, int *feasible, double *objval, char branching, double *heur_solution)
- There was one minor change to the user callback API from version 5.0 to
5.1. The user can now execute a primal heuristic in the
user_is_feasible() callback and return the solution to SYMPHONY. The API
for the user_is_feasible() subroutine is now
Any feasible solution can be passed (in dense format) through the last argument to this function.
-
Several new subroutines were added to the callable library API.
-
The name of the header file containing the SYMPHONY API has been changed from
symphony_api.htosymphony.h(though the former has been retained for backword compatibility purposes).