By Topic

Item-Location Assignment Using Fuzzy Logic Guided Genetic Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lau, H.C.W. ; Dept. of Ind. & Syst. Eng., Hong Kong Polytech. Univ., Kowloon ; Chan, T. ; Tsui, W.T.

In today's logistics environment, large-scale combinatorial problems will inevitably be met during industrial operations. This paper deals with a novel real-world optimization problem, called the item-location assignment problem, faced by a logistics company in Shenzhen, China. The objective of the company in this particular operation is to assign items to suitable locations such that the required sum of the total traveling time of the workers to complete all orders is minimized. A stochastic search technique called fuzzy logic guided genetic algorithms (FLGA) is proposed to solve this operational problem. In GA, a specially designed crossover operation, called a shift and uniform based multi-point (SUMP) crossover, and swap mutation are adopted. The performance of this novel crossover operation is tested and is shown to be more effective by comparing it to other crossover methods. Furthermore, the role of fuzzy logic is to dynamically adjust the crossover and mutation rates after each ten consecutive generations. In order to demonstrate the effectiveness of the FLGA and make comparisons with the FLGA through simulations, various search methods such as branch and bound, standard GA (i.e., without the guide of fuzzy logic), simulated annealing, tabu search, differential evolution, and two modified versions of differential evolution are adopted. Results show that the FLGA outperforms the other search methods in all of the three considered scenarios.

Published in:

Evolutionary Computation, IEEE Transactions on  (Volume:12 ,  Issue: 6 )