Abstract:

      We construct a soft time window associated mathematical model minimizing total vehicle routing cost by converting time constraint into penalty cost under the constraint of time, vehicle volume and vehicle carrying capacity in view of time window associated vehicle routing issue in a single distribution center. We employ memory dependent genetic simulated annealing algorithm (GSAA) to solve the model, which adds memory functionality and annealing operation to a genetic algorithm. We further compare optimized results. Results show that the algorithm has quick convergence rate, broad search scope and higherquality optimization solution.

Key words: vehicle routing problem, time window, mathematical model, genetic simulated annealing algorithm