- Title
- The network maintenance problem
- Creator
- Charkhgard, Parisa; Kalinowski, Thomas; Waterer, Hamish
- Relation
- 22nd International Congress on Modelling and Simulation (MODSIM2017). MODSIM2017: 22nd International Congress on Modelling and Simulation (Hobart, Tas. 3-8 December, 2017) p. 1302-1308
- Relation
- Funding BodyARCGrant NumberLP140101000 http://purl.org/au-research/grants/arc/LP140101000
- Relation
- https://www.mssanz.org.au/modsim2017/index.html
- Publisher
- Modelling and Simulation Society of Australia and New Zealand (MODSIM)
- Resource Type
- conference paper
- Date
- 2017
- Description
- In this research, we describe an optimization problem motivated by the need to maintain infrastructure net-works over time. We consider infrastructure networks in which product is transported between distinct origin-destination pairs, and at the same time the infrastructure assets need to be maintained by resources moving in the network. In order to perform maintenance the assets have to be shut down from time to time thus reducing the system capacity for those time periods. The objective is to maximize the total transported product by aligning the maintenance activities appropriately. This problem combines flow maximization with maintenance scheduling capturing some important aspects of the motivating practical problem: (1) the interaction between utilization of network assets such as nodes and arcs and their maintenance demands ; (2) the limited resources available to perform the maintenance ; and (3) the time for moving the maintenance resources between different locations in the network. Depending on the application context, there are a number of natural ways to reflect these in a mathematical model, and this gives rise to a rich and challenging optimization problem which we call the network maintenance problem. We formally introduce the problem, and present a mixed integer programming formulation. Next, we consider the case of a single commodity and a single maintenance resource when the network is a single path. We describe a polynomial time algorithm which, under some simplifying assumptions, solve the single path case to optimality. The problem becomes more challenging when the simplifying assumptions are dropped.
- Subject
- flow maximization; maintenance scheduling; special cases; polynomial time algorithms
- Identifier
- http://hdl.handle.net/1959.13/1385546
- Identifier
- uon:32246
- Identifier
- ISBN:9780987214379
- Language
- eng
- Full Text
- Reviewed
- Hits: 905
- Visitors: 1231
- Downloads: 205
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT02 | Publisher version (open access) | 1 MB | Adobe Acrobat PDF | View Details Download |