Abstract
Given a set P of 3k points in general position in the plane, a Euclidean 3-matching is a partition of P into k triplets, such that the cost of each triplet (u, v, w) is the sum of the lengths of the segments \(\overline{uv}\) and \(\overline{wv}\), and the cost of the 3-matching is the sum of the costs of its triplets. We are interested in finding non-crossing Euclidean 3-matchings of minimum and maximum cost. As these are hard combinatorial problems, we present and evaluate three integer programming models and three heuristics for them.
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
Alon, N., Rajagopalan, S., Suri, S.: Long non-crossing configurations in the plane. In: Proceedings of the ninth annual symposium on computational geometry, SCG ’93, pages 257–263. New York, USA, ACM (1993)
Crama, Y., Oerlemans, A.G., Spieksma, F.: ProDuction Planning In Automated Manufacturing. Springer, Berlin (1994)
Crama, Y., Spieksma, F.C.: Approximation algorithms for three-dimensional assignment problems with triangle inequalities. Eur. J. Oper. Res. 60(3), 273–279 (1992)
Dumitrescu, A., Tóth, C.D.: Long non-crossing configurations in the plane. Discret. Comput. Geom. 44(4), 727–752 (2010)
Gurobi Optimization. Gurobi optimizer reference manual. http://www.gurobi.com/. June 2015
Johnsson, M., Leipl, T., Nevalainen, O.: Determining the manual setting order of components on PC boards. J. Manuf. Syst. 15(3), 155–163 (1996)
Johnsson, M., Magyar, G., Nevalainen, O.: On the Euclidean \(3\)-matching problem. Nord. J. Comput. 5(2), 143–171 (1998)
Magyar, G., Johnsson, M., Nevalainen, O.: On the exact solution of the Euclidean three-matching problem. Acta Cybern. 14(2), 357376 (1999)
Magyar, G., Johnsson, M., Nevalainen, O.: An adaptive hybrid genetic algorithm for the three-matching problem. IEEE Trans. Evol. Comput. 4(2), 135–146 (2000)
Spieksma, F.C., Woeginger, G.J.: Geometric three-dimensional assignment problems. Eur. J. Oper. Res. 91(3), 611–618 (1996)
Tanahashi, R., Zhi-Zhong, C.: A deterministic approximation algorithm for maximum 2-path packing. IEICE Trans. Inf. Syst. 93(2), 241–249 (2010)
Van Laarhoven, P.J.M., Zijm, W.H.M.: Production preparation and numerical control in PCB assembly. Int. J. Flex. Manuf. Syst. 5(3), 187–207 (1993)
Vazquez Casas, G., Castro Campos, R.A., Heredia Velasco, M.A., Zaragoza Martínez, F.J.: A triplet integer programming model for the Euclidean 3-matching problem. In: 12th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE 2015), 1–4 Oct 2015
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Castro Campos, R.A., Heredia Velasco, M.A., Vazquez Casas, G., Zaragoza Martínez, F.J. (2018). Integer Programming Models and Heuristics for Non-crossing Euclidean 3-Matchings. In: Maldonado, Y., Trujillo, L., Schütze, O., Riccardi, A., Vasile, M. (eds) NEO 2016. Studies in Computational Intelligence, vol 731. Springer, Cham. https://doi.org/10.1007/978-3-319-64063-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-64063-1_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64062-4
Online ISBN: 978-3-319-64063-1
eBook Packages: EngineeringEngineering (R0)