Hybrid estimation of distribution algorithm for a multiple trips fixed fleet vehicle routing problems with time windows. (1st January 2014)

• Record Type: Journal Article
• Authors: Euchi, Jalel
• Is Part Of: International journal of operational research. Volume 21:Number 4(2014)
• Page Start: 433
• Page End: 450
• Publication Date: 2014-01-01
• Subjects: vehicle routing -- multiple trips -- time windows -- estimation of distribution algorithm; Operations research -- Periodicals; 003.05
• Languages: English
• ISSNs: 1745-7645

Abstract

In this paper, we consider a variant of vehicle routing problem with multiple trip and time windows. In this alternative problem, we think about the scheduling of trucks to a number of customers in the presence of fixed fleet and time windows constraints. This type of problem can be described as determining a number of vehicle trips minimising total travelled distance complying with the time windows and the multiple use of vehicles. We call this problem a multiple trips fixed fleet vehicle routing problems with time windows (MTFFVRPTW). To solve this variant, a new hybrid evolutionary algorithm for transport optimisation problems, called estimation of distribution algorithm with local search is used. The proposed algorithm integrates a double structure of distribution technique, which is used to introduce the variables dependency. To evaluate our approach we provide a number of experimentation to a modified Solomon's instances for the case of multiple trips. The results show that the hybrid proposed algorithm offer a good quality solution in the term of objective functions, also in the running time.