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

In this paper an heuristic algorithm is developed. Its implementation is developedas 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 ofthe 236 routes in the study comprising a tot...

Full description

Main Authors: Gutiérrez Andrade, Miguel Ángel, de los Cobos Silva, Sergio Gerardo, Pérez Salvador, Blanca Rosa, Goddard Close, John
Format: Artículo
Language: Español
Published: 2015
Online Access: http://revistas.ucr.ac.cr/index.php/matematica/article/view/230
http://hdl.handle.net/10669/12873
Summary: In this paper an heuristic algorithm is developed. Its implementation is developedas 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 ofthe 236 routes in the study comprising a total of 8390 stops. This problem is presentedas a multicover problem subject to 236 restrictions and 8390 binary variables. Giventhat this an NP-hard problem, it was implemented an heuristic algorithm to determinethe sampling points.Keywords: Multicover problem, heuristic methods, greedy algorithms, combinatorial optimization.