Search results

A survey of multi-objective scheduling techniques on the job shop problem is offered in this chapter. The survey traces the development of techniques from Integer programming to genetic algorithms that take advantage of the power of recent computing technology. Applications are in areas as diverse as job scheduling, nurse scheduling, and groundwater monitoring.

Currently, the European air transport system is experiencing an annual growth of 7%. With an increasing number of flights, airports are reaching their capacity limits and are becoming a bottleneck in the system. Mantea is a European Commission funded project dealing with this issue. This paper focuses on planning decision support tools for airport traffic controllers.

The objective of our planning tools is to achieve a better use of the available airport infrastructure (taxiways and runways). To generate a safe plan, many rules must be taken into account that restrict the usage of airport tarmac: international regulations, airport operational procedures, aircraft performance, weather conditions and sometimes even controller “usual practices”. To generate a realistic plan, extensive monitoring of the traffic situation as well as suitable timing must be achieved. In the life cycle of a flight, 11 out of 15 possible causes of delay occur in an interval of 10-20 minutes, between aircraft start-up request and push-back. This means that precise planning before the end of this period is highly improbable. On the other hand, planning after this period implies the need for fast responses from the system.

In the Mantea project, an architecture is proposed in which a co-operative approach is taken towards planning aircraft movements at the airport. Controllers will be supported by planning tools that help assigning routes and departure times to controlled vehicles, in planning runway allocation (departure sequence) and occupancies, and in monitoring plan progress during flight phases. The planning horizon relates to medium term operations, i.e. 2-20 minutes ahead. The Mantea planning tools implement the following functions: runway departure planning, routing, and plan conformance monitoring. The tools will reduce the controller's workload, increase the level of safety for airport surface movements, and reduce the number of delays and operating costs for the airliners.

In this paper, we will focus on the constraint satisfaction programming techniques used in Mantea for (1) runway departure planning, (2) itinerary search and taxi planning functions. The airport tarmac and runway vicinity air routes have been modelled as a graph. Real time constraints have brought us to develop an algorithm linear in complexity for the itinerary search problem. Operational pressure has led us to develop fast search strategies for scheduling (i.e. use of heuristics, hill climbing…).

This chapter develops a methodology to assist critical facility operators in designing physical protection systems to defend against a single adversary (thief, saboteur, terrorist, etc.) attack. The developed methodology utilizes a multicriteria decision-making approach that balances the competing goals of minimal security system cost and maximum system performance. The methodology utilizes a network-based approach to facility security system design and analysis, which locates physical protection (detection, delay, and response) elements throughout a facility. These elements enable the facility owner to prevent attacks through deterrence and to defeat the adversary if he or she chooses to attack. The developed approach results in the ability for the facility operator to assess relative facility and/or infrastructure safety, and make decisions regarding how to optimally allocate resources for physical protection elements to balance cost and performance. A hypothetical example is discussed which demonstrates the usefulness of the developed methodology.

Estimating parameters of constrained optimization models in a consistent way requires a different set of methods than what is available in a typical econometric toolkit. We identify three complications likely to arise in this context, and suggest solutions to those complications: (i) the bi-level programming character, (ii) ill-posedness, and (iii) derivation of estimator properties. The solutions suggested involve a combination of numerical techniques and utilization of out-of-sample information through Bayesian techniques. The proposed framework is also suitable for typical empirical problems arising in trade analysis such as the estimation of trade equilibrium models and data balancing exercises.

In this chapter, an air cargo shipment planning problem is considered by including individual risk factors of any sub-contracted agents. Due to competitive market conditions, air cargo forwarders are advised to remain flexible in operations. A mixed integer linear programming formulation including the potential for divisible activities is developed to model the shipment planning problem. To solve this complicated problem, we employ an ant colony optimization (ACO) methodology. Numerical examples are generated using data from both the extant literature and from a global air cargo company, allowing investigation of the viability of the novel methodology. We find that the algorithm/methodology provides effective solutions for small problem sizes.

Disassembly takes place in remanufacturing, recycling, and disposal, with a line being the best choice for automation. The disassembly line balancing problem seeks a sequence that is feasible, minimizes the number of workstations, and ensures similar idle times, as well as other end-of-life specific concerns. Finding the optimal balance is computationally intensive due to exponential growth. Combinatorial optimization methods hold promise for providing solutions to the problem, which is proven here to be NP-hard. Stochastic (genetic algorithm) and deterministic (greedy/hill-climbing hybrid heuristic) methods are presented and compared. Numerical results are obtained using a recent electronic product case study.