The NDSG makeover
Document Actions
Research Project: Optimal Storage Network Design with Bcp
Back to Research Field: Step 3: Design the Network
| Optimal Storage Network Design with Bcp | |
|
Abstract: This research project involves designing general storage networks using Bcp.
Keywords: |
|
| Research Project Information | |
|
Runtime:
Since
2007-01-01
Contact:
Mike O'Sullivan
Project coordination:
NDSG
Scientific staff:
Mike O'Sullivan; Cameron Walker
Cooperation partner(s):
ITS, University of Auckland, New Zealand
|
|
Publications = None
Bcp is a Branch, cut and price package for solving integer programming problems. Bcp is part of the COIN-OR project (an open source Operations Research project). This research project models the general network design problem as an integer programme (IP). It follows on from an earlier project that solved the network design IP using AMPL/CPLEX, but using the greater flexibility of Bcp we hope to incorporate advanced cut generation and column generation methods.
For more information on this project visit the NDSG Community Wiki on the BeSTGRID Sakai Site, and navigate to
Home > Storage Network Design : Engineering Science
Further information on this research project in the WWW:
Project Structure
|
Departments involved in this research project: