Linear Ordering Optimization with a Combinatorial Differential Evolution

Proceedings - 2015 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2015

Volumn , Issue , 2016, Pages 2135-2140

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

^a UNIVERSITY OF PERUGIA   (Italy)

Author keywords

Combinatorial Optimization; Differential Evolution; Linear Ordering Problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; CYBERNETICS; GROUP THEORY; OPTIMIZATION; SET THEORY;

BENCHMARK SUITES; CONTINUOUS SPACES; DIFFERENTIAL EVOLUTION; DIFFERENTIAL EVOLUTION SCHEMES; DIFFERENTIAL MUTATIONS; GROUP STRUCTURE; LINEAR ORDERING PROBLEMS; STATE OF THE ART;

EVOLUTIONARY ALGORITHMS;

EID: 84960452670     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMC.2015.373     Document Type: Conference Paper

References (26)

1. Martf, R., Reinelt, G. The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization. Appl. Math. Sciences 175 (2010)
2. Marti, R., Reinelt, G., Duarte, A. A benchmark library and a comparison of heuristic methods for the linear ordering problem. Computational Optimization and Applications, Vol. 51, Issue 3, pp. 1297-1317 (2012)
3. Leontief, W. Input-Output Economics. Cambridge University Press (2008)
4. Charon, I., Hudry, O. A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR, Vol. 5 (1), pp. 5-60 (2007)
5. Glover, F., Klastorin, T., Klingman, D. Optimal weighted ancestry relationships. Management science report series. Univ. of Colorado (1972)
6. Kemeny, J.G. Mathematics without numbers. Daedalus, Vol. 88, pp. 577-591 (1959)
7. Schiavinotto, T., Stutzle, T. The linear ordering problem: instances, search space analysis and algorithms. J. Math. Modelling Algorithms, Vol. 3 (4), pp. 367-402 (2004)
8. Garey, M.R., Johnson, D.S. Computers and intractability: A guide to the theory of NP-completeness, Freeman (1979)
9. Santucci, V., Baioletti, M., Milani, A. A Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem with Total Flow Time Criterion. Lecture Notes in Comp. Sc., Vol. 8672, pp. 161-170 (2014)
10. Storn, R., Price, K. Differential Evolution: A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces. Journal of Global Optimization 11, 341-359 (1997)
11. Price, K.V., Storn, R.M., Lampinen, J.A. Differential Evolution: A Practical Approach to Global Optimization. Springer, Berlin (2005)
12. Becker, O. Das Helmstadtersche Reihenfolgeproblem-die Effizienz verschiedener Naherungsverfahren. Computer uses in the social sciences, Berichteiner Working Conference, Wien (1967)
13. Chenery, H.B., Watanabe, T. International comparisons of the structure of production. Econometrica, Vol. 26, pp. 487-521 (1958)
14. Chanas, S., Kobylanski, P. A new heuristic algorithm solving the linear ordering problem. Comp. Opt. and Appl., Vol. 6, pp. 191-205 (1996)
15. Laguna, M., Mart, R., Campos, V. Intensification and diversification with elite tabu search solutions for the linear ordering problem. Computers & Operations Research, Vol. 26 (12), pp. 1217-1230 (1999)
16. Charon, I., Hudry, O. The noising methods: A generalization of some metaheuristics. European J. of Operat. Res., Vol. 135, pp. 86-101 (2001)
17. Garcia, C.G., Perez-Brito, D., Campos, V., Mart, R. Variable neighborhood search for the linear ordering problem. Computers and Operations Research, Vol. 33, pp. 3549-3565 (2006)
18. Campos, V., Glover, F., Laguna, M., Mart, R. An experimental evaluation of a scatter search for the linear ordering problem. J. of Global Optimization, Vol. 21, pp. 397-414 (2001)
19. Charon, I., Hudry, O. Lamarckian genetic algorithms applied to the aggregation of preferences. Ann. of Op. Res., Vol. 80, pp. 281-297 (1998)
20. Ceberio, J., Mendiburubu A., Lozano, J.A. The linear ordering problem revisited. European J. of Operat. Res., Vol. 241 (3), pp. 686-696 (2015)
21. Syswerda, G. Schedule optimization using genetic algorithms. In L. Davis, editor, Handbook of Genetic Algorithms. New York (1990)
22. Kromer, P., Platos, J., and Snasel, V. Differential evolution for the linear ordering problem implemented on CUDA. In Proc. of the 2011 IEEE Con. on EVol. Comp. (CEC) (2011)
23. Kromer, P., Zelinka, I., and Snasel, V. Can deterministic chaos improve differential evolution for the linear ordering problem? In Proc. of 2014 IEEE Congress on EVol. Comp. (CEC), IEEE, pp. 1443-1448 (2014)
24. Snasel, V., Kromer, P., Platos, J. Differential Evolution and Genetic Algorithms for the Linear Ordering Problem. Lect. Notes in Comp. Sc., Vol. 5711, pp. 139-146 (2009)
25. Schiavinotto, T., Stutzle, T. A review of metrics on permutations for search landscape analysis. Comp. & Oper. Res. 34 (10), 3143-3153 (2007)
26. 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 Ev. Comp. 10 (6), 646-657 (2006)