A branch-and-cut algorithm for the plant-cycle location problem

  • M Labbé
  • I Rodríguez-Martin
  • J J Salazar-González
Theoretical Paper


The Plant-Cycle Location Problem (PCLP) is defined on a graph G=(IJ, E), where I is the set of customers and J is the set of plants. Each customer must be served by one plant, and the plant must be opened to serve customers. The number of customers that a plant can serve is limited. There is a cost of opening a plant, and of serving a customer from an open plant. All customers served by a plant are in a cycle containing the plant, and there is a routing cost associated to each edge of the cycle. The PCLP consists in determining which plants to open, the assignment of customers to plants, and the cycles containing each open plant and its customers, minimizing the total cost. It is an NP-hard optimization problem arising in routing and telecommunications. In this article, the PCLP is formulated as an integer linear program, a branch-and-cut algorithm is developed, and computational results on real-world data and randomly generated instances are presented. The proposed approach is able to find optimal solutions of random instances with up to 100 customers and 100 potential plants, and of instances on real-world data with up to 120 customers and 16 potential plants.


optimization mathematical programming telecommunications 


  1. Aardal K (1998). Capacitated facility location: separation algorithms and computational experience. Math Programming 81: 149–175.Google Scholar
  2. Billionnet A, Elloumi S and Gruoz Djerbi L (2002). Designing radio-mobile access networks based on SDH rings. Technical Report 325, Centre de Recherche en Informatique du Cnam (CEDRIC), Paris.Google Scholar
  3. Toth P and Vigo D (eds) (2001). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications: Philadelphia.Google Scholar
  4. Gourdin E, Labbé M and Yaman H (2002). Telecommunication and location. In: Drezner Z and Hamacher HW (eds). Facility Location: Applications and Theory. Springer Verlag: Berlin.Google Scholar
  5. Perl J and Daskin M (1985). A warehouse location-routing problem. Transportation Res 19B: 381–396.CrossRefGoogle Scholar
  6. Hansen PH, Hegedahl B, Hjortkjaer S and Obel B (1994). A heuristic solution to the warehouse location-rounting problem. Eur J Opl Res 25: 111–127.CrossRefGoogle Scholar
  7. Albareda M, Díaz JA and Fernández E (2002). A compact model and tight bounds for a combined location-routing problem. Technical Report CRT-2002-14, Center for Research on Transportation (CRT), Montreal.Google Scholar
  8. Padberg MW and Rinaldi G (1991). A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev 33: 60–100.CrossRefGoogle Scholar
  9. Fischetti M, Salazar JJ and Toth P (1998). Solving the orienteering problem through branch-and-cut. INFORMS J Comput 10: 133–148.CrossRefGoogle Scholar
  10. Laporte G, Nobert Y and Arpin D (1986). An exact algorithm for solving a capacitated location-routing problem. Ann Ops Res 6: 293–310.CrossRefGoogle Scholar
  11. Caprara A and Fischetti M (1997). Branch and cut algorithms. In: Dell’Amico M, Maffioli F and Martello S (eds). Annotated Bibliographies in Combinatorial Optimization. John Wiley & Sons: Chichester.Google Scholar
  12. Wolsey LA (1998). Integer Programming. Wiley-Interscience: New York.Google Scholar
  13. Jünger M and Thienel S (1998). Introduction to ABACUS—A branch-and-cut system. Ops Res Lett 22: 83–95.CrossRefGoogle Scholar
  14. Fischetti M, Romanin Jacur G and Salazar JJ (2003). Optimisation of the interconnecting network of a UMTS radio mobile telephone system. Eur J Opl Res 144: 56–67.CrossRefGoogle Scholar

Copyright information

© Palgrave Macmillan Ltd 2004

Authors and Affiliations

  • M Labbé
    • 1
  • I Rodríguez-Martin
    • 2
  • J J Salazar-González
    • 2
  1. 1.ISRO and SMG, Université Libre de BruxellesBruxellesBelgium
  2. 2.DEIOC, Universidad de La Laguna, La LagunaTenerifeSpain

Personalised recommendations