TY - JOUR
T1 - Minimum cost path location for maximum traffic capture
AU - Gutiérrez-Jarpa, Gabriel
AU - Donoso, Macarena
AU - Obreque, Carlos
AU - Marianov, Vladimir
N1 - Funding Information:
The authors gratefully acknowledge the partial support provided by FONDECYT, Project Nr. 1070741, as well as the support provided by the Institute Complex Engineering Systems, through Grants ICM-MIDEPLAN P-05-004-F and CONICYT FBO16.
PY - 2010/3
Y1 - 2010/3
N2 - A free path (with no preset extreme nodes) is located on a network, in such a way as to minimize the cost and maximize the traffic captured by the path. Traffic between a pair of nodes is captured if both nodes are visited by the path. Applications are the design of the route and locations of mailboxes for a local package delivery company, or the design of bus or subway lines, in which the shape of the route and the number of stops is determined by the solution of the optimization problem. The problem also applies to the design of an optical fiber network interconnecting WiFi antennas in a university campus. We propose two models and an exact solution method. Computational experience is presented for up to 300 nodes and 1772 arcs, as well as a practical case for the city of Concepción, Chile.
AB - A free path (with no preset extreme nodes) is located on a network, in such a way as to minimize the cost and maximize the traffic captured by the path. Traffic between a pair of nodes is captured if both nodes are visited by the path. Applications are the design of the route and locations of mailboxes for a local package delivery company, or the design of bus or subway lines, in which the shape of the route and the number of stops is determined by the solution of the optimization problem. The problem also applies to the design of an optical fiber network interconnecting WiFi antennas in a university campus. We propose two models and an exact solution method. Computational experience is presented for up to 300 nodes and 1772 arcs, as well as a practical case for the city of Concepción, Chile.
KW - Covering
KW - Integer programming
KW - Network design
UR - http://www.scopus.com/inward/record.url?scp=76349095130&partnerID=8YFLogxK
U2 - 10.1016/j.cie.2009.11.010
DO - 10.1016/j.cie.2009.11.010
M3 - Article
AN - SCOPUS:76349095130
VL - 58
SP - 332
EP - 341
JO - Computers and Industrial Engineering
JF - Computers and Industrial Engineering
SN - 0360-8352
IS - 2
ER -