Abstract
In this paper, we study in detail the problem and its chance-constrained variant. Like, the chance-constrained problem is strongly -hard, and solving it exactly is out of reach, even for moderate realistic instances. An efficient heuristic is therefore proposed to deal with the whole problem by solving iteratively the chance-constrained problem separately for each flight level. The approach used to solve the latter problem consists in a constraint generation one which adds iteratively new constraints until reaching the probability threshold for the specific chance-constrained subproblem. An essential aspect of this method is the fast feasibility probability estimation of the chance-constrained constraints of a given solution. Numerical results support our findings.
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 callMore From: IEEE Transactions on Intelligent Transportation Systems
Disclaimer: 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.
