As detailed below, we respect the work of Dr. Makarieva and co-authors (Makarieva et al., 2008), but we have come to similar conclusions as Dr. Haynes and decided not to accept the manuscript for final publication in ACP. The decision is supported by the entire ACP executive committee, but for clarity and simplicity the following editorial report is formulated from my perspective as the chief-e...

We discuss the application of a parallel implementation of a hybrid genetic algorithm (GA) to the airline crew scheduling problem. Tests on 40 real-world problems were carried out on an IBM SP parallel computer. The algorithm was able to solve to optimality all but one of the small and medium-sized problems, and found good solutions for half of the larger problems. Two limitations were identifi...

This paper describes a scheme for the dynamic management of linehaul drivers developed for a large U.S. LTL carrier. Virtually all scheduling problems faced by transportation service providers are complicated by time-constrained vehicle operators that can be renewed only after resting. LTL driver scheduling is further complicated by the fact that trucking moves, unlike passenger airline flights...

The airline fleet assignment problem involves assigning aircrafts to flights to maximize profit. Different fleet assignment solutions cause dramatically different performance in subsequent crew planning and operational processes. We have developed an integrated fleet and crew robust planning method to provide fleet assignment solutions that are both friendly to crew planning and robust to real ...

We develop a single artificial variable technique to initialize the primal support method for solving linear programs with bounded variables. We first recall the full artificial basis technique, then we will present the proposed algorithm. In order to study the performances of the suggested algorithm, an implementation under the MATLAB programming language has been developed. Finally, we carry ...

Many discrete optimization problems of practical interest cannot be solved to optimality in the available time. A practical approach to these problems is to use heuristic algorithms, which do not guarantee the optimality of the solution but which, for many problems, can find nearly optimal solutions within a reasonable amount of computational time. The literature on heuristic algorithms often d...

A novel method is presented and explored within the framework of Potts neural networks for solving optimization problems with a non-trivial topology, with the airline crew scheduling problem as a target application. The key ingredient to handle the topological complications is a propagator defined in terms of Potts neurons. The approach is tested on artificial problems generated with two real-w...

Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...

In this paper, we describe an efficient GA representation scheme for solving the setpartitioning problem (SPP). The SPP is an important class of combinatorial optimization problem that may be found in many industrial/business applications. The paper introduces a group representation scheme in a genetic search where columns of the partition matrix (problem space) with the same characteristics ar...

Real life applications involve entities and algorithms that are complex to model and implement. Logic programming, the most practical approach of logic, facilitates the development procedure for these applications. However, its declarativeness does not seem suucient to provide the means for the implementation of fully usable systems. In this paper, we discuss the applicability of logic programm...