Publicación:
A HYBRID GRANULAR TABU SEARCH ALGORITHM FOR THE MULTI-DEPOT VEHICLE ROUTING PROBLEM

Vista sencilla de ítem
dc.creatorRODRIGO CARLOS EUGENIO LINFATI MEDINA
dc.date2014
dc.date.accessioned2025-01-10T14:29:35Z
dc.date.available2025-01-10T14:29:35Z
dc.date.issued2014
dc.description.abstractIN THIS PAPER, WE PROPOSE A HYBRID GRANULAR TABU SEARCH ALGORITHM TO SOLVE THE MULTI-DEPOT VEHICLE ROUTING PROBLEM (MDVRP). WE ARE GIVEN ON INPUT A SET OF IDENTICAL VEHICLES (EACH HAVING A CAPACITY AND A MAXIMUM DURATION), A SET OF DEPOTS, AND A SET OF CUSTOMERS WITH DETERMINISTIC DEMANDS AND SERVICE TIMES. THE PROBLEM CONSISTS OF DETERMINING THE ROUTES TO BE PERFORMED TO FULFILL THE DEMAND OF THE CUSTOMERS BY SATISFYING, FOR EACH ROUTE, THE ASSOCIATED CAPACITY AND MAXIMUM DURATION CONSTRAINTS. THE OBJECTIVE IS TO MINIMIZE THE SUM OF THE TRAVELING COSTS RELATED TO THE PERFORMED ROUTES. THE PROPOSED ALGORITHM IS BASED ON A HEURISTIC FRAMEWORK PREVIOUSLY INTRODUCED BY THE AUTHORS FOR THE SOLUTION OF THE CAPACITATED LOCATION ROUTING PROBLEM (CLRP). THE ALGORITHM APPLIES A HYBRID GRANULAR TABU SEARCH PROCEDURE, WHICH CONSIDERS DIFFERENT NEIGHBORHOODS AND DIVERSIFICATION STRATEGIES, TO IMPROVE THE INITIAL SOLUTION OBTAINED BY A HYBRID PROCEDURE. COMPUTATIONAL EXPERIMENTS ON BENCHMARK INSTANCES FROM THE LITERATURE SHOW THAT THE PROPOSED ALGORITHM IS ABLE TO PRODUCE, WITHIN SHORT COMPUTING TIME, SEVERAL BEST SOLUTIONS OBTAINED BY THE PREVIOUSLY PUBLISHED METHODS AND NEW BEST SOLUTIONS.
dc.formatapplication/pdf
dc.identifier.issn1572-9397
dc.identifier.issn1381-1231
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/7670
dc.languagespa
dc.publisherJOURNAL OF HEURISTICS
dc.rightsPUBLICADA
dc.titleA HYBRID GRANULAR TABU SEARCH ALGORITHM FOR THE MULTI-DEPOT VEHICLE ROUTING PROBLEM
dc.typeARTÍCULO
dspace.entity.typePublication
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE INGENIERIA INDUSTRIAL
ubb.SedeCONCEPCIÓN
Archivos
Colecciones
Artículos científicos