Open asynchronous dynamic cellular learning automata and its application to allocation hub location problem

作者：

Highlights：

• This paper presents OADCLAs which are new hybrid models based on Cellular Automata (CAs) and Learning Automata (LAs).

• We proposed an OADCLA based algorithm for single allocation hub location problem with imprecise distances among nodes.

• The proposed algorithm is able to remove the imprecision embedded in the distances among nodes while trying to find the solution.

摘要

•This paper presents OADCLAs which are new hybrid models based on Cellular Automata (CAs) and Learning Automata (LAs).•We proposed an OADCLA based algorithm for single allocation hub location problem with imprecise distances among nodes.•The proposed algorithm is able to remove the imprecision embedded in the distances among nodes while trying to find the solution.

论文关键词：Learning automata,Cellular learning automata,Allocation hub location problem,Imprecise distances

论文评审过程：Received 16 June 2017, Revised 21 September 2017, Accepted 18 October 2017, Available online 20 October 2017, Version of Record 13 November 2017.

论文官网地址：https://doi.org/10.1016/j.knosys.2017.10.021