Cooperative parallel tabu search for capacitated network design

Journal of Heuristics

Volumn 8, Issue 6, 2002, Pages 601-627

  Crainic, Teodor Gabriel ^a,b   Gendreau, Michel ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

Cooperative search; Parallel tabu search; Service network design

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; PROBLEM SOLVING; SET THEORY;

CAPACITATED NETWORK DESIGN; COOPERATIVE SEARCH; PARALLEL TABU SEARCH; SERVICE NETWORK DESIGN;

OPTIMIZATION;

EID: 0036849199     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1020325926188     Document Type: Article

References (43)

1. Aiex, R.M., S.L. Martins, C.C. Ribeiro, and N.R. Rodriguez. (1998). "Cooperative Multi-Thread Parallel Tabu Search with an Application to Circuit Partitioning." In Proceedings of IRREGULAR'98-5th International Symposium on Solving Irregularly Structured Problems in Parallel, Lecture Notes in Computer Science, Vol. 1457, Berlin: Springer-Verlag, pp. 310-331.
2. Badeau, P., F. Guertin, M. Gendreau, J.-Y. Potvin, and É.D. Taillard. (1997). "A Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows." Transportation Research C: Emerging Technologies 5(2), 109-122.
3. Balakrishnan, A., T.L. Magnanti, and P. Mirchandani. (1997). "Network Design." In M. Dell'Amico, F. Maffioli, and S. Martello (eds.), Annotated Bibliographies in Combinatorial Optimization, New York: John Wiley & Sons, pp. 311-334.
4. Balakrishnan, A., T.L. Magnanti, and R.T. Wong. (1989). "A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design." Operations Research 37(5), 716-740.
5. Barr, R.S., B.L. Golden, J.P. Kelly, M.G.C. Resende, and W.R. Stewart. (1995). "Designing and Reporting on Computational Experiments with Heuristic Methods." Journal of Heuristics 1(1), 9-32.
6. Barr, R.S. and B.L. Hickman. (1993). "Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts Opinions." ORSA Journal on Computing 5(1), 2-18.
7. Battiti, R. and G. Tecchiolli. (1992). "Parallel Based Search for Combinatorial Optimization: Genetic Algorithms and TABU." Microprocessors and Microsystems 16(7), 351-367.
8. Crainic, T.G. (1999). "Long Haul Freight Transportation." In R.W. Hall (ed.), Handbook of Transportation Science Norwell, MA: Kluwer, pp. 433-491.
9. Crainic, T.G. (2000). "Network Design in Freight Transportation." European Journal of Operational Research 122(2), 272-288.
10. Crainic, T.G., A. Frangioni, and B. Gendron. (2001). "Bundle-Based Relaxation Methods for Multicommodity Capacitated Network Design." Discrete Applied Mathematics 112, 73-99.
11. Crainic, T.G. and M. Gendreau. (1998). "Cooperative Parallel Tabu Search for Capacitated Network Design." Publication CRT-98-71, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada.
12. Crainic, T.G., M. Gendreau, and J.M. Farvolden. (1998). "A Simplex-Based Tabu Search Method for Capacitated Network Design." Publication CRT-98-37, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada.
13. Crainic, T.G., M. Gendreau, and J.M. Farvolden. (2000). "A Simplex-Based Tabu Search Method for Capacitated Network Design." INFORMS Journal on Computing 12(3), 223-236.
14. Crainic, T.G. and M. Toulouse. (1998). "Parallel Metaheuristics." In T.G. Crainic and G. Laporte (eds.), Fleet Management and Logistics, Norwell, MA: Kluwer, pp. 205-251.
15. Crainic, T.G., M. Toulouse, and M. Gendreau. (1995a). "Synchronous Tabu Search Parallelization Strategies for Multicommodity Location-Allocation with Balancing Requirements." OR Spektrum 17(2/3), 113-123.
16. Crainic, T.G., M. Toulouse, and M. Gendreau. (1995b). "Parallel Asynchronous Tabu Search for Multicommodity Location-Allocation with Balancing Requirements." Annals of Operations Research 63, 277-299.
17. Crainic, T.G., M. Toulouse, and M. Gendreau. (1997). "Towards a Taxonomy of Parallel Tabu Search Algorithms." INFORMS Journal on Computing 9(1), 61-72.
18. Dantzig, G.B. and M.N. Thapa. (1997). Linear Programming: Introduction. Berlin: Springer-Verlag.
19. Farvolden, J.M., W.B. Powell, and I.J. Lustig. (1992). "A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem." Operations Research 41(4), 669-694.
20. Gendreau, M., F. Guertin, J.-Y. Potvin, and E.D. Taillard. (1999). "Tabu Search for Real-Time Vehicle Routing and Dispatching." Transportation Science 33(4), 381-390.
21. Gendron, B. and T.G. Crainic. (1994a). "Parallel Branch-and-Bound Algorithms: Survey and Synthesis." Operations Research 42(6), 1042-1066.
22. Gendron, B. and T.G. Crainic. (1994b). "Relaxations for Multicommodity Network Design Problems." Publication CRT-965, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada.
23. Gendron, B. and T.G. Crainic. (1996). "Bounding Procedures for Multicommodity Capacitated Network Design Problems." Publication CRT-96-06, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada.
24. Gendron, B., T.G. Crainic, and A. Frangioni. (1998). "Multicommodity Capacitated Network Design." In B. Sansó and P. Soriano (eds.), Telecommunications Network Planning, Norwell, MA: Kluwer, pp. 1-19.
25. Glover, F. (1989). "Tabu Search-Part I." ORSA Journal on Computing 1(3), 190-206.
26. Glover, F. (1990). "Tabu Search-Part II." ORSA Journal on Computing 2(1), 4-32.
27. Glover, F. and M. Laguna. (1997). Tabu Search. Norwell, MA: Kluwer.
28. Grama, A. and V. Kumar. (1995). "Parallel Search Algorithms for Discrete Optimization Problems." ORSA Journal on Computing 7(4), 365-385.
29. Magnanti, T.L. and R.T. Wong. (1986). "Network Design and Transportation Planning: Models and Algorithms." Transportation Science 18(1), 1-55.
30. Minoux, M. (1986). "Network Synthesis and Optimum Network Design Problems: Models, Solution Methods and Applications." Networks 19, 313-360.
31. Ouyang, M., M. Toulouse, K. Thulasiraman, F. Glover, and J.S. Deogun. (2000). "Multi-Level Cooperative Search: Application to the Netlist/Hypergraph Partitioning Problem." In Proceedings of International Symposium on Physical Design. New York: ACM Press, pp. 192-198.
32. Ouyang, M., M. Toulouse, K. Thulasiraman, F. Glover, and J.S. Deogun. (2002). "Multi-Level Cooperative Search for the Circuit/Hypergraph Partitioning Problem." IEEE Transactions on Computer-Aided Design 21(6), 685-693.
33. Rego, C. and C. Roucairol. (1996). "A Parallel Tabu Search Algorithm Using Ejection Chains for the VRP." In I.H. Osman and J.P. Kelly (eds.), Meta-Heuristics: Theory & Applications, Norwell, MA: Kluwer, pp. 253-295.
34. Schulze, J. and T. Fahle. (1999). "A Parallel Algorithm for the Vehicle Routing Problem with Time Window Constraints." Annals of Operations Research 86, 585-607.
35. Taillard, É.D. (1994). "Parallel Taboo Search Techniques for the Job Shop Scheduling Problem." ORSA Journal on Computing 6(2), 108-117.
36. Taillard, É.D., P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin. (1997). "A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows." Transportation Science 31, 170-186.
37. Toulouse, M. (1996). "Heuristiques parallèles de recherche sans contrôle global explicite." Ph.D. Thesis, École Polythecnique, Université de Montréal, Montréal, Canada.
38. Toulouse, M., T.G. Crainic, and M. Gendreau. (1996). "Communication Issues in Designing Cooperative Multi Thread Parallel Searches." In I.H. Osman and J.P. Kelly (eds.), Meta-Heuristics: Theory & Applications, Norwell, MA: Kluwer, pp. 501-522.
39. Toulouse, M., T.G. Crainic, and B. Sansó. (1999). "An Experimental Study of Systemic Behavior of Cooperative Search Algorithms." In S. Voß, S. Martello, C. Roucairol, and I.H. Osman (eds.), Meta-Heuristics 98: Theory & Applications, Norwell, MA: Kluwer, pp. 373-392.
40. Toulouse, M., T.G. Crainic, and B. Sansó. (2002). "Systemic Behavior of Cooperative Search Algorithms." Parallel Computing, to appear.
41. Toulouse, M., T.G. Crainic, B. Sansó, and K. Thulasiraman. (1998). "Self-Organization in Cooperative Search Algorithms." In Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics. Madison, WI: Omnipress, pp. 2379-2385.
42. Toulouse, M., T.G. Crainic, and K. Thulasiraman. (2000). "Global Optimization Properties of Parallel Cooperative Search Algorithms: A Simulation Study." Parallel Computing 26(1), 91-112.
43. Toulouse, M., K. Thulasiraman, and F. Glover. (1999). "Multi-Level Cooperative Search." In P. Amestoy, P. Berger, M. Daydé, I. Duff, V. Frayssé, L. Giraud, and D. Ruiz (eds.), 5th International Euro-Par Parallel Processing Conference, Lecture Notes in Computer Science, Vol. 1685, Berlin: Springer-Verlag, pp. 533-542.