Publicación:
MINIMUM COST PATH LOCATION FOR MAXIMUM TRAFFIC CAPTURE

Vista sencilla de ítem
dc.creatorCARLOS ENRIQUE OBREQUE NÍÑEZ
dc.date2010
dc.date.accessioned2025-01-10T14:44:40Z
dc.date.available2025-01-10T14:44:40Z
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 CONCEPCIÓN, CHILE.
dc.formatapplication/pdf
dc.identifier.doi10.1016/j.cie.2009.11.010
dc.identifier.issn1879-0550
dc.identifier.issn0360-8352
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/8777
dc.languagespa
dc.publisherCOMPUTERS & INDUSTRIAL ENGINEERING
dc.relation.uri10.1016/j.cie.2009.11.010
dc.rightsPUBLICADA
dc.titleMINIMUM COST PATH LOCATION FOR MAXIMUM TRAFFIC CAPTURE
dc.typeARTÍCULO
dspace.entity.typePublication
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE INGENIERIA INDUSTRIAL
ubb.SedeCONCEPCIÓN
Archivos
Colecciones
Artículos científicos