Mostra el registre d'ítem simple
A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem
dc.contributor.author | Archetti, Claudia |
dc.contributor.author | Fernández Aréizaga, Elena |
dc.contributor.author | Huerta Muñoz, Diana Lucia |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa |
dc.date.accessioned | 2018-10-30T10:10:31Z |
dc.date.available | 2021-11-30T01:35:19Z |
dc.date.issued | 2018-11-01 |
dc.identifier.citation | Archetti, C., Fernandez, E., Huerta, D. A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem. "Computers & operations research", 1 Novembre 2018, vol. 99, p. 27-37. |
dc.identifier.issn | 0305-0548 |
dc.identifier.uri | http://hdl.handle.net/2117/123216 |
dc.description.abstract | The Flexible Periodic Vehicle Routing Problem is the problem of visiting a given set of customers considering a certain periodicity to attend their demands. It is a generalization of the Periodic Vehicle Routing Problem where the fixed schedule constraint is relaxed and the quantity to deliver to each customer at each visit is a decision variable. This flexibility leads to remarkable savings in total costs and this explains the interest in studying the problem and developing effective solution approaches. In this work, an iterative two-phase matheuristic is developed to solve medium and large instances of the problem. Computational tests are made on benchmark instances and on newly generated instances. The results of the matheuristic are compared to the best-known solutions, on small-size instances, and to lower bounds on larger instances. Computational results show that good quality solutions are obtained in a reasonable amount of time. |
dc.format.extent | 11 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Probabilitat |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica |
dc.subject.lcsh | Combinatorial probabilities |
dc.subject.lcsh | Numerical analysis--Simulation methods |
dc.subject.other | Flexible periodic vehicle routing |
dc.subject.other | Matheuristic |
dc.subject.other | Service frequency |
dc.title | A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem |
dc.type | Article |
dc.subject.lemac | Probabilitats |
dc.subject.lemac | Anàlisi numèrica |
dc.contributor.group | Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització |
dc.identifier.doi | 10.1016/j.cor.2018.05.021 |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::60 Probability theory and stochastic processes::60C05 Combinatorial probability |
dc.subject.ams | Classificació AMS::65 Numerical analysis::65C Probabilistic methods, simulation and stochastic differential equations |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S0305054818301448 |
dc.rights.access | Open Access |
local.identifier.drac | 23239354 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Archetti, C.; Fernandez, E.; Huerta, D. |
local.citation.publicationName | Computers & operations research |
local.citation.volume | 99 |
local.citation.startingPage | 27 |
local.citation.endingPage | 37 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [104]
-
Articles de revista [712]