El problema del multicubrimiento: una aplicación para la selección de paradas en la red de transporte de la Ciudad de México

 

में बचाया:
ग्रंथसूची विवरण
लेखकों: Gutiérrez Andrade, Miguel Angel, de los Cobos Silva, Sergio Gerardo, Pérez Salvador, Blanca Rosa, Goddard Close, John
स्वरूप: artículo original
स्थिति:Versión publicada
प्रकाशन तिथि:2003
विवरण:In this paper an heuristic algorithm is developed. Its implementation is developed as well, in order to solve a sampling problem in the urban transportation network in Mexico City. The problem consist of the selection of at least 2 points (stops) on each of the 236 routes in the study comprising a total of 8390 stops. This problem is presented as a multicover problem subject to 236 restrictions and 8390 binary variables. Given that this an NP-hard problem, it was implemented an heuristic algorithm to determine the sampling points.
देश:Portal de Revistas UCR
संस्थान:Universidad de Costa Rica
Repositorio:Portal de Revistas UCR
भाषा:Español
OAI Identifier:oai:portal.ucr.ac.cr:article/230
ऑनलाइन पहुंच:https://revistas.ucr.ac.cr/index.php/matematica/article/view/230
संकेत शब्द:Multicover problem
heuristic methods
greedy algorithms
combinatorial optimization
Problema de multicubrimiento
métodos heurísticos
algoritmos glotones
optimización combinatoria