Skip to main content
SpringerLink
Log in

EB-GLS: an improved guided local search based on the big valley structure

  • Regular Research Paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

Abstract

Local search is a basic building block in memetic algorithms. Guided local search (GLS) can improve the efficiency of local search. By changing the guide function, GLS guides a local search to escape from locally optimal solutions and find better solutions. The key component of GLS is its penalizing mechanism which determines which feature is selected to penalize when the search is trapped in a locally optimal solution. The original GLS penalizing mechanism only makes use of the cost and the current penalty value of each feature. It is well known that many combinatorial optimization problems have a big valley structure, i.e., the better a solution is, the more the chance it is closer to a globally optimal solution. This paper proposes to use big valley structure assumption to improve the GLS penalizing mechanism. An improved GLS algorithm called elite biased GLS (EB-GLS) is proposed. EB-GLS records and maintains an elite solution as an estimate of the globally optimal solutions, and reduces the chance of penalizing the features in this solution. We have systematically tested the proposed algorithm on the symmetric traveling salesman problem. Experimental results show that EB-GLS is significantly better than GLS.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Alhindi A, Zhang Q (2013) MOEA/D with guided local search: some preliminary experimental results. In: Computer science and electronic engineering conference (CEEC), 2013 5th, IEEE, pp 109–114

  2. Alsheddy A, Tsang E (2011) Empowerment scheduling for a field workforce. J Sched 14(6):639–654

  3. Basharu M, Arana I, Ahriz H (2005) Distributed guided local search for solving binary DisCSPs. In: FLAIRS conference, pp 660–665

  4. Bentley JJ (1992) Fast algorithms for geometric traveling salesman problems. ORSA J Comput 4(4):387–411

    Article  MathSciNet  MATH  Google Scholar 

  5. Boese KD (1995) Cost versus distance in the traveling salesman problem. UCLA Computer Science Department, Los Angeles

    Google Scholar 

  6. Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28–39

    Article  Google Scholar 

  7. Eiben ÁE, Van Der Hauw JK, van Hemert JI (1998) Graph coloring with adaptive evolutionary algorithms. J Heuristics 4(1):25–46

    Article  MATH  Google Scholar 

  8. Hains DR, Whitley LD, Howe AE (2011) Revisiting the big valley search space structure in the TSP. J Oper Res Soc 62(2):305–312

    Article  Google Scholar 

  9. Hasan SK, Sarker R, Essam D, Cornforth D (2009) Memetic algorithms for solving job-shop scheduling problems. Memet Comput 1(1):69–83

    Article  Google Scholar 

  10. Helsgaun K (2000) An effective implementation of the Lin–Kernighan traveling salesman heuristic. Eur J Oper Res 126(1):106–130

    Article  MathSciNet  MATH  Google Scholar 

  11. Jadon SS, Bansal JC, Tiwari R, Sharma H (2015) Accelerating artificial bee colony algorithm with adaptive local search. Memet Comput 7(3):215–230

    Article  Google Scholar 

  12. Jones T (1995) Evolutionary algorithms, fitness landscapes and search. Ph.D. Thesis, Citeseer

  13. Jones T, Forrest S (1995) Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Eshelman LJ (ed) Proceedings of the 6th international conference on genetic algorithms. Morgan Kaufmann, San Francisco, CA, pp 184–192

    Google Scholar 

  14. Kauffman SA (1993) The origins of order: self-organization and selection in evolution. Oxford University Press, Oxford

    Google Scholar 

  15. Lau T, Tsang E (2001) Guided genetic algorithm and its application to radio link frequency assignment problems. Constraints 6(4):373–398

    Article  MATH  Google Scholar 

  16. Lourenço HR, Martin OC, Stützle T (2010) Iterated local search: framework and applications. In: Handbook of metaheuristics, Springer, pp 363–397

  17. Marinaki M, Marinakis Y (2015) A hybridization of clonal selection algorithm with iterated local search and variable neighborhood search for the feature selection problem. Memet Comput 7(3):181–201

    Article  Google Scholar 

  18. Merz P, Freisleben B (2000) Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans Evol Comput 4(4):337–352

    Article  Google Scholar 

  19. Merz P, Freisleben B (2001) Memetic algorithms for the traveling salesman problem. Complex Syst 13(4):297–346

    MathSciNet  MATH  Google Scholar 

  20. Merz P, Katayama K (2004) Memetic algorithms for the unconstrained binary quadratic programming problem. BioSyst 78(1):99–118

    Article  Google Scholar 

  21. Mester D, Bräysy O (2005) Active guided evolution strategies for large-scale vehicle routing problems with time windows. Comput Oper Res 32(6):1593–1614

    Article  MATH  Google Scholar 

  22. Mills P, Tsang E, Ford J (2003) Applying an extended guided local search to the quadratic assignment problem. Ann Oper Res 118(1):121–135

    Article  MathSciNet  MATH  Google Scholar 

  23. Ochoa G, Veerapen N (2016) Deconstructing the big valley search space hypothesis. In: Evolutionary computation in combinatorial optimization, Springer, pp 58–73

  24. Oliveira SM, Hussin MS, Stützle T, Roli A, Dorigo M (2011) A detailed analysis of the population-based ant colony optimization algorithm for the TSP and the QAP. In: Proceedings of the 13th annual conference companion on genetic and evolutionary computation, ACM, pp 13–14

  25. Reeves CR (1999) Landscapes, operators and heuristic search. Ann Oper Res 86:473–490

    Article  MathSciNet  MATH  Google Scholar 

  26. Reinelt G (1991) TSPLIB—a traveling salesman problem library. ORSA J Comput 3(4):376–384

    Article  MATH  Google Scholar 

  27. Tao X, Haubrich HJ (2005) A hybrid metaheuristic method for the planning of medium-voltage power distribution systems

  28. Tarantilis CD, Zachariadis EE, Kiranoudis CT (2008) A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities. INFORMS J Comput 20(1):154–168

    Article  MathSciNet  MATH  Google Scholar 

  29. Vansteenwegen P, Souffriau W, Berghe GV, Van Oudheusden D (2009) A guided local search metaheuristic for the team orienteering problem. Eur J Oper Res 196(1):118–127

    Article  MATH  Google Scholar 

  30. Voudouris C, Tsang E (1999) Guided local search and its application to the traveling salesman problem. Eur J Oper Res 113(2):469–499

    Article  MATH  Google Scholar 

  31. Voudouris C, Tsang E, Alsheddy A (2010) Guided local search. In: Handbook of metaheuristics, Springer, pp 321–361

  32. Zachariadis EE, Tarantilis CD, Kiranoudis CT (2009) A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur J Oper Res 195(3):729–743

    Article  MATH  Google Scholar 

  33. Zhang W (2004) Configuration landscape analysis and backbone guided local search: part i: satisfiability and maximum satisfiability. Artif Intell 158(1):1–26

    Article  MathSciNet  MATH  Google Scholar 

  34. Zhong Y, Cole MH (2005) A vehicle routing problem with backhauls and time windows: a guided local search solution. Transp Res Part E: Logist Transp Rev 41(2):131–144

    Article  Google Scholar 

Download references

Acknowledgements

The work described in this paper was supported by a grant from ANR/RCC Joint Research Scheme sponsored by the Research Grants Council of the Hong Kong Special Administrative Region, China and France National Research Agency (Project No. A-CityU101/16).

Author information

Authors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Hong Kong, Hong Kong

    Jialong Shi & Qingfu Zhang

  2. Centre for Computational Finance and Economic Agents, School of Computer Science and Electronic Engineering, University of Essex, Colchester, UK

    Edward Tsang

Authors
  1. Jialong Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qingfu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Edward Tsang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jialong Shi.

Appendix

Appendix

In Sect. 4, we state that att532 has the big valley structure, while u2319 does not have the big valley structure. Our statements are based on the landscape sampling experiment conducted on these two instances, in which 1000 runs of GLS and 1000 runs of EB-GLS are executed until finding the global optimum. During each run, the best solutions found so far are recorded and the final global optimum is also recorded. In fact, we conduct the same landscape sampling experiment on another eight instances. By analyzing the results, we conclude that all these eight instances satisfy the requirements of the big valley structure we defined in Sect. 4. Table 5 shows the landscape sampling results on these eight instances. Figure 13 shows the scatter plots of the recorded best solutions found so far.

Table 5 The landscape sampling results on eight selected TSPLIB instances
Full size table
Fig. 13
figure 13

The scatter plots of the recorded best solutions found so far during 1000 runs of GLS and 1000 runs of EB-GLS on eight selected instances. The cost difference to the globally optimal cost (vertical axis) is plotted against the distance to the nearest globally optimal solution (horizontal axis). a rd400. b gr431. c pcb442. d pa561. e u574. (f) rat575. (g) rat783. h u1432

Full size image

In Table 1 we present the comparison results between EB-GLS and GLS on the 33 TSPLIB instances with more than 1000 cities. Table 6 shows the comparison results on the other 76 TSPLIB instances with less than 1000 cities.

Table 6 Comparison results between EB-GLS and GLS on the TSPLIB instances with less than 1000 cities, the better metric values are marked by bold texts
Full size table

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shi, J., Zhang, Q. & Tsang, E. EB-GLS: an improved guided local search based on the big valley structure. Memetic Comp. 10, 333–350 (2018). https://doi.org/10.1007/s12293-017-0242-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-017-0242-5

Keywords

Search

Navigation