Abstract
We will certainly deceive those readers who were patient enough to read the present book until now and who would know which metaheuristic they should try first for solving the problem under their consideration. Indeed, this question is a perfectly legitimate one, but we must confess that it is not possible to recommend one specific technique or the other. It has been seen that the weak theoretical results known about the metaheuristics are almost of no use in practice. Indeed, in a sense these theorems state that to ensure that the optimum is correctly determined, it is required to examine a number of solutions that is higher than the total number of solutions of the problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Alvim, A.C.F., Taillard, É.D.: POPMUSIC for the world location-routing problem. EURO Journal on Transportation and Logistics 2(3), 231–254 (2013). URL http://mistic.heig-vd.ch/taillard/articles.dir/AlvimTaillard2013.pdf
Cahon, S., Melab, N., Talbi, E.G.: Paradiseo: A framework for the reusable design of parallel and distributed metaheuristics. Journal of Heuristics 10(3), 357–380 (2004)
Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: N. Christofides, A. Mingozzi, P. Toth, C. Sandi (eds.) Combinatorial Optimization, pp. 315–338. Wiley (1979)
Conover, W.J.: Practical Nonparametric Statistics, 3rd edn. Wiley, Weinheim (1999)
Davison, A.C., Hinkley, D.: Bootstrap Methods and Their Application, 5th edn. Cambridge University Press (2003)
Efron, B., Tibshirani, R.J.: An Introduction to the Bootstrap. Chapman and Hall (1993)
Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276–1290 (1994)
Glover, F.: Heuristics for integer programming using surrogate constraints. Decision Sciences 8(1), 156–166 (1977)
Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1997)
Hansen, P., Mladenović, N.: An introduction to variable neighborhood search. In: S. Voß, S. Martello, I.H. Osman, C. Roucairol (eds.) Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 422–458. Kluwer, Dordrecht (1999)
Mautor, T., Michelon, P.: MIMAUSA: A new hybrid method combining exact solution and local search. In: 2nd International Conference on Metaheuristics, Sophia-Antipolis, France, p. 15 (1997)
Moscato, P.: Memetic algorithms: A short introduction. In: D. Corne, F. Glover, M. Dorigo (eds.) New Ideas in Optimisation, pp. 219–235. McGraw-Hill, London (1999)
Mühlenbein, H., Gorges-Schleuter, M., Krämer, O.: Evolution algorithms in combinatorial optimization. Parallel Computing 7, 65–88 (1988)
Rochat, Y., Semet, F.: A tabu search approach for delivering pet food and flour in Switzerland. Journal of the Operational Research Society 45, 1233–1246 (1994)
Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1(1), 147–167 (1995)
Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. Technical report, ILOG S.A., Gentilly, France (1998)
Taillard, E.D.: Parallel iterative search methods for vehicle routing problems. Networks 23, 661–673 (1993)
Taillard, E.D.: Programmation à mémoire adaptative et algorithmes pseudo-gloutons : nouvelles perspectives pour les méta-heuristiques. Thèse d’habilitation à diriger des recherches, Université de Versailles, France (1998)
Taillard, E.D.: Principes d’implémentation des méta-heuristiques. In: J. Teghem, M. Pirlot (eds.) Optimisation approchée en recherche opérationnelle, pp. 57–79. Lavoisier, Paris (2002).
Taillard, E.D.: Heuristic methods for large centroid clustering problems. Journal of Heuristics 9(1), 51–73 (2003)
Taillard, E.D.: A statistical test for comparing success rates. In: Metaheuristic International Conference MIC’03, Kyoto, Japan (2003)
Taillard, E.D., Gambardella, L.M., Gendreau, M., Potvin, J.Y.: Adaptive memory programming: A unified view of meta-heuristics. European Journal of Operational Research 135(1), 1–16 (1998)
Taillard, E.D., Voß, S.: POPMUSIC—partial optimization meta-heuristic under special intensification conditions. In: C. Ribeiro, P. Hansen (eds.) Essays and Surveys in Metaheuristics, pp. 613–629. Kluwer, Dordrecht (2002)
Voß, S., Woodruff, D.L.: Optimization Software Class Libraries. OR/CS Interfaces Series. Kluwer, Dordrecht (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Taillard, E. (2016). Methodology. In: Siarry, P. (eds) Metaheuristics. Springer, Cham. https://doi.org/10.1007/978-3-319-45403-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-45403-0_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45401-6
Online ISBN: 978-3-319-45403-0
eBook Packages: Computer ScienceComputer Science (R0)