Solving the Capacitated Vehicle Routing Problem using a Parallel Micro Genetic Algorithm

被引：0

作者：

Borcinova, Zuzana ^{[1
]}

机构：

[1] Univ Zilina, Univ 8215-1, Zilina, Slovakia

来源：

2018 IEEE WORKSHOP ON COMPLEXITY IN ENGINEERING (COMPENG 2018) | 2018年

关键词：

capacitated vehicle routing problem; micro genetic algorithm; coarse-grained parallel genetic algorithm; synchronous cooperative multi-search strategy; seeded individual;

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The Capacitated Vehicle Routing Problem (CVRP) is a very extensively studied combinatorial optimization problem that aimes to determine the order in which to visit a set of customers using a homogeneous fleet of vehicles based at a single depot so that the total travel cost is minimized. In this paper, a novel coarse-grained parallel micro genetic algorithm is used for solving CVRP while the conventional migration is replaced by a synchronously seeding the overall best solution to all search processes. The computational experiments examined the behaviour of the proposed approach.

引用

页数：6

共 20 条

[1]

Alba E, 2004, LECT NOTES COMPUT SC, V3004, P11

[2] A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem [J].