Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments

  • Koerner, Mark-Christoph
  • Mesa, Juan A.
  • Perea Rojas Marcos, Federico
  • Schoebel, Anita
  • Scholz, Daniel
[EN] In this paper the following facility location problem in a mixed planar-network space is considered: We assume that traveling along a given network is faster than traveling within the plane according to the Euclidean distance. A pair of points (A i, A j) is called covered if the time to access the network from A i plus the time for traveling along the network plus the time for reaching A j is lower than, or equal to, a given acceptance level related to the travel time without using the network. The objective is to find facilities (i.e. entry and exit points) on the network that maximize the number of covered pairs. We present a reformulation of the problem using convex covering sets and use this formulation to derive a finite dominating set and an algorithm for locating two facilities on a tree network. Moreover, we adapt a geometric branch and bound approach to the discrete nature of the problem and suggest a procedure for locating more than two facilities on a single line, which is evaluated numerically. © 2012 Sociedad de Estadística e Investigación Operativa., This work was partially supported by the Future and Emerging Technologies Unit of EC (IST priority-6th FP), under contract no. FP6-021235-2 (project ARRIVAL), by Ministerio de Educacion, Ciencia e Innovacion (Spain)/FEDER under project MTM2009-14243 and by Junta de Andalucia (Spain)/FEDER under excellence projects P09-TEP-5022 and FQM-5849.
idUS. Depósito de Investigación de la Universidad de Sevilla
Publicación Artículo científico (JournalArticle)

A generalized model of equality measures in network location problems

  • López de los Mozos Martín, María Cruz
  • Mesa López-Colmenar, Juan Antonio
  • Puerto Albandoz, Justo
In this paper, the concept of the ordered weighted averaging operator is applied to define a model which unifies and generalizes several inequality measures. For a location x, the value of the new objective function is the ordered weighted average of the absolute deviations from the average distance from the facilities to the location x. Several kinds of networks are studied: cyclic, tree and path networks and, for each of them, the properties of the objective function are analyzed in order to identify a finite dominating set for optimal locations. Polynomial-time algorithms are proposed for these problems, and the corresponding complexity is discussed., Future and Emerging Technologies Unit (European Commission), Ministerio de Educación y Ciencia