Adaptive "anytime" two-phase local search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6073 LNCS, Issue , 2010, Pages 52-67

  Dubois Lacoste, Jérémie ^a   López Ibáñez, Manuel ^a   Stützle, Thomas ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC FRAMEWORK; ANYTIME SEARCH; LOCAL SEARCH; MULTI-OBJECTIVE PROBLEM; WEIGHT SETTING; WEIGHTED SUM;

EVOLUTIONARY ALGORITHMS; WAVELET TRANSFORMS;

MULTIOBJECTIVE OPTIMIZATION;

EID: 77954611689     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13800-3_5     Document Type: Conference Paper

References (16)

1. Paquete, L., Stützle, T.: Stochastic local search algorithms for multiobjective combinatorial optimization: A review. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics, pp. 29-1-29-15. Chapman & Hall/CRC (2007)
2. Paquete, L., Stützle, T.: A two-phase local search for the biobjective traveling salesman problem. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 479-493. Springer, Heidelberg (2003)
3. Paquete, L., Stützle, T.: Analysis of components of stochastic local search algorithms for the multiobjective traveling salesman problem and the design of algorithms. Computers & Operations Research 36(9), 2619-2631 (2009)
4. Dubois-Lacoste, J., López-Ibáñez, M., Stützle, T.: Effective hybrid stochastic local search algorithms for biobjective permutation flowshop scheduling. In: Sampels, M. (ed.) HM 2009. LNCS, vol. 5818, pp. 100-114. Springer, Heidelberg (2009)
5. Zilberstein, S.: Using anytime algorithms in intelligent systems. AI Magazine 17(3), 73-83 (1996)
6. Aneja, Y.P., Nair, K.P.K.: Bicriteria transportation problem. Management Science 25(1), 73-78 (1979)
7. Minella, G., Ruiz, R., Ciavotta, M.: A review and evaluation of multiobjective algorithms for the flowshop scheduling problem. INFORMS Journal on Computing 20(3), 451-471 (2008)
8. Dubois-Lacoste, J.: A study of Pareto and two-phase local search algorithms for biobjective permutation flowshop scheduling. Master's thesis, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium (2009)
9. Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177(3), 2033-2049 (2007) (Pubitemid 44712036)
10. Balaprakash, P., Birattari, M., Stützle, T.: Improvement strategies for the F-Race algorithm: Sampling design and iterative refinement. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HCI/ICCV 2007. LNCS, vol. 4771, pp. 108-122. Springer, Heidelberg (2007)
11. Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto evolutionary algorithm. IEEE Transactions on Evolutionary Computation 3(4), 257-271 (1999) (Pubitemid 30544879)
12. Fonseca, C.M., Paquete, L., López-Ibáñez, M.: An improved dimension-sweep algorithm for the hypervolume indicator. In: IEEE Congress on Evolutionary Computation, July 2006, pp. 1157-1163. IEEE Press, Los Alamitos (2006)
13. Lust, T., Teghem, J.: Two-phase Pareto local search for the biobjective traveling salesman problem. Journal of Heuristics (2009) (to appear)
14. Conover, W.J.: Practical Nonparametric Statistics, 3rd edn. John Wiley & Sons, New York (1999)
15. Grunert da Fonseca, V., Fonseca, C.M., Hall, A.O.: Inferential performance assessment of stochastic optimisers and the attainment function. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 213-225. Springer, Heidelberg (2001)
16. López-Ibáñez, M., Paquete, L., Stützle, T.: Exploratory analysis of stochastic local search algorithms in biobjective optimization. In: Bartz-Beielstein, T., et al. (eds.) Experimental Methods for the Analysis of Optimization Algorithms, Springer, Heidelberg (to appear 2010)