Optimal Location of Welds on the Vehicle Wiring Harness: P-Median Based Exact and Heuristic Approaches

  • Maurizio Boccia
  • Adriano Masone
  • Antonio Sforza
  • Claudio SterleEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12095)


Nowadays vehicles are highly customizable products. Indeed, they can be equipped with a great number of options directly chosen by the customers. This situation provides several harness design problems to automotive companies, where by harness we mean the set of conducting wires (cables), positioned within the vehicle frame (chassis), which transmit information and electrical power to the options to make them operative. In this context we focus on an optimization problem arising in the construction and assembly phase of the harness within a vehicle. The options selected by customers have to be connected through a harness shaped in a tree structure within the vehicle chassis. In particular, the wiring has to connect subsets composed of two or more options. The total length of the connecting cables could be very large if a dedicated cable would be used for each couple of options in each subset. This length can be significantly reduced by realizing the connection through the usage of cable weldings. This work introduces for the first time the problem of the optimal placement of the weldings on the wiring harness tree of a vehicle, aimed at minimizing the total length and/or the cost of the cables, weighted by their gauge. The problem can be schematized as a p-median problem (PMP) on a tree in a continuous and discrete domain, with additional technological constraints related to the welding positions and mutual distance. This work proposes an integer linear programming model and a matheuristic aimed at finding exact and/or heuristic solutions for this constrained PMP. The efficiency and the effectiveness of the proposed methodologies have been proved through the solution of test instances built from real data provided by an automotive company.


Harness design Optimal diversity management P-median with mutual distance ILP formulation and matheuristic 


  1. 1.
    Agra, A., Cardoso, D.M., Cerdeira, J.O., Miranda, M., Rocha, E.: Solving huge size instances of the optimal diversity management problem. J. Math. Sci. 161(6), 956–960 (2009)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Agra, A., Cerdeira, J.O., Raquejo, C.: Using decomposition to improve greedy solutions of the optimal diversity management. Int. Trans. Oper. Res. 20(6), 617–625 (2013)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Agra, A., Cerdeira, J.O., Requejo, C.: A decomposition approach for the p-median problem on disconnected graphs. Comput. Oper. Res. 86, 79–85 (2017)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Agra, A., Requejo, C.: The linking set problem: a polynomial special case of the multiple-choice knapsack problem. J. Math. Sci. 161(6), 919–929 (2009)MathSciNetCrossRefGoogle Scholar
  5. 5.
    An, H.-C., Svensson, O.: Recent developments in approximation algorithms for facility location and clustering problems. In: Fukunaga, T., Kawarabayashi, K. (eds.) Combinatorial Optimization and Graph Algorithms, pp. 1–19. Springer, Singapore (2017). Scholar
  6. 6.
    Avella, P., Boccia, M., Martino, C.D., Oliviero, G., Sforza, A., Vasilyev, I.: A decomposition approach for a very large scale optimal diversity management problem. 4OR 3(1), 23–37 (2005). Scholar
  7. 7.
    Briant, O., Naddef, D.: The optimal diversity management problem. Oper. Res. 52(4), 515–526 (2004)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Boccia, M., Masone, A., Sforza, A., Sterle, C.: A partitioning based heuristic for a variant of the simple pattern minimality problem. In: Sforza, A., Sterle, C. (eds.) ODS 2017. SPMS, vol. 217, pp. 93–102. Springer, Cham (2017). Scholar
  9. 9.
    Boccia, M., Sforza, A., Sterle, C.: Simple pattern minimality problems: integer linear programming formulations and covering-based heuristic solving approaches. Informs J. Comput., 93–102 (2020). to appear
  10. 10.
    Cheng, Y., Kang, L., Lu, C.: The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers. Theor. Comput. Sci. 411(7–9), 1038–1044 (2010)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Daskin, M.S., Maass, K.L.: The p-Median Problem. In: Laporte, G., Nickel, S., da Gama, F.S. (eds.) Location Science, pp. 21–45. Springer, Cham (2015). Scholar
  12. 12.
    Drezner, Z., Hamacher, H.W.: Facility Location: Applications and Theory. Springer, Heidelberg (2004)zbMATHGoogle Scholar
  13. 13.
    Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3), 450–459 (1964)CrossRefGoogle Scholar
  14. 14.
    Masone, A., Sterle, C., Vasilyev, I., Ushakov, A.: A three-stage p-median based exact method for the optimal diversity management problem. Networks 74(2), 174–189 (2019)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Masone, A., Sforza, A., Sterle, C., Vasiliev, I.: A graph clustering based decomposition approach for large scale p-median problems. Int. J. Artif. Intell. 16(1), 116–129 (2018)Google Scholar
  16. 16.
    Mladenovic, N., Brimberg, J., Hansen, P., Moreno-Pérez, J.A.: The p-median problem: a survey of metaheuristic approaches. Eur. J. Oper. Res. 179(3), 927–939 (2007)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Reese, J.: Solution methods for the p-median problem: an annotated bibliography. Networks 28(3), 125–142 (2006)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of Electrical Engineering and Information TechnologyUniversity Federico II of NaplesNaplesItaly
  2. 2.Istituto di Analisi dei Sistemi ed Informatica A. Ruberti, IASI-CNRRomeItaly

Personalised recommendations