Int. J. of Wireless and Mobile Computing   »   2015 Vol.9, No.2

 

 

Title: Optimisation algorithm for logistics distribution route based on Prufer codes

 

Authors: Ruichun He; Changxi Ma; Cunrui Ma; Wei Zhang; Qiang Xiao

 

Addresses:
School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou City, Gansu Province 730070, China
School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou City, Gansu Province 730070, China
School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou City, Gansu Province 730070, China
School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou City, Gansu Province 730070, China
School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou City, Gansu Province 730070, China

 

Abstract: For logistics distribution route problem, this paper presents an improved genetic algorithm, combined with the thought of tree coded, to solve single vehicle logistics distribution route problem. The algorithm adopted Prufer array coding reducing three units length of chromosome, and the decoding method did not increase time complexity of chromosome decoded to calculate objective function value when compared with the traditional coding method which coded chromosome according to sequence traversing each node. In order to prevent the feasibility of solution being destructed by the traditional crossover and mutation operators, a single transposition operator and an ortho-position exchanging operator were also designed. The following cases show that the algorithm has a higher solving efficiency and is a great help to solve large-scale route optimisation problem.

 

Keywords: logistics distribution route; genetic algorithms; Prufer codes; route optimisation; single vehicle logistics; array coding.

 

DOI: 10.1504/IJWMC.2015.072573

 

Int. J. of Wireless and Mobile Computing, 2015 Vol.9, No.2, pp.205 - 210

 

Submission date: 27 Apr 2015
Date of acceptance: 15 May 2015
Available online: 19 Oct 2015

 

 

Editors Full text accessAccess for SubscribersPurchase this articleComment on this article