Simulation-based comparison of p-metaheuristics for FJSP with and without fuzzy processing time

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The population based metaheuristic (P-metaheuristic) is a stochastic algorithm for optimization. This paper presents five different P-metaheuristics (BAT, Firefly, Cuckoo search, basic Particle swarm optimization (BPSO) and a modified PSO (M-PSO)) for solving Flexible Job Shop Problem with and without fuzzy processing time (FJSP/fFJSP). We intend to evaluate and compare the performance of these different algorithms by using thirteen benchmarks for FJSP and four benchmarks for fFJSP. The results demonstrate the superiority of the M-PSO algorithm over the other techniques to solve both FJSP and fFJSP.

Cite

CITATION STYLE

APA

Rim, Z., Imed, B., & Abderrazek, J. (2018). Simulation-based comparison of p-metaheuristics for FJSP with and without fuzzy processing time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10868 LNAI, pp. 408–413). Springer Verlag. https://doi.org/10.1007/978-3-319-92058-0_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free