Abstract

This study introduces a robust concept for considering uncertain multiobjective optimization problems, called the lightly robust max-ordering solution. This introduced solution concept offers the best option for solving issues based on the maximum cost in the worst-case scenario. Introducing a tolerable relaxation parameter can be used to increase the robustness of the solution but, at the same time, the desirable property of such a solution with respect to the nominal scenario might be decreased. Subsequently, the two measurements, which are the ‘gain in robustness’ and the ‘price to be paid for robustness’, are considered. These measurements are needed to support a decision maker to find more desirable lightly robust max-ordering solutions with a beneficial trade-off between the robustness of solutions and the quality of solutions in an undisturbed situation. Moreover, an algorithm for finding the proposed solution is presented and discussed. An instance of the benefits of the suggested solution concept is used on an example of ambulance location planning if ambulances may be unavailable.

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 call

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.