Looking ahead with the pilot method

Annals of Operations Research

Volumn 136, Issue 1, 2005, Pages 285-302

  Voßs, Stefan ^a   Fink, Andreas ^a   Duin, Cees ^b  

^a UNIVERSITY OF HAMBURG   (Germany)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Combinatorial optimization; Meta heuristics; Pilot method; Rollout method

Indexed keywords

EID: 18844398347     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-005-2060-2     Document Type: Conference Paper

References (35)

1. Amberg, A., L. Gouveia, P. Martins, and S. Voß. (1999). "Iterative Heuristic Metastrategies." In MIC'99, Third Metaheuristics International Conference, Angra dos Reis, Rio de Janeiro, Brazil, July 19-23, 1999, pp. 13-16.
2. Balas, E. and A. Vazacopoulos. (1998). "Guided Local Search with Shifting Bottleneck for Job Shop Scheduling." Management Science 44, 262-275.
3. Belvaux, G., N. Boissin, A. Sutter, and L.A. Wolsey. (1998). "Optimal Placement of Add/Drop Multiplexers: Static and Dynamic Models." European Journal of Operational Research 108, 26-35.
4. Bertsekas, D.P. and D.A. Castanon. (1999). "Rollout Algorithms for Stochastic Scheduling Problems." Journal of Heuristics 5, 89-108.
5. Bertsekas, D.P., J.N. Tsitsiklis, and C. Wu. (1997). "Rollout Algorithms for Combinatorial Optimization." Journal of Heuristics 3, 245-262.
6. Caseau, Y., F. Laburthe, and G. Silverstein. (1999). "A Meta-Heuristic Factory for Vehicle Routing Problems." In J. Jaffar (ed.), Principles and Practice of Constraint Programming-CP '99, Lecture Notes in Computer Science, 1713, Berlin: Springer, pp. 144-158.
7. Cosares, S. and I. Saniee. (1994). "An Optimization Problem Related to Balancing Loads on SONET Rings." Telecommunication Systems 3, 165-181.
8. Dudek, R.A., S.S. Panwalkar, and M.L. Smith. (1992). "The Lessons of Flowshop Scheduling Research." Operations Research 40, 7-13.
9. Duin, C.W. and S. Voß. (1994). "Steiner Tree Heuristics-A Survey." In H. Dyckhoff, U. Derigs, M. Salomon, and H.C. Tijms. (Eds.), Operations Research Proceedings 1993, Berlin: Springer, pp. 485-496.
10. Duin, C.W. and S. Voß. (1999). "The Pilot Method: A Strategy for Heuristic Repetition with Application to the Steiner Problem in Graphs." Networks 34, 181-191.
11. Fink, A., G. Schneidereit, and S. Voß. (2000). "Solving General Ring Network Design Problems by Meta-Heuristics." In M. Laguna and J.L. González Velarde (eds.), Computing Tools for Modeling, Optimization and Simulation, Boston: Kluwer, pp. 91-113.
12. Fink, A. and S. Voß. (1999). "Applications of Modern Heuristic Search Methods to Pattern Sequencing Problems." Computers & Operations Research 26, 17-34.
13. Fink, A. and S. Voß. (2001). "Efficient Meta-Heuristics Approaches for Ring Load Balancing." In Proceedings of the 9th International Conference on Telecommunication Systems, 243-250. Southern Methodist University, Dallas.
14. Fink, A. and S. Voß. (2003). "Solving the Continuous Flow-Shop Scheduling Problem by Metaheuristics." European Journal of Operational Research 151, 400-414.
15. Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability-A Guide to the Theory of NP-completeness." New York: Freeman.
16. Gavish, B. (1991). "Manifold Search Techniques Applied to Quadratic Assignement Problems (QAP)." Working paper, Owen Graduate School of Management, Vanderbilt University, Nashville.
17. Gendreau, M., M. Labbé, and G. Laporte. (1995). "Efficient Heuristics for the Design of Ring Networks." Telecommunication Systems 4, 177-188.
18. Glover, F. (1998). "A Template for Scatter Search and Path Relinking." In J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers (eds.), Artificial Evolution, Lecture Notes in Computer Science, 1363, Berlin: Springer, pp. 13-54.
19. Glover, F., E. Taillard, and D. de Werra. (1993). "A User's Guide to Tabu Search." Annals of Operations Research 41, 3-28.
20. Gouveia, L. and S. Voß. (1995). "A Classification of Formulations for the (Time-Dependent) Traveling Salesman Problem." European Journal of Operational Research 83, 69-82.
21. Harvey, W. and M. Ginsberg. (1995). "Limited Discrepancy Search." In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), Morgan Kaufmann, San Mateo, pp. 607-615.
22. Karp, R. (1972). "Reducibility Among Combinatorial Problems." In R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, New York: Plenum Press, pp. 85-103.
23. Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys. (1985). The Traveling Salesman Problem. Chichester: Wiley.
24. Meloni, C., D. Pacciarelli, and M. Pranzo. (2004). "A Rollout Metaheuristic for Job Shop Scheduling Problems." Annals of Operations Research 131, 215-235.
25. Myung, Y.-S., H.-G. Kim, and D.-W. Tcha. (1997). "Optimal Load Balancing on SONET Bidirectional Rings." Operations Research 45, 148-152.
26. Pearl, J. (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Reading, Addison-Wesley.
27. Picard, J.-C. and M. Queyranne. (1978). "The Time-Dependent Traveling Salesman Problem and its Application to the Tardiness Problem in One-Machine Scheduling." Operations Research 26, 86-110.
28. Rayward-Smith, V.J. and A. Clare. (1986). "On Finding Steiner Vertices." Networks 16, 283-294.
29. Shyu, S.J., P.-Y. Yin, and B.M.T. Lin. (2004). "An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem." Annals of Operations Research 131, 283-304.
30. Sourd, F. (2001). "Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures." Journal of Heuristics 7, 519-531.
31. Sourd, F. and P. Chrétienne. (1999). "Fiber-to-object Assignment Heuristics." European Journal of Operational Research 117, 1-14.
32. Taillard, E. (1993). "Benchmarks for Basic Scheduling Instances." European Journal of Operational Research 64, 278-285.
33. Voß, S. (1990). Steiner-Probleme in Graphen. Frankfurt am Main: Hain.
34. Voß, S., S. Martello, I.H. Osman, and C. Roucairol (eds.) (1999). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston: Kluwer.
35. Voudouris, C. and E.P.K. Tsang. (2003). "Guided Local Search." In F. Glover and G.A. Kochenberger (eds.), Handbook of Metaheuristics. Boston: Kluwer, pp. 185-218.