Volume
OASIcs, Volume 22
3rd Student Conference on Operational Research
- Part of: Series: Open Access Series in Informatics (OASIcs)
Event
SCOR 2012, April 20-22, 2012, Nottingham, UKEditors
Publication Details
- published at: 2012-06-26
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-939897-39-2
- DBLP: db/conf/scor/scor2012
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Volume
OASIcs, Volume 22, SCOR'12, Complete Volume
Abstract
OASIcs, Volume 22, SCOR'12, Complete Volume
Cite as
3rd Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@Proceedings{ravizza_et_al:OASIcs.SCOR.2012,
title = {{OASIcs, Volume 22, SCOR'12, Complete Volume}},
booktitle = {3rd Student Conference on Operational Research},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-39-2},
ISSN = {2190-6807},
year = {2012},
volume = {22},
editor = {Ravizza, Stefan and Holborn, Penny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012},
URN = {urn:nbn:de:0030-drops-35840},
doi = {10.4230/OASIcs.SCOR.2012},
annote = {Keywords: Optimization, Combinatorics, Graph Theory, Applications, Artificial Intelligence, Simulation and Modeling}
}
Document
Front Matter
Frontmatter, Table of Contents, Preface, Conference Organisation
Abstract
Frontmatter, Table of Contents, Preface, Conference Organisation
Cite as
3rd Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 22, pp. i-ix, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@InProceedings{ravizza_et_al:OASIcs.SCOR.2012.i,
author = {Ravizza, Stefan and Holborn, Penny},
title = {{Frontmatter, Table of Contents, Preface, Conference Organisation}},
booktitle = {3rd Student Conference on Operational Research},
pages = {i--ix},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-39-2},
ISSN = {2190-6807},
year = {2012},
volume = {22},
editor = {Ravizza, Stefan and Holborn, Penny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.i},
URN = {urn:nbn:de:0030-drops-35402},
doi = {10.4230/OASIcs.SCOR.2012.i},
annote = {Keywords: Frontmatter, Table of Contents, Preface, Conference Organisation}
}
Document
A Case Study on Optimizing Toll Enforcements on Motorways
Abstract
In this paper we present the problem of computing optimal tours of toll inspectors on German motorways. This problem is a special type of vehicle routing problem and builds up an integrated model, consisting of a tour planning and a duty rostering part. The tours should guarantee a network-wide control whose intensity is proportional to given spatial and time dependent traffic distributions. We model this using a space-time network and formulate the associated optimization problem by an integer program (IP). Since sequential approaches fail, we integrated the assignment of crews to the tours in our model. In this process all duties of a crew member must fit in a feasible roster. It is modeled as a Multi-Commodity Flow Problem in a directed acyclic graph, where specific paths correspond to feasible rosters for one month. We present computational results in a case-study on a German subnetwork which documents the practicability of our approach.
Cite as
Ralf Borndörfer, Guillaume Sagnol, and Elmar Swarat. A Case Study on Optimizing Toll Enforcements on Motorways. In 3rd Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 22, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@InProceedings{borndorfer_et_al:OASIcs.SCOR.2012.1,
author = {Bornd\"{o}rfer, Ralf and Sagnol, Guillaume and Swarat, Elmar},
title = {{A Case Study on Optimizing Toll Enforcements on Motorways}},
booktitle = {3rd Student Conference on Operational Research},
pages = {1--10},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-39-2},
ISSN = {2190-6807},
year = {2012},
volume = {22},
editor = {Ravizza, Stefan and Holborn, Penny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.1},
URN = {urn:nbn:de:0030-drops-35418},
doi = {10.4230/OASIcs.SCOR.2012.1},
annote = {Keywords: Vehicle Routing Problem, Duty Rostering, Integer Programming, Operations Research}
}
Document
Revenue maximization through dynamic pricing under unknown market behaviour
Abstract
We consider the scenario of a multimodal memoryless market to sell one product, where a customer’s probability to actually buy the product depends on the price. We would like to set the price for each customer in a way that maximizes our overall revenue. In this case, an exploration vs. exploitation problem arises. If we explore customer responses to different prices, we get a pretty good idea of what customers are willing to pay. On the other hand, this comes at the cost of losing a customer (when we set the price too high) or selling the product too cheap (when we set the price too low). The goal is to infer the true underlying probability curve as a function of the price (market behaviour) while maximizing the revenue at the same time. This paper focuses on learning the underlying market characteristics with as few data samples as possible by exploiting the knowledge gained from both exploring potentially profitable areas with high uncertainty and optimizing the trade-off between knowledge gained and revenue exploitation. The response variable being binary by nature, classification methods such as logistic regression and Gaussian processes are explored. Two new policies adapted to non parametric inference models are presented, one based on the efficient global optimization (EGO) algorithm and the second based on a dynamic programming approach. Series of simulations of the evolution of the proposed model are finally presented to summarize the achieved performance of the policies.
Cite as
Sergio Morales-Enciso and Jürgen Branke. Revenue maximization through dynamic pricing under unknown market behaviour. In 3rd Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 22, pp. 11-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@InProceedings{moralesenciso_et_al:OASIcs.SCOR.2012.11,
author = {Morales-Enciso, Sergio and Branke, J\"{u}rgen},
title = {{Revenue maximization through dynamic pricing under unknown market behaviour}},
booktitle = {3rd Student Conference on Operational Research},
pages = {11--20},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-39-2},
ISSN = {2190-6807},
year = {2012},
volume = {22},
editor = {Ravizza, Stefan and Holborn, Penny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.11},
URN = {urn:nbn:de:0030-drops-35426},
doi = {10.4230/OASIcs.SCOR.2012.11},
annote = {Keywords: Dynamic pricing, revenue management, EGO, Gaussian processes for classification}
}
Document
Empirical Bayes Methods for Discrete Event Simulation Performance Measure Estimation
Abstract
Discrete event simulation (DES) is a widely-used operational research methodology facilitating the analysis of complex real-world systems. Although, generally speaking, simplicity is greatly desirable in DES modelling applications, in many cases the nature of the underlying system results in simulation models which are large in scale, complex, and expensive to run. As such, the careful design and analysis of simulation experiments is essential to ensure valid and efficient inference concerning DES model performance measures. It is envisaged that empirical Bayes (EB) methods, which enable data to be pooled across a set of populations to support inference of the parameters of a single population, may be of use within this context. Despite this potential, EB has so far been neglected within the DES literature. This paper presents a preliminary computational investigation into the efficacy of EB procedures in the estimation of DES performance measures. The results of this investigation, and their significance, are explored. Additionally, likely directions for future research are also addressed.
Cite as
Shona Blair, Tim Bedford, and John Quigley. Empirical Bayes Methods for Discrete Event Simulation Performance Measure Estimation. In 3rd Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 22, pp. 21-30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@InProceedings{blair_et_al:OASIcs.SCOR.2012.21,
author = {Blair, Shona and Bedford, Tim and Quigley, John},
title = {{Empirical Bayes Methods for Discrete Event Simulation Performance Measure Estimation}},
booktitle = {3rd Student Conference on Operational Research},
pages = {21--30},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-39-2},
ISSN = {2190-6807},
year = {2012},
volume = {22},
editor = {Ravizza, Stefan and Holborn, Penny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.21},
URN = {urn:nbn:de:0030-drops-35436},
doi = {10.4230/OASIcs.SCOR.2012.21},
annote = {Keywords: Discrete Event Simulation, Analysis Methodology, Empirical Bayes}
}
Document
The Transition to an Energy Sufficient Economy
Abstract
Nigeria is an energy-rich nation with a huge energy resource base. The country is the largest reserves holder and largest producer of oil and gas in the African continent. Despite this, only about 40% of its 158 million people have access to modern energy services. Around 80% of its rural population depend on traditional biomass. This paper presents an overview of ongoing research to examine energy policies in Nigeria. The aims are: 1) to identify and quantify the barriers to sustainable energy development and 2) to provide an integrated tool to aid energy policy evaluation and planning. System dynamics modelling is shown to be a useful tool to map the interrelations between critical energy variables with other key sectors of the economy, and for understanding the energy use dynamics (impact on society and the environment). It is found that the critical factors are burgeoning population, lack of capacity utilisation, and inadequate energy investments. Others are lack of suitably trained manpower, weak institutional frameworks, and inconsistencies in energy policies. These remain the key barriers hampering Nigeria's smooth transition from energy poverty to an energy sufficient economy.
Cite as
Timothy S. Mbasuen and Richard C. Darton. The Transition to an Energy Sufficient Economy. In 3rd Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 22, pp. 31-42, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@InProceedings{mbasuen_et_al:OASIcs.SCOR.2012.31,
author = {Mbasuen, Timothy S. and Darton, Richard C.},
title = {{The Transition to an Energy Sufficient Economy}},
booktitle = {3rd Student Conference on Operational Research},
pages = {31--42},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-39-2},
ISSN = {2190-6807},
year = {2012},
volume = {22},
editor = {Ravizza, Stefan and Holborn, Penny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.31},
URN = {urn:nbn:de:0030-drops-35445},
doi = {10.4230/OASIcs.SCOR.2012.31},
annote = {Keywords: energy sufficiency, energy policy, policy evaluation, economic planning, modelling}
}
Document
Can online trading algorithms beat the market? An experimental evaluation
Abstract
From experimental evaluation, we reasonably infer that online trading algorithms can beat the market. We consider the scenario of trading in financial market and present an extensive experimental study to answer the question "Can online trading algorithms beat the market?". We evaluate the selected set of online trading algorithms on DAX30 and measure the performance against buy-and-hold strategy. In order to compute the experimentally achieved competitive ratio, we also compare the set of algorithms against an optimum offline algorithm. To add further dimensionality into experimental setup, we use trading periods of various lengths and apply a number of evaluation criteria (such as annualized geometric returns, average period returns and experimentally achieved competitive ratio) to measure the performance of algorithms in short vs. Long term investment decisions. We highlight the best and worst performing algorithms and discuss the possible reasons for the performance behavior of algorithms.
Cite as
Javeria Iqbal, Iftikhar Ahmad, and Günter Schmidt. Can online trading algorithms beat the market? An experimental evaluation. In 3rd Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 22, pp. 43-52, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@InProceedings{iqbal_et_al:OASIcs.SCOR.2012.43,
author = {Iqbal, Javeria and Ahmad, Iftikhar and Schmidt, G\"{u}nter},
title = {{Can online trading algorithms beat the market? An experimental evaluation}},
booktitle = {3rd Student Conference on Operational Research},
pages = {43--52},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-39-2},
ISSN = {2190-6807},
year = {2012},
volume = {22},
editor = {Ravizza, Stefan and Holborn, Penny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.43},
URN = {urn:nbn:de:0030-drops-35455},
doi = {10.4230/OASIcs.SCOR.2012.43},
annote = {Keywords: Online Algorithms, Experimental Evaluation, Competitive Analysis}
}
Document
An exact algorithm for the uncertain version of parallel machines scheduling problem with the total completion time criterion
Abstract
An uncertain version of parallel and identical machines scheduling problem with total completion time criterion is considered. It is assumed that the execution times of tasks are not known a priori but they belong to the intervals of known bounds. The absolute regret based approach for coping with such an uncertainty is applied. This problem is known to be NP-hard and a branch and bound algorithm (B&B) for finding the exact solution is developed. The results of computational experiments show that for the tested instances of the uncertain problem — B&B works significantly faster than the exact procedure based on enumeration of all the solutions. The algorithm proposed has application for further research of quality evaluation for heuristic and approximate solution approaches for the considered problem (in order to check how far from the optimality are solutions generated by them) and also in the cases where the requirement is to obtain the exact solutions for the uncertain problem.
Cite as
Marcin Siepak. An exact algorithm for the uncertain version of parallel machines scheduling problem with the total completion time criterion. In 3rd Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 22, pp. 53-63, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@InProceedings{siepak:OASIcs.SCOR.2012.53,
author = {Siepak, Marcin},
title = {{An exact algorithm for the uncertain version of parallel machines scheduling problem with the total completion time criterion}},
booktitle = {3rd Student Conference on Operational Research},
pages = {53--63},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-39-2},
ISSN = {2190-6807},
year = {2012},
volume = {22},
editor = {Ravizza, Stefan and Holborn, Penny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.53},
URN = {urn:nbn:de:0030-drops-35469},
doi = {10.4230/OASIcs.SCOR.2012.53},
annote = {Keywords: Task scheduling, Interval uncertainty, Minmax regret, Branch and Bound}
}
Document
Product Form of the Inverse Revisited
Abstract
Using the simplex method (SM) is one of the most effective ways of solving large scale real life linear optimization problems. The efficiency of the solver is crucial. The SM is an iterative procedure, where each iteration is defined by a basis of the constraint set. In order to speed up iterations, proper basis handling procedures must be applied.
Two methodologies exist in the state-of-the-art literature, the product form of the inverse (PFI) and lower-upper triangular (LU) factorization. Nowadays the LU method is widely used because 120-150 iterations can be done without the need of refactorization while the PFI can make only about 30-60 iterations without reinversion in order to maintain acceptable numerical accuracy.
In this paper we revisit the PFI and present a new version that can make hundreds or sometimes even few thousands of iterations without losing accuracy. The novelty of our approach is in the processing of the non-triangular part of the basis, based on block-triangularization algorithms. The new PFI performs much better than those found in the literature. The results can shed new light on the usefulness of the PFI.
Cite as
Péter Tar and István Maros. Product Form of the Inverse Revisited. In 3rd Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 22, pp. 64-74, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@InProceedings{tar_et_al:OASIcs.SCOR.2012.64,
author = {Tar, P\'{e}ter and Maros, Istv\'{a}n},
title = {{Product Form of the Inverse Revisited}},
booktitle = {3rd Student Conference on Operational Research},
pages = {64--74},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-39-2},
ISSN = {2190-6807},
year = {2012},
volume = {22},
editor = {Ravizza, Stefan and Holborn, Penny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.64},
URN = {urn:nbn:de:0030-drops-35475},
doi = {10.4230/OASIcs.SCOR.2012.64},
annote = {Keywords: Linear optimization, Simplex method, Basis inverse, Product form of the inverse}
}
Document
The design of transportation networks: a multi objective model combining equity, efficiency and efficacy
Abstract
A network design problem consists in locating facilities (nodes and arcs) that enable the transfer of flows (passengers and/or goods) from given origin-destination pairs. The topic can have several applications within transportation and logistics contexts. In this work we propose a multi-objective model in which balancing or equity aspects, i.e. measures of the distribution of distances of users from the path, are considered. These kinds of models can be used when there is the need to balance risks or benefits among all the potential users deriving from the location of the path to be designed. The application of the proposed model to a benchmark problem used in the literature to test these kinds of models, shows that it is able to find solutions characterized by significant level of equity but also of efficiency and efficacy.
Cite as
Maria Barbati. The design of transportation networks: a multi objective model combining equity, efficiency and efficacy. In 3rd Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 22, pp. 75-83, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@InProceedings{barbati:OASIcs.SCOR.2012.75,
author = {Barbati, Maria},
title = {{The design of transportation networks: a multi objective model combining equity, efficiency and efficacy}},
booktitle = {3rd Student Conference on Operational Research},
pages = {75--83},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-39-2},
ISSN = {2190-6807},
year = {2012},
volume = {22},
editor = {Ravizza, Stefan and Holborn, Penny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.75},
URN = {urn:nbn:de:0030-drops-35484},
doi = {10.4230/OASIcs.SCOR.2012.75},
annote = {Keywords: Graphs/Network, Transportation, Multi criteria Decision Analysis}
}
Document
Heuristics for the routing of trucks with double container loads
Abstract
This research addresses a problem motivated by a real case study. A carrier must plan the routes of trucks in order to serve importers and exporters. What is original in this vehicle routing problem is the impossibility to separate trucks and containers during customer service and the opportunity to carry up to two containers per truck. Customers may demand more than one container and may be visited more than once. Moreover, according to the carrier’s policy, importers must be served before exporters. In order to address this Vehicle Routing Problem with backhaul and splits, a linear integer programming model is proposed. This research aims to show to what extent an exact algorithm of a state of the art solver can be used to solve this model. Moreover, since some instances are too difficult to solve for the exact algorithm, a number of heuristics is proposed and compared to this algorithm. Finally, the heuristics are compared to the real decisions of the carrier who has motivated this problem.
Cite as
Michela Lai, Massimo Di Francesco, and Paola Zuddas. Heuristics for the routing of trucks with double container loads. In 3rd Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 22, pp. 84-93, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@InProceedings{lai_et_al:OASIcs.SCOR.2012.84,
author = {Lai, Michela and Di Francesco, Massimo and Zuddas, Paola},
title = {{Heuristics for the routing of trucks with double container loads}},
booktitle = {3rd Student Conference on Operational Research},
pages = {84--93},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-39-2},
ISSN = {2190-6807},
year = {2012},
volume = {22},
editor = {Ravizza, Stefan and Holborn, Penny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.84},
URN = {urn:nbn:de:0030-drops-35499},
doi = {10.4230/OASIcs.SCOR.2012.84},
annote = {Keywords: Split Vehicle Routing Problem, Backhaul, Drayage, Container transportation, Heuristics}
}
Document
Optimization of electricity trading using linear programming
Abstract
In the last two decades, the liberalization of the electricity markets have been established in order to increase efficiency, harmonize and reduce electricity prices, make a better use of resources, give customers the right to choose their supplier and provide customers with a better service. This change made the electricity market competitive and introduced several new subjects. In this paper, we study one of these subjects: Electricity Trading Company (ETC) and its daily trading process. We present a linear mathematical model of total daily profit maximization subject to flow constraints. It is assumed that the demand and supply are known and some of them are arranged. Possible transmission capacities are known but also additional capacities can be purchased. All trading, transmission prices and amounts are subject of auctions. First, we present energy trading problem as directed multiple-source and multiple-sink network and then model it using linear programming. Also, we provide one realistic example which is slightly changed in order to save confidentiality of the given data.
Cite as
Minja R. Marinovic, Dragana D. Makajic-Nikolic, Milan J. Stanojevic, and Lena S. Dordevic. Optimization of electricity trading using linear programming. In 3rd Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 22, pp. 94-102, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@InProceedings{marinovic_et_al:OASIcs.SCOR.2012.94,
author = {Marinovic, Minja R. and Makajic-Nikolic, Dragana D. and Stanojevic, Milan J. and Dordevic, Lena S.},
title = {{Optimization of electricity trading using linear programming}},
booktitle = {3rd Student Conference on Operational Research},
pages = {94--102},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-39-2},
ISSN = {2190-6807},
year = {2012},
volume = {22},
editor = {Ravizza, Stefan and Holborn, Penny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.94},
URN = {urn:nbn:de:0030-drops-35505},
doi = {10.4230/OASIcs.SCOR.2012.94},
annote = {Keywords: energy daily trading, day-ahead planning, LP model, optimization}
}
Document
A Bilevel Mixed Integer Linear Programming Model for Valves Location in Water Distribution Systems
Abstract
The positioning of valves on the pipes of a Water Distribution System (WDS) is a core decision in the design of the isolation system of a WDS. When closed, valves permit to isolate a small portion of the network, so called a sector, which can be de-watered for maintenance purposes at the cost of a supply disruption. However, valves have a cost so their number is limited, and their position must be chosen carefully in order to minimize the worst-case supply disruption which may occur during pipe maintenance. Supply disruption is usually measured as the undelivered user demand. When a sector is isolated by closing its boundary valves, other portions of the network may become disconnected from the reservoirs as a secondary effect, and experience supply disruption as well. This induced isolation must be taken into account when computing the undelivered demand induced by a sector isolation. While sector topology can be described in terms of graph partitioning, accounting for induced undelivered demand requires network flow modeling. The aim of the problem is to locate a given number of valves at the extremes of the network pipes so that the maximum supply disruption is minimized. We present a Bilevel Mixed Integer Linear Programming (MILP) model for this problem and show how to reduce it to a single level MILP by exploiting duality. Computational results on a real case study are presented, showing the effectiveness of the approach.
Cite as
Andrea Peano, Maddalena Nonato, Marco Gavanelli, Stefano Alvisi, and Marco Franchini. A Bilevel Mixed Integer Linear Programming Model for Valves Location in Water Distribution Systems. In 3rd Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 22, pp. 103-112, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@InProceedings{peano_et_al:OASIcs.SCOR.2012.103,
author = {Peano, Andrea and Nonato, Maddalena and Gavanelli, Marco and Alvisi, Stefano and Franchini, Marco},
title = {{A Bilevel Mixed Integer Linear Programming Model for Valves Location in Water Distribution Systems}},
booktitle = {3rd Student Conference on Operational Research},
pages = {103--112},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-39-2},
ISSN = {2190-6807},
year = {2012},
volume = {22},
editor = {Ravizza, Stefan and Holborn, Penny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.103},
URN = {urn:nbn:de:0030-drops-35519},
doi = {10.4230/OASIcs.SCOR.2012.103},
annote = {Keywords: Isolation Valves Positioning, Bilevel Programming, Hydroinformatics}
}