Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
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)
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)
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)
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). https://doi.org/10.1007/978-981-10-6147-9_1
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). https://doi.org/10.1007/s10288-004-0059-1
Briant, O., Naddef, D.: The optimal diversity management problem. Oper. Res. 52(4), 515–526 (2004)
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). https://doi.org/10.1007/978-3-319-67308-0_10
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). https://doi.org/10.1287/ijoc.2019.0940. to appear
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)
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). https://doi.org/10.1007/978-3-319-13111-5_2
Drezner, Z., Hamacher, H.W.: Facility Location: Applications and Theory. Springer, Heidelberg (2004)
Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3), 450–459 (1964)
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)
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)
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)
Reese, J.: Solution methods for the p-median problem: an annotated bibliography. Networks 28(3), 125–142 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Boccia, M., Masone, A., Sforza, A., Sterle, C. (2020). Optimal Location of Welds on the Vehicle Wiring Harness: P-Median Based Exact and Heuristic Approaches. In: Kononov, A., Khachay, M., Kalyagin, V., Pardalos, P. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2020. Lecture Notes in Computer Science(), vol 12095. Springer, Cham. https://doi.org/10.1007/978-3-030-49988-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-49988-4_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-49987-7
Online ISBN: 978-3-030-49988-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)