Efficient algorithms are needed for optimization of objects and systems, because the user would like to be sure that the optimum is global. The paper shows a very well scalable discrete firefly algorithm, developed for solving a supplier selection problem. The built in general reduced gradient and evolutionary algorithms of the Excel solver are also compared solving this problem. The results show that the firefly algorithm solves the problem in the fragment of the running time of the evolutionary algorithm. In the second part of the article, a mathematical model was formulated to solve the fixed destination multidepot multiple tour multiple traveling salesmen problem (mdmMTSP).
Mendoza A. Effective methodologies for supplier selection and order quantity allocation, PhD Thesis, Pennsylvania State University, 2007.
Mendoza A, '', in PhD Thesis, (2007) -.
Mendoza APhD Thesis2007)| false
Virág Z. Determination of optimum diameter of a welded stiffened cylindrical shell, Pollack Periodica, Vol. 4, No. 1, 2009, pp. 41–52.
Virág Z, 'Determination of optimum diameter of a welded stiffened cylindrical shell' (2009) 4Pollack Periodica: 41-52.
Virág ZDetermination of optimum diameter of a welded stiffened cylindrical shellPollack Periodica200944152)| false
Yang X. S. Nature-inspired metaheuristic algorithms, Luniver Press, University of Cambridge, 2008.
Yang X S, '', in Nature-inspired metaheuristic algorithms, (2008) -.
Yang X SNature-inspired metaheuristic algorithms2008)| false
Sayadia M. K., Ramezaniana R., Ghaffari-Nasaba N. A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems, International Journal of Industrial Engineering Computations, Vol. 1, 2010, pp. 1–10.
Ghaffari-Nasaba N, 'A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems' (2010) 1International Journal of Industrial Engineering Computations: 1-10.
Ghaffari-Nasaba NA discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problemsInternational Journal of Industrial Engineering Computations20101110)| false