2026-04-13T00:52:51Zhttps://recercat.cat/oai/request

oai:recercat.cat:2072/3488852024-12-13T09:49:40Zcom_2072_228903com_2072_96873com_2072_96852com_2072_2015col_2072_228904

00925njm 22002777a 4500 dc Faulin Fajardo, Francisco Javier author Gilibert Sunyé, Miquel author Juan Pérez, Ángel Alejandro author Vilajosana i Guillén, Xavier author Ruiz, Rubén author In this paper we present SR-1, a simulation-based heuristic algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, SR-1 uses an initial "good solution", such as the one provided by the classical Clarke and Wright heuristic, in order to obtain observations for the variable "distance between two consecutive nodes in a route". These observations are then fitted by a statistical distribution, which characterizes the inter-node distances in good solutions. Then, the fitted distribution is employed to generate a large number of new random solutions with similar edge-size distribution. Thus, a random but oriented local search of the space of solutions is performed, and a list of "best solutions" is obtained. This list allows considering several properties per solution, not only aprioristic costs, which can be practically used when making multiple-criteria decisions. Several tests have been performed to discuss the effectiveness of this approach. Faulín Fajardo, F., Gilibert Sunyé, M., Juan, A.A., Vilajosana Guillen, X. & Ruiz, R. (2008). SR-1: A simulation-based algorithm for the capacitated vehicle routing problem. Winter Simulation Conference (WSC). Proceedings, 2008(), 2.708-2.716. doi: 10.1109/WSC.2008.4736388 9781424427079 0891-7736 10.1109/WSC.2008.4736388 http://hdl.handle.net/10609/90867 vehicle routing heuristic algorithm performance evaluation ruta para vehículos algoritmo heurístico evaluación del rendimiento ruta per a vehicles algorisme heurístic avaluació del rendiment Computer algorithms Algorismes computacionals Algoritmos computacionales SR-1: A simulation-based algorithm for the capacitated vehicle routing problem