Abstract
In this paper a new discrete Differential Evolution algorithm for the Permutation Flowshop Scheduling Problem with the total flowtime criterion is proposed. The core of the algorithm is the distance-based differential mutation operator defined by means of a new randomized bubble sort algorithm. This mutation scheme allows the Differential Evolution to directly navigate the permutations search space. Experiments were held on a well known benchmark suite and the results show that our proposal outperforms state-of-the-art algorithms on the majority of the problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Gupta, J., Stafford, J.E.: Flowshop scheduling research after five decades. European Journal of Operational Research 169, 699–711 (2006)
Ceberio, J., Irurozki, E., Mendiburu, A., Lozano, J.A.: A Distance-based Ranking Model Estimation of Distribution Algorithm for the Flowshop Scheduling Problem. IEEE Transactions on Evolutionary Computation 99, 1–16 (2013)
Costa, W.E., Goldbarg, M.C., Goldbarg, E.G.: New VNS heuristic for total flowtime flowshop scheduling problem. Expert Systems with Appl. 39, 8149–8161 (2012)
Xu, X., Xu, Z., Gu, X.: An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization. Expert Systems with Appl. 38, 7970–7979 (2011)
Liu, J., Reeves, C.R.: Constructive and composite heuristic solutions to the P// ∑ C i scheduling problem. European Journal of Operational Research 132, 439–452 (2001)
Storn, R., Price, K.: Differential Evolution: A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces. Jour. of Global Opt. 11, 341–359 (1997)
Murata, T., Ishibuchi, H., Tanaka, H.: Genetic algorithms for flowshop scheduling problems. Computers & Ind. Eng. 30(4), 1061–1071 (1996)
Milani, A., Santucci, V.: Community of scientist optimization: An autonomy oriented approach to distributed optimization. AI Commununications 25, 157–172 (2012)
Baioletti, M., Milani, A., Poggioni, V., Rossi, F.: Experimental evaluation of pheromone models in ACOPlan. Ann. Math. Artif. Intell. 62(3-4), 187–217 (2011)
Onwubolu, G.C., Davendra, D. (eds.): Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization. SCI, vol. 175. Springer, Heidelberg (2009)
Cickova, Z., Stevo, S.: Flow Shop Scheduling using Differential Evolution. Management Information Systems 5(2), 8–13 (2010)
Li, X., Yin, M.: An opposition-based differential evolution algorithm for permutation flowshop scheduling based on diversity measure. Adv. Eng. Soft. 55, 10–31 (2013)
Price, K.V., Storn, R.M., Lampinen, J.A.: Differential Evolution: A Practical Approach to Global Optimization. Springer, Berlin (2005)
Moraglio, A., Poli, R.: Geometric crossover for the permutation representation. Intelligenza Artificiale 5(1), 49–63 (2011)
Schiavinotto, T., Stutzle, T.: A review of metrics on permutations for search landscape analysis. Computers & Oper. Res. 34(10), 3143–3153 (2007)
Brest, J., Boskovic, B., Mernik, M., Zumer, V.: Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems. IEEE Trans. on Evol. Comp. 10(6), 646–657 (2006)
Taillard, E.: Benchmarks for basic scheduling problems. European Jour. of Oper. Res. 64(2), 278–285 (1993)
Derrac, J., Garcia, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation 1, 3–18 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Santucci, V., Baioletti, M., Milani, A. (2014). A Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem with Total Flow Time Criterion. In: Bartz-Beielstein, T., Branke, J., Filipič, B., Smith, J. (eds) Parallel Problem Solving from Nature – PPSN XIII. PPSN 2014. Lecture Notes in Computer Science, vol 8672. Springer, Cham. https://doi.org/10.1007/978-3-319-10762-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-10762-2_16
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10761-5
Online ISBN: 978-3-319-10762-2
eBook Packages: Computer ScienceComputer Science (R0)