Loading…

A novel hybrid immune clonal selection algorithm for the constrained corridor allocation problem

Aiming at the lack of relevant research on relationship constraints between facilities in the corridor allocation problem (CAP). In this paper, fixed position constraints and ordering constraints are considered in CAP, and the logistics cost is minimized. Considering that the existing search technol...

Full description

Saved in:
Bibliographic Details
Published in:Journal of intelligent manufacturing 2022-04, Vol.33 (4), p.953-972
Main Authors: Liu, Junqi, Zhang, Zeqiang, Chen, Feng, Liu, Silu, Zhu, Lixia
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Aiming at the lack of relevant research on relationship constraints between facilities in the corridor allocation problem (CAP). In this paper, fixed position constraints and ordering constraints are considered in CAP, and the logistics cost is minimized. Considering that the existing search technology is complicated and time-consuming in dealing with such constrained CAP (cCAP), and immune clone selection algorithm with variable neighborhood operation (ICSAVNS) is provided for solving this problem. Two approaches to initial solution generation are designed to improve the quality of the initial population. A variable neighborhood search operator is embedded to improve the accuracy of the local search. A threshold is set in the mutation operation of the ICSAVNS to achieve population expansion better. A double index of sequences consisting of affinity values and constrained facility index values is used to select and reselect, achieving population compression in the clonal selection part. Finally, by exactly solving the model, the rationality of the model is verified. The hybrid clone selection algorithm is used to solve the cCAP and cbCAP benchmark instances of different sizes, and compared with the state-of-the-art optimization algorithms. The results show that the proposed algorithm exhibits better performance.
ISSN:0956-5515
1572-8145
DOI:10.1007/s10845-020-01693-9