El problema del multicubrimiento: una aplicación para la selección de paradas en la red de transporte de la Ciudad de México
保存先:
| 著者: | , , , |
|---|---|
| フォーマット: | 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:archivo.portal.ucr.ac.cr:article/230 |
| オンライン･アクセス: | https://archivo.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 |