Minimum cost path location for maximum traffic capture

Simple item page
dc.contributor.authorGutierrez Jarpa, Gabriel
dc.contributor.authorDonoso, Macarena
dc.contributor.authorObreque, Carlos
dc.contributor.authorMarianov, Vladimir
dc.date.accessioned2024-01-10T13:50:37Z
dc.date.available2024-01-10T13:50:37Z
dc.date.issued2010
dc.description.abstractA 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 Concepcion, Chile. (C) 2009 Elsevier Ltd. All rights reserved.
dc.description.funderFONDECYT
dc.description.funderInstitute Complex Engineering Systems
dc.description.funderCONICYT
dc.fechaingreso.objetodigital21-03-2024
dc.format.extent10 páginas
dc.fuente.origenWOS
dc.identifier.doi10.1016/j.cie.2009.11.010
dc.identifier.eissn1879-0550
dc.identifier.issn0360-8352
dc.identifier.urihttps://doi.org/10.1016/j.cie.2009.11.010
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/79543
dc.identifier.wosidWOS:000275524100017
dc.information.autorucIngeniería;Donoso M;S/I;127877
dc.information.autorucIngeniería;Gutiérrez-Jarpa G;S/I;143925
dc.information.autorucIngeniería;Marianov V;S/I;99349
dc.issue.numero2
dc.language.isoen
dc.nota.accesocontenido parcial
dc.pagina.final341
dc.pagina.inicio332
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD
dc.revistaCOMPUTERS & INDUSTRIAL ENGINEERING
dc.rightsacceso restringido
dc.subjectNetwork design
dc.subjectCovering
dc.subjectInteger programming
dc.subjectRAPID-TRANSIT LINE
dc.subjectNETWORK DESIGN
dc.subject.ods11 Sustainable Cities and Communities
dc.subject.odspa11 Ciudades y comunidades sostenibles
dc.titleMinimum cost path location for maximum traffic capture
dc.typeartículo
dc.volumen58
sipa.codpersvinculados127877
sipa.codpersvinculados143925
sipa.codpersvinculados99349
sipa.indexWOS
sipa.indexScopus
sipa.trazabilidadCarga SIPA;09-01-2024
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2024-03-21. Minimum cost path location for maximum traffic capture.pdf
Size:
2.54 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Artículos de revistas