SR-1: a simulation-based algorithm for the capacitated vehicle routing problem

Authors:
Javier Faulin;Miquel Gilibert;Angel A. Juan;Xavier Vilajosana;Rubén Ruiz
Affiliations:
Public University of Navarre, Pamplona, Spain;Open University of Catalonia, Barcelona, Spain;Open University of Catalonia, Barcelona, Spain;Open University of Catalonia, Barcelona, Spain;Valencia University of Technology, Valencia, Spain
Venue:
Proceedings of the 40th Conference on Winter Simulation
Year:
2008

Citing 18
Cited 4

A tabu search heuristic for the vehicle routing problem

Management Science
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
A heuristic algorithm based on Monte Carlo methods for the rural postman problem

Computers and Operations Research
Comparing descent heuristics and metaheuristics for the vehicle routing problem

Computers and Operations Research
The vehicle routing problem

The vehicle routing problem
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Simulation Modeling and Analysis

Simulation Modeling and Analysis
Software for uniform random number generation: distinguishing the good and the bad

Proceedings of the 33nd conference on Winter simulation
SavingsAnts for the Vehicle Routing Problem

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem

INFORMS Journal on Computing
D-Ants: savings based ants divide and conquer the vehicle routing problem

Computers and Operations Research
SSJ: SSJ: a framework for stochastic simulation in Java

Proceedings of the 34th conference on Winter simulation: exploring new frontiers
A Mathematical Theory of Communication

A Mathematical Theory of Communication
Big Java

Big Java
An Annotated Timeline of Operations Research: An Informal History (International Series in Operations Research & Management Science)

An Annotated Timeline of Operations Research: An Informal History (International Series in Operations Research & Management Science)
Model World: Tales from the Time Line—The Definition of OR and the Origins of Monte Carlo Simulation

Interfaces
Coca-Cola Enterprises Optimizes Vehicle Routes for Efficient Product Delivery

Interfaces
A hybrid genetic algorithm for the capacitated vehicle routing problem

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI

The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem

Applied Soft Computing
Leveraging saving-based algorithms by master-slave genetic algorithms

Engineering Applications of Artificial Intelligence
Simulation education in the internet age: some experiences on the use of pure online and blended learning models

Winter Simulation Conference
Combining probabilistic algorithms, Constraint Programming and Lagrangian Relaxation to solve the Vehicle Routing Problem

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.02

Visualization

Abstract

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.