Movatterモバイル変換


[0]ホーム

URL:


Skip to main content

Advertisement

Springer Nature Link
Log in

Multi-objective Local Search Based on Decomposition

  • Conference paper
  • First Online:

Part of the book series:Lecture Notes in Computer Science ((LNTCS,volume 9921))

Included in the following conference series:

  • 3275Accesses

Abstract

It is generally believed that Local search (Ls) should be used as a basic tool in multi-objective evolutionary computation for combinatorial optimization. However, not much effort has been made to investigate how to efficiently useLs in multi-objective evolutionary computation algorithms. In this paper, we study some issues in the use of cooperative scalarizing local search approaches for decomposition-based multi-objective combinatorial optimization. We propose and study multiple move strategies in theMoea/d framework. By extensive experiments on a new set of bi-objective traveling salesman problems with tunable correlated objectives, we analyze these policies with differentMoea/d parameters. Our empirical study has shed some insights about the impact of theLs move strategy on the anytime performance of the algorithm.

This is a preview of subscription content,log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide -see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Similar content being viewed by others

References

  1. Chang, P.C., Chen, S.H., Zhang, Q., Lin, J.L.: MOEA/D for flowshop scheduling problems. In: CEC, pp. 1433–1438 (2008)

    Google Scholar 

  2. Hoos, H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, Burlington (2004)

    MATH  Google Scholar 

  3. Ishibuchi, H., Murata, T.: A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans. Cyber.28(3), 392–403 (1998)

    Google Scholar 

  4. Jaszkiewicz, A.: Genetic local search for multi-objective combinatorial optimization. EJOR137(1), 50–71 (2002)

    Article MathSciNet MATH  Google Scholar 

  5. Ke, L., Zhang, Q., Battiti, R.: MOEA/D-ACO: a multiobjective evolutionary algorithm using decomposition and ant colony. IEEE Trans. Cyber.43(6), 1845–1859 (2013)

    Article  Google Scholar 

  6. Ke, L., Zhang, Q., Battiti, R.: Hybridization of decomposition and local search for multiobjective optimization. IEEE Trans. Cyber.44(10), 1808–1820 (2014)

    Article  Google Scholar 

  7. Knowles, J., Thiele, L., Zitzler, E.: A tutorial on the performance assessment of stochastic multiobjective optimizers. TIK report 214, Zurich, Switzerland (2006)

    Google Scholar 

  8. Li, H., Zhang, Q.: Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II. IEEE TEC13(2), 284–302 (2009)

    Google Scholar 

  9. Liefooghe, A., Mesmoudi, S., Humeau, J., Jourdan, L., Talbi, E.G.: On dominance-based local search. J. Heuristics18(2), 317–352 (2012)

    Article  Google Scholar 

  10. Lust, T., Teghem, J.: Two-phase Pareto local search for the biobjective traveling salesman problem. J. Heuristics16(3), 475–510 (2010)

    Article MATH  Google Scholar 

  11. Palacios Alonso, J.J., Derbel, B.: On maintaining diversity in MOEA/D: application to a biobjective combinatorial FJSP. In: GECCO, pp. 719–726 (2015)

    Google Scholar 

  12. Paquete, L., Stützle, T.: Design and analysis of stochastic local search for the multiobjective traveling salesman problem. COR36(9), 2619–2631 (2009)

    MATH  Google Scholar 

  13. Verel, S., Liefooghe, A., Jourdan, L., Dhaenens, C.: On the structure of multi-objective combinatorial search space: MNK-landscapes with correlated objectives. Eur. J. Oper. Res.227(2), 331–342 (2013)

    Article MathSciNet  Google Scholar 

  14. Zhang, Q., Li, H.: MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE TEC11(6), 712–731 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Lille, CNRS, UMR 9189 – CRIStAL/Inria Lille-Nord Europe, Villeneuve-d’ascq, France

    Bilel Derbel & Arnaud Liefooghe

  2. Computer Science Department, City University, Kowloon Tong, Hong Kong

    Qingfu Zhang

  3. Faculty of Engineering, Shinshu University, Nagano, Japan

    Hernan Aguirre & Kiyoshi Tanaka

Authors
  1. Bilel Derbel

    You can also search for this author inPubMed Google Scholar

  2. Arnaud Liefooghe

    You can also search for this author inPubMed Google Scholar

  3. Qingfu Zhang

    You can also search for this author inPubMed Google Scholar

  4. Hernan Aguirre

    You can also search for this author inPubMed Google Scholar

  5. Kiyoshi Tanaka

    You can also search for this author inPubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Manchester, Manchester, United Kingdom

    Julia Handl

  2. Edinburgh Napier University, Edinburgh, United Kingdom

    Emma Hart

  3. Aston University, Birmingham, United Kingdom

    Peter R. Lewis

  4. University of Manchester, Manchester, United Kingdom

    Manuel López-Ibáñez

  5. University of Stirling, Stirling, United Kingdom

    Gabriela Ochoa

  6. Edinburgh Napier University, Edinburgh, United Kingdom

    Ben Paechter

Rights and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Derbel, B., Liefooghe, A., Zhang, Q., Aguirre, H., Tanaka, K. (2016). Multi-objective Local Search Based on Decomposition. In: Handl, J., Hart, E., Lewis, P., López-Ibáñez, M., Ochoa, G., Paechter, B. (eds) Parallel Problem Solving from Nature – PPSN XIV. PPSN 2016. Lecture Notes in Computer Science(), vol 9921. Springer, Cham. https://doi.org/10.1007/978-3-319-45823-6_40

Download citation

Publish with us

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide -see info

Tax calculation will be finalised at checkout

Purchases are for personal use only


[8]ページ先頭

©2009-2025 Movatter.jp