Variable Neighborhood Search for Non-deterministic Problems

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