Algebraic differential evolution algorithm for the permutation flowshop scheduling problem with total flowtime criterion

IEEE Transactions on Evolutionary Computation

Volumn 20, Issue 5, 2016, Pages 682-694

  Santucci, Valentino ^a   Baioletti, Marco ^a   Milani, Alfredo ^a,b  

^a UNIVERSITY OF PERUGIA   (Italy)

^b HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

Algebraic differential mutation; Differential evolution (DE); Permutation flowshop scheduling; Permutations space

Indexed keywords

ALGEBRA; EVOLUTIONARY ALGORITHMS; OPTIMIZATION; SCHEDULING;

DIFFERENTIAL EVOLUTION; DIFFERENTIAL EVOLUTION ALGORITHMS; DIFFERENTIAL MUTATIONS; FINITELY GENERATED GROUPS; PERMUTATION FLOW-SHOP SCHEDULING; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; PERMUTATIONS SPACE; STATE-OF-THE-ART PERFORMANCE;

COMBINATORIAL MATHEMATICS;

EID: 84991688011     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2015.2507785     Document Type: Article

References (36)

1. J. N. D. Gupta and E. F. Stafford, Jr., "Flowshop scheduling research after five decades," Eur. J. Oper. Res., vol. 169, no. 3, pp. 699-711, 2006.
2. Q.-K. Pan and R. Ruiz, "A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime," Comput. Oper. Res., vol. 40, no. 1, pp. 117-128, 2013.
3. J. Ceberio, E. Irurozki, A. Mendiburu, and J. A. Lozano, "A distancebased ranking model estimation of distribution algorithm for the flowshop scheduling problem," IEEE Trans. Evol. Comput., vol. 18, no. 2, pp. 286-300, Apr. 2014.
4. R. Storn and K. Price, "Differential evolution-A simple and efficient heuristic for global optimization over continuous spaces," J. Global Optim., vol. 11, no. 4, pp. 341-359, 1997.
5. T. Zheng and M. Yamashiro, "Solving flow shop scheduling problems by quantum differential evolutionary algorithm," Int. J. Adv. Manuf. Technol., vol. 49, no. 5, pp. 643-662, 2010.
6. G. C. Onwubolu and D. Davendra, Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization. Berlin, Germany: Springer, 2009.
7. V. Santucci, M. Baioletti, and A. Milani, "A differential evolution algorithm for the permutation flowshop scheduling problem with total flow time criterion," in Proc. PPSN XIII (LNCS 8672). Ljubljana, Slovenia, 2014, pp. 161-170.
8. K. Price, R. M. Storn, and J. A. Lampinen, Differential Evolution: A Practical Approach to Global Optimization. Berlin, Germany: Springer, 2005.
9. J. Liu and C. R. Reeves, "Constructive and composite heuristic solutions to the p//∑ci scheduling problem," Eur. J. Oper. Res., vol. 132, no. 2, pp. 439-452, 2001.
10. T. Schiavinotto and T. Stützle, "A review of metrics on permutations for search landscape analysis," Comput. Oper. Res., vol. 34, no. 10, pp. 3143-3153, 2007.
11. Q.-K. Pan and R. Ruiz, "Local search methods for the flowshop scheduling problem with flowtime minimization," Eur. J. Oper. Res., vol. 222, no. 1, pp. 31-43, 2012.
12. C. Rajendran and H. Ziegler, "An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs," Eur. J. Oper. Res., vol. 103, no. 1, pp. 129-138, 1997.
13. R. Ruiz and T. Stützle, "A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem," Eur. J. Oper. Res., vol. 177, no. 3, pp. 2033-2049, 2007.
14. W. E. Costa, M. C. Goldbarg, and E. G. Goldbarg, "New VNS heuristic for total flowtime flowshop scheduling problem," Expert Syst. Appl., vol. 39, no. 9, pp. 8149-8161, 2012.
15. X. Xu, Z. Xu, and X. Gu, "An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization," Expert Syst. Appl., vol. 38, no. 7, pp. 7970-7979, 2011.
16. S. Biswas, S. Kundu, and S. Das, "Inducing niching behavior in differential evolution through local information sharing," IEEE Trans. Evol. Comput., vol. 19, no. 2, pp. 246-263, Apr. 2015.
17. A. Milani and V. Santucci, "Community of scientist optimization: An autonomy oriented approach to distributed optimization," AI Commun., vol. 25, no. 2, pp. 157-172, 2012.
18. M. Baioletti, A. Milani, V. Poggioni, and F. Rossi, "Experimental evaluation of pheromone models in ACOPlan," Ann. Math. Artif. Intell., vol. 62, no. 3, pp. 187-217, 2011.
19. J. C. Bean, "Genetic algorithms and random keys for sequencing and optimization," ORSA J. Comput., vol. 6, no. 2, pp. 154-160, 1994.
20. Z. Čičková and S. Števo, "Flow shop scheduling using differential volution," Manag. Inf. Syst., vol. 5, no. 2, pp. 8-13, 2010.
21. X. Li and M. Yin, "An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure," Adv. Eng. Softw., vol. 55, pp. 10-31, Jan. 2013.
22. A. Moraglio, J. Togelius, and S. Silva, "Geometric differential evolution for combinatorial and programs spaces," Evol. Comput., vol. 21, no. 4, pp. 591-624, 2013.
23. H. H. Hoos and T. Stützle, Stochastic Local Search: Foundations and Applications. San Francisco, CA, USA: Morgan Kaufmann, 2005.
24. E. Taillard, "Benchmarks for basic scheduling problems," Eur. J. Oper. Res., vol. 64, no. 2, pp. 278-285, 1993.
25. D. E. Knuth, The Art of Computer Programming, Volume 3-Sorting and Searching, 2nd ed. Reading, MA, USA: Addison-Wesley, 1998.
26. R. Sinatra, J. Gómez-Gardeñes, R. Lambiotte, V. Nicosia, and V. Latora, "Maximal-entropy random walks in complex networks with limited information," Phys. Rev. E, vol. 83, no. 3, 2011, Art. ID 030103.
27. T. Murata, H. Ishibuchi, and H. Tanaka, "Genetic algorithms for flowshop scheduling problems," Comput. Ind. Eng., vol. 30, no. 4, pp. 1061-1071, 1996.
28. A. Moraglio and R. Poli, "Geometric crossover for the permutation representation," Intell. Artif., vol. 5, no. 1, pp. 49-63, 2011.
29. J. Derrac, S. Garcia, D. Molina, and F. Herrera, "A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms," Swarm Evol. Comput., vol. 1, no. 1, pp. 3-18, 2011.
30. J. Brest, B. Boskovic, S. Greiner, M. Mernik, and V. Zumer, "Selfadapting control parameters in differential evolution: A comparative study on numerical benchmark problems," IEEE Trans. Evol. Comput., vol. 10, no. 6, pp. 646-657, Dec. 2006.
31. M. Birattari, "Tuning metaheuristics: A machine learning perspective," Studies in Computational Intelligence, vol. 197. Berlin, Germany: Springer, 2009.
32. V. Santucci, M. Baioletti, and A. Milani. (2015). Supplementary Data of 'Algebraic Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem With Total Flowtime Criterion.' [Online]. Available: http://www.dmi.unipg.it/baioletti/dep.
33. X. Li, Q. Wang, and C. Wu, "Efficient composite heuristics for total flowtime minimization in permutation flow shops," Omega, vol. 37, no. 1, pp. 155-164, 2009.
34. V. Santucci, M. Baioletti, and A. Milani, "Solving permutation flow shop scheduling problems with a discrete differential evolution algorithm," AI Commun., vol. 29, no. 2, pp. 269-286, 2016
35. M. Baioletti, A. Milani, and V. Santucci, "An algebraic differential evolution for the linear ordering problem," in Proc. ACM Conf. Genet. Evol. Comput. Companion (GECCO), Madrid, Spain, 2015, pp. 1479-1480.
36. M. Baioletti, A. Milani, and V. Santucci, "Linear ordering optimization with a combinatorial differential evolution," in Proc. IEEE Int. Conf. Syst. Man Cybern. (SMC), Hong Kong, 2015, pp. 2135-2140.