logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

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

delete1998-12-01
delete66
PRE
AI
L
Luiz Satoru Ochi
D
Dalessandro Soares Vianna
L
Lúcia M. A. Drummond
V
Victor, AO
DOI：10.1016/S0167-739X(98)00034-Xdelete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Nowadays genetic algorithms stand as a trend to solve NP-complete 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 its performance is evaluated for a heterogeneous fleet problem, which is considered a problem much harder to solve than the homogeneous vehicle routing problem. (C) 1998 Elsevier Science B.V. All rights reserved.
Keywords:
parallel algorithms
metaheuristics
vehicle routing problem
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

F
Future Generation Computer Systems-The International Journal of eScience
IF:
6.1
Papers:
6.8K
Citations:
2.3W

Organization

No organization information available