Article
Locating Two Transfer Points on a Network with a Trip Covering Criterion and Mixed Distances
Author/s | López de los Mozos Martín, María Cruz
Mesa López-Colmenar, Juan Antonio Schöbel, Anita |
Department | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) Universidad de Sevilla. Departamento de Matemática Aplicada II (ETSI) |
Publication Date | 2013 |
Deposit Date | 2019-10-28 |
Published in |
|
Abstract | In this paper we consider a set of origin-destination pairs in a mixed model in which a
network embedded in the plane represents an alternative high-speed transportation system,
and study a trip covering problem which ... In this paper we consider a set of origin-destination pairs in a mixed model in which a network embedded in the plane represents an alternative high-speed transportation system, and study a trip covering problem which consists on locating two points in the network which maximize the number of covered pairs, that is, the number of pairs which use the network by acceding and exiting through such points. To deal with the absence of convexity of this mixed distance function we propose a decomposition method based on formulating a collection of subproblems and solving each of them via discretization of the solution set. |
Project ID. | MTM2009-14243
MTM2012-37048 P09-TEP-5022 P10-FQM-5849 |
Citation | López de los Mozos Martín, M.C., Mesa López-Colmenar, J.A. y Schöbel, A. (2013). Locating Two Transfer Points on a Network with a Trip Covering Criterion and Mixed Distances. ArXiv.org, arXiv:1311.4837v1 |
Files | Size | Format | View | Description |
---|---|---|---|---|
Locating Two Transfer Points.pdf | 365.4Kb | [PDF] | View/ | |