EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1296. Upgrading arcs in the covering tour problem
Invited abstract in session WA-12: YW4OR_1, stream WISDOM - Women in OR.
Wednesday, 8:30-10:00Room: 13 (building: 116)
Authors (first author is the speaker)
1. | Marta Baldomero-Naranjo
|
Estadística e Investigación Operativa, Universidad de Cádiz | |
2. | Andrea Mancuso
|
Department of Political Sciences, University Federico II of Naples | |
3. | Adriano Masone
|
Department of Electrical Engineering and Information Technology, University "Federico II" of Naples | |
4. | Antonio Manuel Rodriguez-Chia
|
Estadistica e IO, Universidad de Cádiz | |
5. | Claudio Sterle
|
Department of Electrical Engineering and Information Technology, Università Federico II di Napoli |
Abstract
In this study, we present the Covering Tour Problem with Arcs Upgrade (CTPAU). This problem is an extension of the Covering Tour Problem (CTP) that considers the possibility of enhancing the network by reducing the length of some arcs, i.e., upgrading them. Hence, upgrading an arc means reducing its length, usually within certain limits, at a given cost that is proportional to the extent of the upgrade.
The CTPAU is formulated with three different sets of nodes, V, W, and, T that is a subset of V. Two decisions have to be made simultaneously: i) identify the tour of minimum length that passes through a subset of V, ensuring that all nodes of set T are included in the tour, and that each node in W is within a given coverage distance from a node on the tour, ii) decide with connections to upgrade.
Therefore, the CTPAU seeks to identify the minimum length tour while integrating arc upgrading and a budget constraint. In this context, we present some MILP formulation and compare them to illustrate the potential and limitations of each one.
Keywords
- Vehicle Routing
- Graphs and Networks
- Mathematical Programming
Status: accepted
Back to the list of papers