Title: Solve the IRP problem with an improved discrete differential evolution algorithm

Authors: Shi Cheng; Zelin Wang

Addresses: College of Computer Science and Technology, Nantong University, Nantong, 226009, China ' College of Computer Science and Technology, Nantong University, Nantong, 226009, China

Abstract: The inventory -routing problem is a NP hard problem. It is difficult to find the optimal solution in polynomial time. Many scholars have studied it in many years. This paper analyses the inventory-routing optimisation problem, and comprehensive differential evolution algorithm is good performance in solving combinatorial optimisation problems. The differential evolution algorithm was improved to make it be suitable for solving discrete combination optimisation problems. In order to improve the performance of the differential evolution algorithm to solve the inventory routing problem, this paper puts forward dynamic adjustment of mutation factor and crossover factor of the differential evolution. It is proved by numerical experiments that the proposed algorithm has certain performance advantages, and it also proves that the improved algorithm can improve the performance of the algorithm by dynamic adjustment of the mutation factor and crossover factor.

Keywords: differential evolution algorithm; inventory routing problem; mutation factor; crossover factor.

DOI: 10.1504/IJIIDS.2019.102324

International Journal of Intelligent Information and Database Systems, 2019 Vol.12 No.1/2, pp.20 - 31

Received: 25 Sep 2018
Accepted: 12 Feb 2019
Published online: 18 Sep 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article