A multi population memetic algorithm for the vehicle routing problem with time windows and stochastic travel and service times

被引：14

作者：

Gutierrez, A. ^{[1
]}

Dieulle, L. ^{[2
]}

Labadie, N. ^{[1
]}

Velasco, N. ^{[3
]}

机构：

[1] Univ Technol Troyes, LOSI, Troyes, France

[2] Univ Technol Troyes, Lab Modelisat & Surete Syst, Troyes, France

[3] Univ Los Andes, Sch Management, Bogota, Colombia

来源：

IFAC PAPERSONLINE | 2016年 / 49卷 / 12期

关键词：

Vehicle Routing Problem; Memetic Algorithm; Stochastic Optimization; SEARCH;

D O I：

10.1016/j.ifacol.2016.07.673

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper presents a new model to solve the Vehicle Routing Problem with Time Windows and Stochastic Travel and Service Times. The model allows ensuring service levels at the solution, on depot's time window, and at each client. The problem is solved via a Multi Population Memetic Algorithm where each population tackles the problem using a different strategy while sharing information across the populations. The solution approach is tested on modified instances proposed by Solomon for the deterministic counterpart. Preliminary results show that the proposed method guarantees a high service level with an increase of 29.65% on the fleet sin when comparing with the best deterministic solution found. (C) 2016, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All right reserved.

引用

页码：1204 / 1209

页数：6

共 21 条

[1]

Braekers K., 2016, COMPUTERS IND ENG

[2] Vehicle routing problem with time windows, part 1:: Route construction and local search algorithms [J].