The main advantage of heuristic or metaheuristic algorithms compared to exact optimization methods is their ability in handling large-scale instances within a reasonable time, albeit at the expense of losing a guarantee for achieving the optimal solution. Therefore, metaheuristic techniques are appropriate choices for solving NP-hard problems to near optimality. Since the parameters of heuristi...

We describe a two-stage robust optimization approach for solving network flow and design problems with uncertain demand. In two-stage network optimization one defers a subset of the flow decisions until after the realization of the uncertain demand. Availability of such a recourse action allows one to come up with less conservative solutions compared to single-stage optimization. However, this ...

This article explores the development of previous models to determine hubs in a competitive environment. In this paper, by comparing parameters of the ticket price, travel time and the service quality of hub airports, airline hubs are divided into six categories. The degree of importance of travel time and travel cost are determined by a multivariate Lagrange interpolation method, which can pla...

We study the maintenance task scheduling problem for an aircraft fleet in uncertain environment from viewpoint of robust optimization. Given a daily horizon, tasks delegated to shop should be scheduled such way that sufficient aircrafts are available on time meet demand planned missions. The either activities or unexpected repair jobs when major fault is detected during preor after-flight check...

We describe a two-stage robust optimization approach for solving network flow and design problems with uncertain demand. In two-stage network optimization, one defers a subset of the flow decisions until after the realization of the uncertain demand. Availability of such a recourse action allows one to come up with less conservative solutions compared to singlestage optimization. However, this ...