A hybrid estimation of distribution algorithm for the vehicle routing problem with time windows

作     者：Perez-Rodriguez, Ricardo Hernandez-Aguirre, Arturo 

作者机构：CONACYT CIMAT AC Barrio Estn Bartolome de las Casas 314 Aguascalientes 20259 Ags Mexico CIMAT AC Jalisco S-N Guanajuato 36240 Gto Mexico 

出 版 物：《COMPUTERS & INDUSTRIAL ENGINEERING》 (计算机与工业工程)

年 卷 期：2019年第130卷

页      面：75-96页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：We would like to express our gratitude to all the reviewers for their comments in improving the manuscript 

主　　题：Estimation of distribution algorithm Mallows distribution Vehicle routing problem Combinatorial optimization 

摘      要：The Vehicle Routing Problem (VRP) seeks to find minimum-travel routes for a set of vehicles. The routes contain a set of customers with known demands. Each vehicle departs and arrives at the same depot. In the vehicle routing problem with time windows (VRPTW), each vehicle has to arrive in a specific time window with each customer and also each vehicle has to return to the depot before a due time. In this research, the use of an estimation of distribution algorithm to solve the problem is proposed. The algorithm uses the generalized Mallows distribution as a probability model to describe the distribution of the solution space. Homberger-Gehring s instances are used as input and test parameters in order to show that the modification of the generalized Mallows distribution mentioned is able to produce competitive sequences for the VRPTW against some other estimation of distribution algorithms used in permutation-based optimization problems.