Publicación:
MODELING AND SOLVING THE TWO-LEVEL GENERALIZED MEDIAN TOUR PROBLEM

dc.creatorCARLOS ENRIQUE OBREQUE NÍÑEZ
dc.date2024
dc.date.accessioned2025-01-10T15:46:19Z
dc.date.available2025-01-10T15:46:19Z
dc.date.issued2024
dc.description.abstractIN MANY REAL-WORLD SITUATIONS, THE BENEFICIARIES OF A DISTRIBUTION SYSTEM MAY BE GROUPED INTO CLUSTERS, REQUIRING A TRANSPORTATION STRUCTURE TO SERVE EACH CLUSTER OF BENEFICIARIES EFFICIENTLY. FOR INSTANCE, IN PUBLIC SERVICES, SUCH AS HEALTH, EDUCATION, AND EMERGENCIES, DELIVERY TASKS RELY ON THE LOCAL AUTHORITY OF EACH DISTRICT OR CLUSTER. IN THIS CONTEXT, A TWO-LEVEL DISTRIBUTION SYSTEM NAMED THE TWO-LEVEL GENERALIZED MEDIAN TOUR PROBLEM (TLGMTP) IS INTRODUCED. THE FIRST LEVEL ADDRESSES PRODUCT DISTRIBUTION USING A SPECIALIZED VEHICLE, STARTING AND ENDING AT A DEPOT AND VISITING SOME CLUSTERS. IN THIS MANNER, PRODUCTS ARE DELIVERED TO ONE OR MORE NODES BELONGING TO THE VISITED CLUSTERS. THE SECOND LEVEL COMPRISES SMALLER VEHICLES THAT START THEIR TRIPS FROM THE NODES BELONGING TO THE FIRST LEVEL AND TRANSPORT THE PRODUCTS TO ONE OR MORE NODES LOCATED IN A NON-VISITED CLUSTER, ENSURING THAT ALL NON-VISITED CLUSTERS OF THE FIRST LEVEL ARE VISITED IN THE SECOND LEVEL. THEN, THE NON-VISITED NODES IN EACH CLUSTER MUST REACH A NODE IN THE SAME CLUSTER TO COLLECT THEIR PRODUCTS. IN THIS STUDY, WE PRESENT, MODEL, AND SOLVE THE TLGMTP TO MINIMIZE THE TOTAL TRANSPORTATION COSTS. WE DEVELOP THREE MATHEMATICAL FORMULATIONS AND SOLVE THEM USING A BRANCH-AND-CUT ALGORITHM. EXHAUSTIVE COMPUTATIONAL EXPERIMENTS INVOLVING TESTS AND REAL-WORLD INSTANCES ARE PRESENTED TO SHOW THE EFFICIENCY AND ADVANTAGES OF THE PROPOSED METHODOLOGY.
dc.formatapplication/pdf
dc.identifier.doi10.1016/j.cor.2024.106558
dc.identifier.issn1873-765X
dc.identifier.issn0305-0548
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/13582
dc.languagespa
dc.publisherCOMPUTERS AND OPERATIONS RESEARCH
dc.relation.uri10.1016/j.cor.2024.106558
dc.rightsPUBLICADA
dc.subjectTwo-level distribution system
dc.subjectNetwork design
dc.subjectCombinatorial optimization
dc.subjectBranch-and-cut
dc.titleMODELING AND SOLVING THE TWO-LEVEL GENERALIZED MEDIAN TOUR PROBLEM
dc.typeARTÍCULO
dspace.entity.typePublication
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE INGENIERIA INDUSTRIAL
ubb.SedeCONCEPCIÓN
Archivos