Summary
Tabu Search (TS) is a very powerful metaheuristic that has shown its efficiency when solving various combinatorial optimization problems, ranging from academic to real-life ones. The idea behind TS is to include during the search a guidance based on adaptive memory and learning. We present in this paper a short overview on Tabu Search and detail its application to solve successfully a real-life optimization problem under constraints.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Benoist, T., Rottembourg, B.: Upper Bounds of the Maximal Revenue of an Earth Observation Satellite. 4OR: A Quarterly Journal of Operations Research 2(3), 235–249 (2004)
Bensana, E., Verfaillie, G., Agnèse, J.G., Bataille, N., Blumstein, D.: Exact and Approximate Methods for the Daily Management of an Earth Observation Satellite. In: Proceeding of the 4th International Symposium od Space Mission Operations and Ground Data Systems (spaceOps 1996) (1996)
Bensana, E., Lemaître, M., Verfaillie, G.: Earth Observation Satellite Management. Constraints: An International Jounal 4(3), 293–299 (1999)
Cordeau, J.F., Laporte, G., Mercier, A.: A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows. Journal of Operational Research Society 59, 928–936 (2001)
de Werra, D., Hertz, A.: Tabu Search Techniques: A Tutorial and an Application to Neural Networks. OR Spektrum 11, 131–141 (1989)
Fleurent, C., Ferland, J.A.: Genetic and Hybrid Algorithms for Graph Coloring. Annals of Operations Research 63, 437–461 (1996)
Gabrel, V.: Improved Linear Programming Bounds via Column Generation for Daily Scheduling of Earth Observation Satellite. Technical report, LIPN (1999)
Gabrel, V., Moulet, A., Murat, C., Paschos, V.T.: A New model and derived algorithms for the satellite shot planning problem using graph theory concepts. Annals of Operations Research 69, 115–134 (1997)
Gendreau, M.: An Introduction to Tabu Search. Handbook of Metaheuristics 57, 37–54 (2003)
Gendreau, M., Guertin, F., Potvin, J., Taillard, E.: Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science 33(4), 381–390 (1999)
Gendreau, M., Laporte, G., Potvin, J.Y.: Metaheuristics for the capacitated vrp. pp. 129–154 (2001)
Gendreau, M., Soriano, P., Salvail, L.: Solving the maximum clique problem using a tabu search approach. Annals of Operations Research 41(1-4), 385–403 (1993)
Glover, F.: Tabu Search – Part I. ORSA Journal on Computing 1, 190–206 (1989)
Glover, F.: Tabu Search – Part II. ORSA Journal on Computing 2, 4–32 (1990)
Glover, F., Kochenberger, G.A.: Critical Event Tabu Search for Multidimensional Knapsack Problems. In: Osman, I.H., Kelly, J.P. (eds.) Meta-Heurisitics: Theory and Applications, pp. 407–428. Kluwer Academic Publishers, Dordrecht (1996)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
Hall, N.G., Magazine, M.J.: Maximizing the Value of a Space Mission. European Journal of Operational Research (78), 224–241 (1994)
Hanafi, S., Freville, A.: An Efficient Tabu Search Approach for the 0-1 Multidimensional Knapsack Problem. European Journal of Operational Research, Special Tabu Search Issue 106(2–3), 663–697 (1998)
Harrison, S.A., Price, M.E.: Task Scheduling for Satellite Based Imagery. In: Proceedings of the 18th Workshop of UK Planning and Scheduling Special Interest Group, pp. 64–78 (1999)
Hertz, A.: Finding a feasible course schedule using tabu search. Discrete Appl. Math. 35(3), 255–270 (1992)
Hertz, A., de Werra, D.: The Tabu Search Metaheuristic: How We Used It. Annals of Mathematics and Artificial Intelligence 1, 111–121 (1991)
McKendall Jr., A.R.: Improved Tabu search heuristics for the dynamic space allocation problem. Comput. Oper. Res. 35(10), 3347–3359 (2008)
Laguna, M., Barnes, J.W., Glover, F.: Tabu search methodology for a single machine scheduling problem. Journal of Intelligent Manufacturing 2, 63–74 (1991)
Lemaître, M., Verfaillie, G., Jouhaud, F., Lachiver, J.M., Bataille, N.: Selecting and Scheduling Observations of Agile Satellites. Aerospace Science and Technology 6(5), 367–381 (2002)
Liu, Y., Yi, Z., Wu, H., Ye, M., Chen, K.: A tabu search approach for the minimum sum-of-squares clustering problem. Inf. Sci. 178(12), 2680–2704 (2008)
ROADEF 2003 Challenge. Booklet of Abstracts. ROADEF society, France (February 2003)
Schiex, T., Fargier, F., Verfaillie, G.: Valued Constrained Satisfaction Problems: Hard and Easy problems. In: Proceedings of IJCAI 1995, 14th International Joint Conference on Artificial Intelligence, pp. 631–639 (1995)
Vasquez, M., Hao, J.K.: A Logic-Constrained Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite. Journal of Computational Optimization and Applications 20(2), 137–157 (2001)
Vasquez, M., Hao, J.K.: Upper Bounds for the SPOT5 Daily Photograph Scheduling Problem. Journal of Combinatorial Optimization 7, 87–103 (2003)
Wolf, W.J., Sorensen, S.E.: Three Scheduling Algorithms Applied to the Earth Observing Systems Domain. Management Science 46(1), 146–168 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Habet, D. (2009). Tabu Search to Solve Real-Life Combinatorial Optimization Problems: A Case of Study. In: Abraham, A., Hassanien, AE., Siarry, P., Engelbrecht, A. (eds) Foundations of Computational Intelligence Volume 3. Studies in Computational Intelligence, vol 203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01085-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-01085-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01084-2
Online ISBN: 978-3-642-01085-9
eBook Packages: EngineeringEngineering (R0)