Clusters of non-dominated solutions in multiobjective combinatorial optimization: An experimental analysis

Lecture Notes in Economics and Mathematical Systems

Volumn 618, Issue , 2009, Pages 69-77

  Paquete, Luís ^a   Stützle, Thomas ^b  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Combinatorial optimization; Local search; Multiobjective programming

Indexed keywords

EID: 60649103815     PISSN: 00758442     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-85646-7_7     Document Type: Article

References (14)

1. Andersen K, Jörnsten K, Lind M (1996) On bicriterion minimal spanning trees: an approximation. Comput Oper Res 23(12):1171-1182
2. Bachelet V (1999) Métaheuristiques paralleles hybrides: Application au probleme d'affectation quadratique. Dissertation, Université des Sciences et Technologies de Lille, France
3. Borges PC, Hansen MP (2000) A study of global convexity for a multiple objective travelling salesman problem. In: Ribeiro CC, Hansen. P (eds) Essays and surveys in metaheuristics. Kluwer, Dorderecht, pp 129-150
4. Caprara A (1997) Sorting by reversals is difficult. In: Proceedings of the first annual international conference on computational molecular biology. ACM, New York, NY, pp 75-83
5. Ehrgott M, Klamroth K (1997) Connectedness of efficient solutions in multi criteria combinatorial optimization. Eur J Oper Res 97:159-166
6. Hamacher HV, Ruhe G (1994) On spanning tree problems with multiple objectives. Ann Oper Res 52:209-230
7. Johnson DS, McGeoch LA. (1997) The travelling salesman problem.: a case study in local optimization. In: Aarts EHL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, Chichester, UK, pp 215-310
8. Knowles J, Corne D (2002) Towards landscape analyses to inform the design, of a hybrid local search for the multiobjective quadratic assignment problem. In: Abraham A, Ruiz del. Solar J, Koppen M (eds) Soft computing systems: design, management and applications. IOS, Amsterdam, The Netherlands, pp 271-279
9. Morita H, Gandibleux X, Katoh N (2001) Experimental feedback, on biobjective permutation scheduling problems solved with a population heuristic. Found Comput Decision Sei 26(1):23-50
10. Mote J, Murthy I, Olson DL (1991) A parametric approach to solving bicriterion shortest path problem. Eur J Oper Res 53:81-92
11. Paquete L (2005) Stochastic local search algorithms for multiobjective combinatorial optimization: methods and analysis. Dissertation, FB Informatik, TU Darmstadt, Germany
12. Paquete L, Stützle T (2003) A two-phase local search for the biobjective traveling salesman problem. In: Fonseca CM et al. (eds) Evolutionary multi-criterion optimization (EMO 2003), vol 2632, Lecture Notes in Computer Science. Springer, Berlin, Germany, pp 479-493
13. Schiavinotto T, Stützle T (2007) A review of metrics on permutations for search space analysis. Comput Oper Res 34(10):3143 -3153
14. Serafini P (1986) Some considerations about computational complexity for multiobjective combinatorial problems. In: Jahn J, Krabs W (eds) Recent advances and historical development of vector optimization, vol 294, Lecture Notes in Economics and Mathematical. Systems. Springer, Berlin, Germany, pp 222-231