Improved Fractal Space Filling Curves Hybrid Optimization Algorithm for Vehicle Routing Problem

الملخص EN

Vehicle Routing Problem (VRP) is one of the key issues in optimization of modern logistics system.

In this paper, a modified VRP model with hard time window is established and a Hybrid Optimization Algorithm (HOA) based on Fractal Space Filling Curves (SFC) method and Genetic Algorithm (GA) is introduced.

By incorporating the proposed algorithm, SFC method can find an initial and feasible solution very fast; GA is used to improve the initial solution.

Thereafter, experimental software was developed and a large number of experimental computations from Solomon’s benchmark have been studied.

The experimental results demonstrate the feasibility and effectiveness of the HOA.