Abstract
We develop a set-cover based integer-programming approach to an optimal safety-landing-site location arising in the design of urban air-transportation networks. We link our minimum-weight set-cover problems to efficiently-solvable cases of minimum-weight set covering that have been studied. We were able to solve large random instances to optimality using our modeling approach. We carried out strong fixing, a technique that generalizes reduced-cost fixing, and which we found to be very effective in reducing the size of our integer-programming instances.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
a 0/1 matrix is totally balanced if it has no square submatrix (of any order) with two ones per row and per column, thus a subclass of balanced 0/1 matrices; see [11].
References
Bajgiran, O.S., Cire, A.A., Rousseau, L.M.: A first look at picking dual variables for maximizing reduced cost fixing. In: Salvagnin, D., Lombardi, M. (eds.) Integration of AI and OR Techniques in Constraint Programming, pp. 221–228. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-319-59776-8_18
Bárány, I., Edmonds, J., Wolsey, L.A.: Packing and covering a tree by subtrees. Combinatorica 6(3), 221–233 (1986). https://doi.org/10.1007/BF02579383
Berge, C.: Balanced matrices. Math. Program. 2(1), 19–31 (1972). https://doi.org/10.1007/BF01584535
Cerulli, M., D’Ambrosio, C., Liberti, L., Pelegrín, M.: Detecting and solving aircraft conflicts using bilevel programming. J. Glob. Optim. 81(2), 529–557 (2021). https://doi.org/10.1007/s10898-021-00997-1
Cornuéjols, G.: Combinatorial Optimization: Packing and Covering. SIAM (2001). https://doi.org/10.1137/1.9780898717105
Cornuéjols, G., Novick, B.: Ideal 0,1 matrices. J. Comb. Theory Series B 60(1), 145–157 (1994). https://doi.org/10.1006/jctb.1994.1009
Crowder, H., Johnson, E.L., Padberg, M.: Solving large-scale zero-one linear programming problems. Oper. Res. 31(5), 803–834 (1983). https://doi.org/10.1287/opre.31.5.803
FAA: Urban Air Mobility (UAM) Concept of Operations, version 2.0 (2023). https://www.faa.gov/air-taxis/uam_blueprint
Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12(3), 133–137 (1981). https://doi.org/10.1016/0020-0190(81)90111-3
Fulkerson, D.R., Hoffman, A.J., Oppenheim, R.: On balanced matrices. In: Balinski, M.L. (ed.) Pivoting and Extensions. Mathematical Programming Studies, vol. 1, pp. 120–132 (1974). https://doi.org/10.1007/BFb0121244
Hoffman, A.J., Kolen, A.W., Sakarovitch, M.: Totally-balanced and greedy matrices. SIAM J. Algebr. Disc. Methods 6(4), 721–730 (1985). https://doi.org/10.1137/0606070
NASA: UAM Vision Concept of Operations (ConOps) UAM Maturity Level (UML) 4 (2021). https://ntrs.nasa.gov/citations/20205011091
Pelegrín, M., D’Ambrosio, C.: Aircraft deconfliction via mathematical programming: review and insights. Transport. Sci. 56(1), 118–140 (2022). https://doi.org/10.1287/trsc.2021.1056
Pelegrín, M., D’Ambrosio, C., Delmas, R., Hamadi, Y.: Urban air mobility: from complex tactical conflict resolution to network design and fairness insights. Optim. Methods Softw. 38(6), 1311–1343 (2023). https://doi.org/10.1080/10556788.2023.2241148
Pelegrín, M., Xu, L.: Continuous covering on networks: improved mixed integer programming formulations. Omega 117, 102835 (2023). https://doi.org/10.1016/j.omega.2023.102835
Schrijver, A.: Theory of linear and integer programming. In: Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons, Ltd., Chichester (1986). ISBN: 0-471-90854-1
Serhal, K., Macias, J.J.E., Angeloudis, P.: Demand modelling and optimal vertiport placement for airport-purposed eVTOL services (2021). https://optimization-online.org/?p=18217
Villa, A.: Hub Location Problem For Optimal Vertiport Selection In Urban Air Mobility — Chicago Case Study. Masters Thesis, Politecnico di Milano (2020). https://doi.org/10.25417/uic.22226494.v1
Xu, L.: Optimal location of safety landing sites. Research Report, LIX, École Polytechnique (2021). https://hal.science/hal-03286640
Acknowledgments
This work was supported by NSF grant DMS-1929284 while C. D’Ambrosio, M. Fampa and J. Lee were in residence at ICERM (the Institute for Computational and Experimental Research in Mathematics; Providence, RI) during the Discrete Optimization program, 2023. C. D’Ambrosio was supported by the Chair “Integrated Urban Mobility”, backed by L’X - École Polytechnique and La Fondation de l’École Polytechnique (The Partners of the Chair accept no liability related to this publication, for which the chair holder is solely liable). M. Fampa was supported by CNPq grant 307167/2022-4. J. Lee was supported by the Gaspard Monge Visiting Professor Program, École Polytechnique, and from ONR grant N00014-21-1-2135. F. Sinnecker was supported on a masters scholarship from CNPq. J. Lee and M. Fampa acknowledge (i) interesting conversations at ICERM with Zhongzhu Chen on variable fixing, and (ii) some helpful information from Tobias Achterberg on Gurobi presolve.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Ethics declarations
Disclosure of Interests
The authors have no competing interests to declare.
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
D’Ambrosio, C., Fampa, M., Lee, J., Sinnecker, F. (2024). On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location. In: Basu, A., Mahjoub, A.R., Salazar González, J.J. (eds) Combinatorial Optimization. ISCO 2024. Lecture Notes in Computer Science, vol 14594. Springer, Cham. https://doi.org/10.1007/978-3-031-60924-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-031-60924-4_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-60923-7
Online ISBN: 978-3-031-60924-4
eBook Packages: Computer ScienceComputer Science (R0)