The fleet assignment problem (FAP) assigns the type of airplane at each flight segment. Since airplane is an expensive resource, poor fleet assignment can cause a great increase in costs of airlines. There are so many consideration which should be tackled in formulation of a FAP problem, especially the parameters regarding to the airplanes. This paper presents a novel, mixed integer programing ...

Based on statistical data in Indonesia train collisions occur each year. The solution to prevent these accidents is to create early warning detection devices for locomotive driver before the collision or accident occurred so that locomotive drivers can avoid them (preventive). The method used is by using infrared system which is placed in front of the locomotive, so when there are objects detec...

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...

Reducing manufacturing lead times and minimizing work-in-process (WIP) inventories are the cornerstones of popular manufacturing strategies such as Lean, Quick Response, and Just-inTime Manufacturing. In this paper, we present a model that captures the relationship between facility layout and congestion-related measures of performance. We use the model to introduce a formulation of the facility...

Using the recently proposed model of combinatorial landscapes: local optima networks, we study the distribution of local optima in two classes of instances of the quadratic assignment problem. Our results indicate that the two problem instance classes give rise to very different configuration spaces. For the so-called real-like class, the optima networks possess a clear modular structure, while...