Skip to main content
SpringerLink
Log in

Variable Neighborhood Search for Non-deterministic Problems

  • Conference paper
Artificial Intelligence and Soft Computing (ICAISC 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8468))

Included in the following conference series:

  • 2172 Accesses

Abstract

A comparative analysis of several neighborhood structures is presented, including a variable neighborhood structure, which corresponds to a combination of the neighborhood structures evaluated in this paper. The performance of each neighborhood structure was tested using large random instances generated in this research and well-known benchmarks such as the Classical Symmetric Traveling Salesman Problem and the Unrelated Parallel Machines Problem. Experimental results show differences in the performance of the variable neighborhood search when it is applied to problems with differing complexity. Contrary to reports in literature about variable neighborhood searches, its performance varies according to the complexity of the problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization, Algorithms and Complexity. Dover Publications, Inc., Mineola (1998)

    Google Scholar 

  2. Arajy Yahya, Z., Abdullah, S.: Hybrid Variable Neighborhood Algorithm for Attribute Reduction in Rough Set Theory. In: 10th International Conference on Intelligent Systems Design and Applications, ISDA, Cairo, Egypt. IEEE (2010)

    Google Scholar 

  3. Hansen, P., Mladenović, N.: Variable Neighborhood Search: Principles and Applications. European Journal of Operational Research, 449–467 (1999)

    Google Scholar 

  4. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties. Springer (1999)

    Google Scholar 

  5. Liu, S.B., Ng, K.M., Ong, H.L.: A New Heuristic Algorithm for the Classical Symmetric Traveling Salesman Problem, pp. 267–271. World Academy of Science, Engineering and Technology (2007)

    Google Scholar 

  6. Fischetti, M., Salazar-González, J.J., Toth, P.: The Symmetric Generalized Traveling Salesman Polytope. Journal Networks 26(2), 113–123 (1995), CCC 0028-3045/95/020113-11

    Google Scholar 

  7. Cruz-Chávez, M.A., Martínez-Oropeza, A., Serna-Barquera, S.A.: Neighborhood Hybrid Structure for Discrete Optimization Problems. In: Proceedings of the IEEE Electronics, Robotics and Automotive Mechanics Conference, pp. 108–113. CERMA (2010) ISBN-13: 978-0-7695-4204-1

    Google Scholar 

  8. Garey, M.R., Johnson, D.S., Shethi, R.: The Complexity of Flow Shop and Job Shop Scheduling. Mathematics of Operation Research 1(2), 117–129 (1976)

    Article  MATH  Google Scholar 

  9. Lin, S., Kernighan, W.: An Effective Heuristic for the Traveling Salesman Problem. Operations Research 21(2) (1973), doi:10.1287/opre.21.2.498

    Google Scholar 

  10. González-Velázquez, R., Bandala-Garcés, M.A.: Hybrid Algorithm: Scaling Hill and Simulated Annealing to Solve the Quadratic Allowance Problem. In: González-Velázquez, R. (ed.) 3th. Latin-Iberoamerican Workshop of Operation Research, Guerrero, México (2009)

    Google Scholar 

  11. Pacheco, J., Delgado, C.: Different Experiences Results with Local Search Applied to Path Problem. Electronic Journal of Electronics of Comunications and Works ASEPUMA 2(1), 54–81 (2000) ISSN: 1575-605X

    Google Scholar 

  12. Kenneth, D.B.: Cost Versus Distance in the Traveling Salesman Problem. Dept. Los Angeles. CA 90024 1596. Citeseer. USA. UCLA Computer Science (1995)

    Google Scholar 

  13. Lourenço, H.R., Martin, O.C.: Iterated Local Search. In: Handbook of Metaheustics. International Series in Operations Research & Management Science, vol. 57, pp. 320–353. Springer (2003)

    Google Scholar 

  14. Martin, O., Otto, S.W., Felten, E.W.: Large Step Markov Chains for the Traveling Salesman Problem, pp. 299–326. Complex Systems (1991)

    Google Scholar 

  15. Martin, O., Otto, S.W., Felten, E.W.: Large Step Markov Chains for the TSP Incorporating Local Search Heuristics. Operations Reasearch, 219–224 (1992)

    Google Scholar 

  16. Pinedo, M.L.: Scheduling Theory, Algorithms, and Systems, 3rd edn., New York University. Prentice Hall (2008) ISBN: 978-0-387-78934-7, e-ISBN: 978-0-387-78935-4

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Engineering and Applied Science Research Center, Av. Universidad 1001, Col. Chamilpa, 62209, Cuernavaca, Morelos, México

    Marco Antonio Cruz-Chávez & Alina Martínez-Oropeza

  2. FCQeI, Av. Universidad 1001, Col. Chamilpa, 62209, Cuernavaca, Morelos, México

    Jesús del Carmen Peralta-Abarca

  3. FC, Av. Universidad 1001, Col. Chamilpa, 62209, Cuernavaca, Morelos, México

    Martín Heriberto Cruz-Rosales

  4. FCAeI, UAEM, Av. Universidad 1001, Col. Chamilpa, 62209, Cuernavaca, Morelos, México

    Martín Martínez-Rangel

Authors
  1. Marco Antonio Cruz-Chávez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alina Martínez-Oropeza
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jesús del Carmen Peralta-Abarca
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Martín Heriberto Cruz-Rosales
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Martín Martínez-Rangel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Częstochowa University of Technology, Armii Krajowej 36, 42-200, Częstochowa, Poland

    Leszek Rutkowski  & Rafał Scherer  & 

  2. Częstochowa University of Technology, 42-200, Częstochowa, Poland

    Marcin Korytkowski

  3. AGH University of Science and Technology, Mickiewicza 30, 30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  4. Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California Berkeley, 94720-1776, Berkeley, CA, USA

    Lotfi A. Zadeh

  5. Computational Intelligence Laboratory, Electrical and Computer Engineering, University of Louisville, 405 Lutz Hall, 40292, Louisville, KY, USA

    Jacek M. Zurada

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Cruz-Chávez, M.A., Martínez-Oropeza, A., del Carmen Peralta-Abarca, J., Cruz-Rosales, M.H., Martínez-Rangel, M. (2014). Variable Neighborhood Search for Non-deterministic Problems. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2014. Lecture Notes in Computer Science(), vol 8468. Springer, Cham. https://doi.org/10.1007/978-3-319-07176-3_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07176-3_41

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07175-6

  • Online ISBN: 978-3-319-07176-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation