Firefly Algorithm for Supply Chain Optimization

The firefly algorithm is one of the best latest bio-inspired algorithms, which proved its performance in solving continuous and discrete optimization problems. This paper presents a more detailed comparison study using a set of test functions. The main goal is the application of Firefly algorithm (F...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Lobachevskii journal of mathematics Ročník 39; číslo 3; s. 355 - 367
Hlavní autori: Elkhechafi, Mariam, Benmamoun, Zoubida, Hachimi, Hanaa, Amine, Aouatif, Elkettani, Youssfi
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Moscow Pleiades Publishing 01.04.2018
Springer Nature B.V
Predmet:
Algebra
Algorithms
Analysis
Complexity
Control methods
Geometry
Heuristic methods
Mathematical Logic and Foundations
Mathematics
Mathematics and Statistics
Optimization
Probability Theory and Stochastic Processes
Supply chains
Lot Size
Metaheuristics
Supply Chain
Firefly algorithm
Optimization
ISSN:1995-0802, 1818-9962
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The firefly algorithm is one of the best latest bio-inspired algorithms, which proved its performance in solving continuous and discrete optimization problems. This paper presents a more detailed comparison study using a set of test functions. The main goal is the application of Firefly algorithm (FA) to solve Lot size optimization in supply chain management which is the most complex part of stock management process. A complexity that comes from the conflict between the minimization of the costs and the maximization of the level of service. For these reason, the traditional methods of lot size control have to deal with the explosion of new needs related to supply chain evolution. The optimal solutions obtained by FA are far better than the best solutions obtained by deterministic methods analyzed in the literature.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1995-0802
1818-9962
DOI:10.1134/S1995080218030125