This paper introduces a large neighbourhood search heuristic for an airline recovery problem combining fleet assignment, aircraft routing and passenger assignment. Given an initial schedule, a list of disruptions, and a recovery period, the problem consists in constructing aircraft routes and passenger itineraries for the recovery period that allow the resumption of regular operations and minim...

The majority of actors in the Norwegian fisheries consider recruitment of fishers to be the main future challenge for the Norwegian fishing fleet. As fleet recruitment is a highly politicized field, the problem of how to mitigate the recruitment problem is a subject of heavy debate. Some argue that recruitment problems are caused by low fleet profitability, while others argue that recruitment p...

Disruption management is one of the most important scheduling problems in the airline industry because of the elevated costs associated, however this is relatively new research area comparing for example with fleet and tail assignment. The major goal to solve this kind of problem is to achieve a feasible solution for the airline company minimizing the several costs involved and within time cons...

This paper investigates the problem of decentralized task assignment for a fleet of cooperative UAVs. It extends the analysis of a previously proposed algorithm to consider the performance with different communication network topologies. The results show that the second communication step introduced during the planning phase of the new algorithm is crucial for sparse networks because the conver...

Transportation is one of the important infrastructures constituting the base and requisite for different levels of people’s access and movement to various locations. Transportation systems are one of the indices of the development of a region. Optimizing these systems contributes to improving performance and reducing costs of offering services to users. Hence, methods should be adopted with whi...

Vehicle routing variants with multiple depots and mixed fleet present intricate combinatorial aspects related to sequencing choices, vehicle type choices, depot choices, and depots positioning. This paper introduces a dynamic programming methodology for efficiently evaluating compound neighborhoods combining sequence-based moves with an optimal choice of vehicle and depot, and an optimal determ...

This study proposes a unified optimization framework for strategic planning of shared autonomous vehicle (SAV) systems that explicitly and endogenously considers their operational aspects based on macroscopic dynamic traffic assignment. Specifically, the proposed model optimizes fleet size, road network design, parking space allocation an SAV system with optimized SAVs’ routing passenger...

This paper reports on a new algorithm for the Generalized Quadratic Assignment problem (GQAP). The GQAP describes a broad class of quadratic integer programming problems, wherein M pairwise related entities are assigned to N destinations constrained by the destinations’ ability to accommodate them. This new algorithm is based on a Reformulation Linearization Technique (RLT) dual ascent procedur...

In this paper we discuss two particular layout problems, namely the Single-Row Equidistant Facility Layout Problem (SREFLP) and the Single-Row Facility Layout Problem (SRFLP). Our aim is to consolidate the two respective branches in the layout literature. We show that the (SREFLP) is not only a special case of the Quadratic Assignment Problem but also a special case of the (SRFLP). This new con...