Multi-objective optimization of vehicle routing problem using evolutionary algorithm with memory
MetadataShow full item record
The idea of a new evolutionary algorithm with memory aspect included is proposed to find multiobjective optimized solution of vehicle routing problem with time windows. This algorithm uses population of agents that individually search for optimal solutions. The agent memory incorporates the process of learning from the experience of each individual agent as well as from the experience of the population. This algorithm uses crossover operation to define agents evolution. In the paper we choose as a base the Best Cost Route Crossover (BCRC) operator. This operator is well suited for VPRTW problems. However it does not treat both of parent symmetrically what is not natural for general evolutionary processes. The part of the paper is devoted to find an extension of the BCRC operator in order to improve inheritance of chromosomes from both of parents. Thus, the proposed evolutionary algorithm is implemented with use of two crossover operators: BCRC and its extended-modified version. We analyze the results obtained from both versions applied to Solomon’s and Gehring & Homberger instances. We conclude that the proposed method with modified version of BCRC operator gives statistically better results than those obtained using original BCRC. It seems that evolutionary algorithm with memory and modification of Best Cost Route Crossover Operator lead to very promising results when compared to the ones presented in the literature.
- Artykuły naukowe 
The following license files are associated with this item: