Welcome to the UPF Digital Repository

Variable neighborhood search for a dynamic rich vehicle routing problem with time windows

Show simple item record

dc.contributor.author De Armas, Jésica
dc.contributor.author Melián-Batista, Belén
dc.date.accessioned 2024-02-12T10:39:48Z
dc.date.available 2024-02-12T10:39:48Z
dc.date.issued 2015
dc.identifier.citation de Armas J, Melián-Batista B. Variable neighborhood search for a dynamic rich vehicle routing problem with time windows. Comput Ind Eng. 2015 Jul;85:120-31. DOI: 10.1016/j.cie.2015.03.006
dc.identifier.issn 0360-8352
dc.identifier.uri http://hdl.handle.net/10230/59083
dc.description.abstract A Dynamic Rich Vehicle Routing Problem with Time Windows has been tackled as a real-world application, in which customers requests can be either known at the beginning of the planning horizon or dynamically revealed over the day. Several real constraints, such as heterogeneous fleet of vehicles, multiple and soft time windows and customers priorities, are taken into consideration. Using exact methods is not a suitable solution for this kind of problems, given the fact that the arrival of a new request has to be followed by a quick re-optimization phase to include it into the solution at hand. Therefore, we have proposed a metaheuristic procedure based on Variable Neighborhood Search to solve this particular problem. The computational experiments reported in this work indicate that the proposed method is feasible to solve this real-world problem and competitive with the best results from the literature. Finally, it is worth mentioning that the software developed in this work has been inserted into the fleet management system of a company in Spain.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.publisher Elsevier
dc.relation.ispartof Computers & Industrial Engineering. 2015 Jul;85:120-31
dc.rights © Elsevier http://dx.doi.org/10.1016/j.cie.2015.03.006
dc.title Variable neighborhood search for a dynamic rich vehicle routing problem with time windows
dc.type info:eu-repo/semantics/article
dc.identifier.doi http://dx.doi.org/10.1016/j.cie.2015.03.006
dc.subject.keyword Dynamic rich vehicle routing problem
dc.subject.keyword Metaheuristics
dc.rights.accessRights info:eu-repo/semantics/openAccess
dc.type.version info:eu-repo/semantics/acceptedVersion

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics

In collaboration with Compliant to Partaking