Abstract
We propose Feasibility Pump heuristics for the crucial problem of aircraft conflict avoidance arising in air traffic management. This problem can be modeled as a mixed integer nonlinear optimization problem, whose solution can be very computationally demanding. Feasibility Pump is an iterative algorithm that, at each iteration, solves alternatively two easier subproblems represented by relaxations of the original problem, minimizing the distance between their solutions. We propose in this paper specific formulations for the subproblems to be handled, tailored to the problem at hand. Numerical results show that, on the considered test problems, good-quality, in some cases optimal, feasible solutions are always obtained.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
