Mostra el registre d'ítem simple
Combining biased randomization with meta-heuristics for solving the multi-depot vehicle routing problem
dc.contributor.author | Juan Pérez, Angel Alejandro |
dc.contributor.author | Barrios, Barry |
dc.contributor.author | González Martín, Sergio |
dc.contributor.author | Coccola, Mariana |
dc.contributor.author | Faulín, Javier |
dc.contributor.author | Bektas, Tolga |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I |
dc.date.accessioned | 2013-01-22T10:45:28Z |
dc.date.created | 2012 |
dc.date.issued | 2012 |
dc.identifier.citation | Juan, A. [et al.]. Combining biased randomization with meta-heuristics for solving the multi-depot vehicle routing problem. A: Winter Simulation Conference. "Proceedings of the 2012 Winter Simulation Conference". Berlín: 2012, p. 1-2. |
dc.identifier.isbn | 978-1-4673-4781-5 |
dc.identifier.uri | http://hdl.handle.net/2117/17468 |
dc.description.abstract | This paper proposes a hybrid algorithm, combining Biased-Randomized (BR) processes with an Iterated Local Search (ILS) meta-heuristic, to solve the Multi-Depot Vehicle Routing Problem (MDVRP). Our approach assumes a scenario in which each depot has unlimited service capacity and in which all vehicles are identical (homogeneous fleet). During the routing process, however, each vehicle is assumed to have a limited capacity. Two BR processes are employed at different stages of the ILS procedure in order to: (a) define the perturbation operator, which generates new ‘assignment maps’ by associating customers to depots in a biased-random way –according to a distance-based criterion; and (b) generate ‘good’ routing solutions for each customers-depots assignment map. These biased-randomization processes rely on the use of a pseudo-geometric probability distribution. Our approach does not need from fine-tuning processes which usually are complex and time consuming. Some preliminary tests have been carried out already with encouraging results. |
dc.format.extent | 2 p. |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Probabilitat |
dc.subject.lcsh | Probabilities |
dc.subject.lcsh | Machine theory |
dc.title | Combining biased randomization with meta-heuristics for solving the multi-depot vehicle routing problem |
dc.type | Conference lecture |
dc.subject.lemac | Probabilitats |
dc.subject.lemac | Màquines, Teoria de |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 11158480 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Juan, A.; Barrios, B.; González-Martín, S.; Coccola, M.; Faulín, J.; Bektas, T. |
local.citation.contributor | Winter Simulation Conference |
local.citation.pubplace | Berlín |
local.citation.publicationName | Proceedings of the 2012 Winter Simulation Conference |
local.citation.startingPage | 1 |
local.citation.endingPage | 2 |