Mostrar el registro sencillo del ítem

An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows

dc.contributor.authorMolina J.C.
dc.contributor.authorSalmeron J.L.
dc.contributor.authorEguia I.
dc.date.accessioned2020-09-02T22:23:06Z
dc.date.available2020-09-02T22:23:06Z
dc.date.issued2020
dc.identifier10.1016/j.eswa.2020.113379
dc.identifier.citation157, , -
dc.identifier.issn09574174
dc.identifier.urihttps://hdl.handle.net/20.500.12728/5367
dc.descriptionThis paper presents a solution methodology to solve the heterogeneous vehicle routing problem with time windows (HVRPTW). This problem appears when a limited fleet of vehicles, characterized by different capacities, fixed costs and variable costs, is available for serving a set of customers which have to be visited within a predefined time window. The objective is to perform the route design minimizing the total fixed vehicle costs and distribution costs and satisfying all problem constraints. The problem is solved using an Ant Colony System (ACS) algorithm which has been successfully applied to combinatorial optimization problems. Moreover, to improve the performance of the ACS on the HVRPTW, a hybridized ACS with local search, called memetic ACS algorithm is proposed where the local search is performed by a variable neighborhood Tabu Search algorithm. Experiments are conducted on sets of benchmark instances from the scientific literature to evaluate the performance of the proposed algorithm. The results show that the algorithm has a good performance on the HVRPTW. In particular, out of the 80 instances, it obtained 65 new best solutions and matched 6 within reasonable computational times. © 2020
dc.language.isoen
dc.publisherElsevier Ltd
dc.subjectAnt colony system
dc.subjectHeterogeneous VRPTW
dc.subjectMemetic algorithms
dc.subjectVNTS
dc.subjectAnt colony optimization
dc.subjectBenchmarking
dc.subjectCombinatorial optimization
dc.subjectCost accounting
dc.subjectFleet operations
dc.subjectRouting algorithms
dc.subjectTabu search
dc.subjectVehicle routing
dc.subjectVehicles
dc.subjectAnt colony system algorithms
dc.subjectCombinatorial optimization problems
dc.subjectDistribution costs
dc.subjectHeterogeneous vehicles
dc.subjectProblem constraints
dc.subjectScientific literature
dc.subjectSolution methodology
dc.subjectTabu search algorithms
dc.subjectConstraint satisfaction problems
dc.titleAn ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows
dc.typeArticle


Ficheros en el ítem

Thumbnail
Nombre:
item_2-s2.0-85084332015.pdf
Tamaño:
2.732Kb
Formato:
PDF
Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem