- Title
- The network maintenance problem on an arc with uncapacitated repair
- Creator
- Charkhgard, P.; Kalinowski, T.; Waterer, H.
- Relation
- 23rd International Congress on Modelling and Simulation (MODSIM2019). Proceedings of MODSIM2019, 23rd International Congress on Modelling and Simulation (Canberra, ACT 1-6 December, 2019) p. 305-311
- Relation
- ARC.LP140101000 http://purl.org/au-research/grants/arc/LP140101000
- Publisher Link
- http://dx.doi.org/10.36334/modsim.2019.b6.charkhgard
- Publisher
- Modelling and Simulation Society of Australia and New Zealand
- Resource Type
- conference paper
- Date
- 2019
- Description
- The network maintenance problem is motivated by the need to maintain infrastructure networks over time. We consider networks in which a commodity is transported between 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 thus reducing the system capacity. The objective is to maximise the total throughput by aligning the maintenance activities efficiently. In this paper, we study a special case of the network maintenance problem where the network consists of a single arc connecting an origin to a destination. Furthermore, there is no restriction on the amount of repair if the resource is to perform maintenance in a time period. This problem is of interest for the following reasons. Firstly, it generalises variants of the lot-sizing problem and the warehouse problem, both of which have been well-studied in the literature. Secondly, we hope that understanding this special case will be useful in tackling more general variants of the network maintenance problem. In this paper, we present a mixed integer linear programming formulation. We then show that a special class of feasible solutions, called Maximum Flow Order Up (MFOU) solutions, contains at least one optimal solution. Based on this result, we introduce an alternative integer linear programming formulation with only five decision variables. As a consequence, the optimal objective function value for any instance of the problem can be obtained in polynomial time.
- Subject
- network maintenance; mixed integer linear programming; scheduling; polynomial time; SDG 9; Sustainable Development Goals
- Identifier
- http://hdl.handle.net/1959.13/1474263
- Identifier
- uon:49252
- Identifier
- ISBN:9780975840092
- Language
- eng
- Reviewed
- Hits: 804
- Visitors: 803
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|