Popmusic - partial optimization metaheuristic under special intensification conditions

Operations Research/ Computer Science Interfaces Series

Volumn 15, Issue , 2002, Pages 613-629

  Taillard, Éric D ^a   Voss, Stefan ^b  

^a UNIVERSITY OF APPLIED SCIENCES WESTERN SWITZERLAND   (Switzerland)

^b TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34848856314     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4615-1507-4     Document Type: Article

References (30)

1. 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.
2. D. Applegate and W. Cook. A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing, 3:149-156, 1991.
3. M. Ball, T. Magnanti, C. Monma, and G. Nemhauser (editors). Network Routing. Elsevier, 1995.
4. J. Brimberg, P. Hansen, N. Mladenovic, and E. D. Taillard. Improvements and Comparison of Heuristics for Solving the Multisource Weber Problem. Operations Research, 48:444-460, 2000.
5. K Biidenbender, T. Griinert, 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.
6. W.J. Conover. Practical Nonparametric Statistics. Wiley, 1999.
7. M.S. Darlow. Balancing of High-Speed Machinery. Springer-Verlag, 1989.
8. F.F. Ehrich. Handbook of Rotordynamics. McGraw-Hill, 1992.
9. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
10. F. Glover and M. Laguna. Tabu Search. Kluwer, 1997.
11. M.J. Goodwin. Dynamics of Rotor-bearing Systems. Unwin Hyman, 1989.
12. P. Hansen and N. Mladenovic. 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. Roucairol, editors, pages 422-458, Kluwer, 1999.
13. R.C. Jancey. Multidimensional Group Analysis. Australian Journal on Botany, 14:127-130, 1966.
14. G. Laporte and H. Mercure. Balancing Hydraulic 'furbine Runners: A Quadratic Assignment Problem. European Journal of Operational Research, 35:378-381, 1988.
15. A. Mason and M. Rönnqvist. Solution Methods for the Balancing of Jet 'furbines. Computers and Operations Research, 24:153-167, 1997.
16. nd Metaheuristics International Conference, page 15, Sophia-Antipolis, 1997.
17. L.S. Pitsoulis, P.M. Pardalos, and D.W. Hearn. Approximate Solutions to the 'furbine Balancing Problem. To appear in: European Journal of Operational Research.
18. G. Reinelt. TSPLIB: A Traveling Salesman Library. ORSA Journal on Computing, 3:376-384, 1991.
19. 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.
20. Y. Rochat and B.D. Taillard. Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics, 1:147-167, 1995.
21. 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.
22. H. Spath. Cluster Analysis Algorithms for Data Reduction and Classification of Objects. Ellis Horwood, 1980.
23. P. Shaw. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. Technical Report, ILOG S.A., Gentilly, 1998.
24. L. Sondergeld and S. Voss. A Star-Shaped Diversification Approach in Tabu Search. In: Meta-Heuristics: Theory and Applications, I.H. Osman and J.P. Kelly, editors, pages 489-502, Kluwer, 1996.
25. B.D. Taillard. Robust Taboo Search for the Quadratic Assignment Problem. Parallel Computing, 17:443-455, 1991.
26. E.D. Taillard. Parallel Iterative Search Methods for Vehicle Routing Problems. Networks, 23:661-673, 1993.
27. E.D. Taillard. Heuristic Methods for Large Centroid Clustering Problems. Technical Report, IDSIA-96-96, IDSIA, Lugano, 1996.
28. E.D. Taillard. Programmation a memoire adaptative et algorithms pseudo-gloutons: nouvelles perspectives pour les meta-heuristiques. Habilitation Thesis, University of Versailles, 1998.
29. E.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.
30. D.L. Woodruff. Chunking Applied to Reactive Tabu Search. In: MetaHeuristics: Theory and Applications, I.H. Osman and J.P. Kelly, editors, pages 555-569, Kluwer, 1996.