SciELO - Scientific Electronic Library Online

 
vol.23 issue2A Genetic Algorithm for the Resource Constrained Project Scheduling ProblemA comparative analysis of the Markowitz and Konno portfolio selection models author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Investigação Operacional

Print version ISSN 0874-5161

Abstract

SCHUTZ, G.  and  PIRES, F. M.. A Genetic Based Approach to the Vehicle Routing Problem. Inv. Op. [online]. 2003, vol.23, n.2, pp.197-209. ISSN 0874-5161.

In its basic form the vehicle routing problem (VRP) consists of serving a set of clients with known locations and demands by a fixed fleet of vehicles of limited capacity, minimizing the total route length. All vehicles are located at a common depot with known location. This is a NP-hard problem. The few methods developed to solve the problem exactly are very time consuming and they are only feasible for small dimension problems. So, the most efficient approaches are based on heuristic algorithms. More recently some meta-heuristics, mainly based on Tabu search, have been developed to the VRP. In this work we present a Genetic algorithm to the basic version of the VRP. We describe the way we have adjusted the genetic operators to the problem. We report and analyse the results of a computational study with a set of known test problems.

Keywords : Vehicle Routing Problem; Heuristics; Genetic Algorithms.

        · abstract in Portuguese     · text in Portuguese     · Portuguese ( pdf )