Storage Management System Problem and Firefly Algorithm Solution

被引：0

作者：

Atas, Kubilay ^{[1
]}

Yildirim, Tulay ^{[1
]}

机构：

[1] Yildiz Tekn Univ, Elekt & Haberlesme Muhendisligi Bolumu, Istanbul, Turkey

来源：

2019 INNOVATIONS IN INTELLIGENT SYSTEMS AND APPLICATIONS CONFERENCE (ASYU) | 2019年

关键词：

Storage Management System Problem; Traveling Salesman Problem; Firefly Algorithm;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Today, many black box problems can be solved with nature-inspired meta-heuristic algorithms. These algorithms are used frequently to solve problems such as Traveling Salesman Problem, Knapsack Problem, Graph Coloring and Vehicle Routing problems which have combinatorial difficulties. In this study, Storage Management System problem which is similar to Traveling Salesman Problem is introduced. In this problem, it is aimed to find the most appropriate sequence in order to complete the list of access and stock requests in a short time in a rack system having a platform that can move independently in horizontal and vertical positions. In the study, Firefly Algorithm is proposed to solve the Storage Management System problem. Discrete solution of Firefly Algorithm is used and functions such as distance and light intensity are adapted to the problem.

引用

页码：77 / 82

页数：6

共 10 条

[1] Shuffled frog leaping algorithm and its application to 0/1 knapsack problem Kaushik Kumar [J].

Bhattacharjee, Kaushik Kumar ;

Sarmah, S. P. .

APPLIED SOFT COMPUTING, 2014, 19 :252-263

[2]

Bookstaber D., 1997, SIM ANN TRAV SAL PRO

[3]

Chawda B. V., 2012, INT J ADV RES COMPUT, V1, P222

[4] Ant colonies for the travelling salesman problem [J].

Dorigo, M ;

Gambardella, LM .

BIOSYSTEMS, 1997, 43 (02) :73-81

[5]

Gabrys R, 2016, IEEE INT SYMP INFO, P2644, DOI 10.1109/ISIT.2016.7541778

[6]

Jati GK, 2011, LECT NOTES ARTIF INT, V6943, P393, DOI 10.1007/978-3-642-23857-4_38

[7]

Kumbharana S., 2013, International Journal for Research in Science Advanced Technologies, V2, P53

[8] A normalized Levenshtein distance metric [J].

Li Yujian ;

Liu Bo .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2007, 29 (06) :1091-1095

[9]

Toth P, 2014, MOS-SIAM SER OPTIMIZ, P1

[10]

Yang XS, 2009, LECT NOTES COMPUT SC, V5792, P169, DOI 10.1007/978-3-642-04944-6_14

← 1 →