Cooperative Parallel Tabu Search for Capacitated Network Design | Journal of Heuristics Skip to main content
Springer Nature Link
Log in

Cooperative Parallel Tabu Search for Capacitated Network Design

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

We present a cooperative parallel tabu search method for the fixed charge, capacitated, multicommodity network design problem. Several communication strategies are analyzed and compared. The resulting parallel procedure displays excellent performances in terms of solution quality and solution times. The experiments show that parallel implementations find better solutions than sequential ones. They also show that, when properly designed and implemented, cooperative search outperforms independent search strategies, at least on the class of problems of interest here.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Balakrishnan, A., T.L. Magnanti, and R.T. Wong. (1989). “ADual-Ascent Procedure for Large-Scale Uncapacitated Network Design.” Operations Research 37(5), 716–740.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Battiti, R. and G. Tecchiolli. (1992). “Parallel Based Search for Combinatorial Optimization: Genetic Algorithms and TABU.” Microprocessors and Microsystems 16(7), 351–367.

    Google Scholar 

  • Crainic, T.G. (1999). “Long Haul Freight Transportation.” In R.W. Hall (ed.), Handbook of Transportation Science Norwell, MA: Kluwer, pp. 433–491.

    Google Scholar 

  • Crainic, T.G. (2000). “Network Design in Freight Transportation.” European Journal of Operational Research 122(2), 272–288.

    Google Scholar 

  • Crainic, T.G., A. Frangioni, and B. Gendron. (2001). “Bundle-Based Relaxation Methods for Multicommodity Capacitated Network Design.” Discrete Applied Mathematics 112, 73–99.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Dantzig, G.B. and M.N. Thapa. (1997). Linear Programming: Introduction. Berlin: Springer-Verlag.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Gendron, B. and T.G. Crainic. (1994a). “Parallel Branch-and-Bound Algorithms: Survey and Synthesis.” Operations Research 42(6), 1042–1066.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Glover, F. (1989). “Tabu Search—Part I.” ORSA Journal on Computing 1(3), 190–206.

    Google Scholar 

  • Glover, F. (1990). “Tabu Search—Part II.” ORSA Journal on Computing 2(1), 4–32.

    Google Scholar 

  • Glover, F. and M. Laguna. (1997). Tabu Search. Norwell, MA: Kluwer.

    Google Scholar 

  • Grama, A. and V. Kumar. (1995). “Parallel Search Algorithms for Discrete Optimization Problems.” ORSA Journal on Computing 7(4), 365–385.

    Google Scholar 

  • Magnanti, T.L. and R.T. Wong. (1986). “Network Design and Transportation Planning: Models and Algorithms.” Transportation Science 18(1), 1–55.

    Google Scholar 

  • Minoux, M. (1986). “Network Synthesis and Optimum Network Design Problems: Models, Solution Methods and Applications.” Networks 19, 313–360.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Taillard, É.D. (1994). “Parallel Taboo Search Techniques for the Job Shop Scheduling Problem.” ORSA Journal on Computing 6(2), 108–117.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Toulouse, M., T.G. Crainic, and M. Gendreau. (1996). “Communication Issues in Designing Cooperative Multi Thread Parallel Searches.” In I.H. Osmanand J.P. Kelly (eds.), Meta-Heuristics: Theory &; Applications, Norwell, MA: Kluwer, pp. 501–522.

    Google Scholar 

  • 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.

    Google Scholar 

  • Toulouse, M., T.G. Crainic, and B. Sansó. (2002). “Systemic Behavior of Cooperative Search Algorithms.” Parallel Computing, to appear.

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre de recherche sur les transports, Université de Montréal, Canada;

    Teodor Gabriel Crainic & Michel Gendreau

  2. Département de management et technologie, Université du Québec à, Montréal, Canada

    Teodor Gabriel Crainic

Authors
  1. Teodor Gabriel Crainic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Gendreau
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Crainic, T.G., Gendreau, M. Cooperative Parallel Tabu Search for Capacitated Network Design. Journal of Heuristics 8, 601–627 (2002). https://doi.org/10.1023/A:1020325926188

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020325926188

Search

Navigation