A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet

Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Algorithms and Scatter Search coupled with a decomposition-into-petals procedure for solving a class of Vehicle Routing and Scheduli...

Full description

Saved in:
Bibliographic Details
Main Authors: Ochi, Luiz S., Vianna, Dalessandro S., Drummond, Lucia M. A., Victor, André O.
Format: Conference Proceeding
Language:English
Subjects:
Exact sciences and technology
Genetic Algorithm
Information and communication sciences
Information science. Documentation
Library and information science. General aspects
Professional aspects
Scatter Search
Sciences and techniques of general use
Vehicle Route
Vehicle Route Problem
Vehicle Type
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Algorithms and Scatter Search coupled with a decomposition-into-petals procedure for solving a class of Vehicle Routing and Scheduling Problems. The parallel genetic algorithm presented is based on the island model and was run on a cluster of workstations. Its performance is evaluated for a heterogeneous fleet problem, which is considered a problem much harder to solve than the homogeneous vehicle routing problem.
ISSN:0302-9743
1611-3349
DOI:10.1007/3-540-64359-1_691