Abstract
This article introduces POPMUSIC, a meta-heuristic that has been successfully applied to various combinatorial optimization problems. This meta-heuristic is especially useful for designing heuristic methods for large combinatorial problems that can be partially optimized. The basic idea is to optimize sub-parts of solutions until a local optimum is reached. Implementations of the technique to large centroid clustering and to the problem of balancing mechanical parts are shown to be very efficient.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Angel and V. Zissimopoulos. On the Landscape Ruggedness of the Quadratic Assignment Problem. Presented at the International Workshop on Combinatorics and Computer Science LIX-CNRS, Palaiseau, 1997.
D. Applegate and W. Cook. A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing, 3:149–156, 1991.
M. Ball, T. Magnanti, C. Monma, and G. Nemhauser (editors). Network Routing. Elsevier, 1995.
J. Brimberg, P. Hansen, N. Mladenović, and É. D. Taillard. Improvements and Comparison of Heuristics for Solving the Multisource Weber Problem. Operations Research, 48:444–460, 2000.
K. Büdenbender, T. Grünert, and H.-J. Sebastian. A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem. Transportation Science, 34:364–380, 2000.
W.J. Conover. Practical Nonparametric Statistics. Wiley, 1999.
M.S. Darlow. Balancing of High-Speed Machinery. Springer-Verlag, 1989.
F.F. Ehrich. Handbook of Rotordynamics. McGraw-Hill, 1992.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
F. Glover and M. Laguna. Tabu Search. Kluwer, 1997.
M.J. Goodwin. Dynamics of Rotor-bearing Systems. Unwin Hyman, 1989.
P. Hansen and N. Mladenović. An Introduction to Variable Neighborhood Search. In: Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Voss, S. Martello, I.H. Osman and C. Rou-cairol, editors, pages 42–458, Kluwer, 1999.
R.C. Jancey. Multidimensional Group Analysis. Australian Journal on Botany, 14:127–130, 1966.
G. Laporte and H. Mercure. Balancing Hydraulic Turbine Runners: A Quadratic Assignment Problem. European Journal of Operational Research. 35:378-381, 1988.
A. Mason and M. Rönnqvist. Solution Methods for the Balancing of Jet Turbines. Computers and Operations Research, 24:153–167, 1997.
T. Mautor and P. Michelon. MIMAUSA: A New Hybrid Method Combining Exact Solution and Local Search. Extended Abstracts of the 2nd Metaheuristics International Conference, page 15, Sophia-Antipolis, 1997.
L.S. Pitsoulis, P.M. Pardalos, and D.W. Hearn. Approximate Solutions to the Turbine Balancing Problem. To appear in: European Journal of Operational Research.
G. Reinelt. TSPLIB: A Traveling Salesman Library. ORSA Journal on Computing, 3:376–384, 1991.
Y. Rochat and F. Semet. A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland. Journal of the Operational Research Society, 45:1233–1246, 1994.
Y. Rochat and É.D. Taillard. Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics, 1:147–167, 1995.
L.-M. Rousseau, M. Gendreau, and G. Pesant. Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows. To appear in: Journal of Heuristics.
H. Späth. Cluster Analysis Algorithms for Data Reduction and Classification of Objects. Ellis Horwood, 1980.
P. Shaw. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. Technical Report, ILOG S.A., Gentilly, 1998.
L. Sondergeld and S. Voss. A Star-Shaped Diversification Approach in Tabu Search. In: Meta-Heuristics: Theory and Applications, LH. Osman and J.P. Kelly, editors, pages 489–502, Kluwer, 1996.
É.D. Taillard. Robust Taboo Search for the Quadratic Assignment Problem. Parallel Computing, 17:443–455, 1991.
É.D. Taillard. Parallel Iterative Search Methods for Vehicle Routing Problems. Networks, 23:661–673, 1993.
É.D. Taillard. Heuristic Methods for Large Centroid Clustering Problems. Technical Report, IDSIA-96-96, IDSIA, Lugano, 1996.
É.D. Taillard. Programmation à mémoire adaptative et algorithmes pseudo-gloutons: nouvelles perspectives pour les méta-heuristiques. Habilitation Thesis, University of Versailles, 1998.
[29] É.D. Taillard, L.M. Gambardella, M. Gendreau. and J.-Y. Potvin. Adaptive Memory Programming: A Unified View of Meta-Heuristics. To appear in: European Journal of Operational Research.
D.L. Woodruff. Chunking Applied to Reactive Tabu Search. In: Meta-Heuristics: Theory and Applications, LH. Osman and J.P. Kelly, editors, pages 555–569, Kluwer, 1996.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Taillard, É.D., Voss, S. (2002). Popmusic — Partial Optimization Metaheuristic under Special Intensification Conditions. In: Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 15. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1507-4_27
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1507-4_27
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5588-5
Online ISBN: 978-1-4615-1507-4
eBook Packages: Springer Book Archive