• Corpus ID: 16425172

Using clp(FD) to Support Air Traffic Flow Management

@inproceedings{Chemla1994UsingCT,
  title={Using clp(FD) to Support Air Traffic Flow Management},
  author={Denis Chemla and Daniel Diaz and Philippe Kerlirzin and Serge Manchon},
  year={1994}
}
In this paper, a Constraint Logic Programming (CLP) approach is used to solve an Air Traffic Flow Management (ATFM) problem, the aircraft departure slot allocation. Moreover, our purpose is to show that CLP, combining the declarativity of logic programming with the efficiency of constraint solving, is well suited to model many combinatorial optimization problems involved in the ATFM domain. clp(FD), a Constraint Logic Programming language with Finite Domain constraints has been chosen to… 

Figures and Tables from this paper

Constraint programming for air traffic management: a survey1
TLDR
This paper gives brief tutorials on ATM and constraint programming (CP), and survey the literature on deploying CP technology for modelling and solving combinatorial problems that occur in an ATM context.
Constraint programming for air traffic management: a survey - In memory of Pascal Brisset
TLDR
This work gives brief tutorials on ATM and constraint programming (CP), and survey the literature on deploying CP technology for modelling and solving combinatorial problems that occur in an ATM context.
BUILDING AND EVALUATING A MINIMAL REGULATION SCHEME
TLDR
Depending on the opening schedule and on the predicted traffic sample, it is necessary to apply a set of regulation measures to avoid remaining sectors overloads and this work considers a volume without hole made up of sub-volumes.
A Problem Classification Scheme for Finite Domain Constraint Solving
TLDR
This scheme tries to explain which types of problems can effectively be solved with CLP and which problems are best solved with competing techniques like integer programming or local search.
Compiling Constraints in clp(FD)
Towards constraint-informed information systems
TLDR
This paper argues that Information Systems ought to include constraint-based techniques in their design and implementation, and supports this claim by introducing tools based on constraint programming, which are applied to an actual use-case: the academic timetable construction and maintenance problem, as developed at the University of Evora.
Using clp(FD) to Support Instruction Schedulers for Multi-issue Pipelined Architectures
TLDR
This work advocates a model that is based on the concurrency of tasks performed by pipelines rather than the concurrent usage of resources as most current approaches do, and an implementation using CLP with finite domains is straightforward.
Etude de la compilation des langages logiques de programmation par contraintes sur les domaines finis : le système clp (FD)
Ce travail porte sur la compilation des langages de programmation logique par contraintes sur les domaines finis (DF). Plutot que d'adopter l'approche usuelle considerant le resolveur comme une boite

References

SHOWING 1-10 OF 22 REFERENCES
Constraint satisfaction using constraint logic programming
TLDR
This paper describes how the CLP language cc(FD), a successor of CHIP using consistency techniques over finite domains, can be used to solve two practical applications: test-pattern generation and car sequencing.
A Generic Arc-Consistency Algorithm and its Specializations
A Minimal Extension of the WAM for clp(FD)
We present an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive constraint X
Constraint satisfaction in logic programming
TLDR
The ideas introduced in "Constraint Satisfaction in Logic Programming " have been used successfully to solve more than a dozen practical problems in operations research and circuit design, including disjunctive scheduling, warehouse location, cutting stock car sequencing, and microcode labeling problems.
Constraint logic programming
TLDR
A class of programming languages, the CLP languages, are defined, all of which share the same essential semantic properties, and are highly declarative and are soundly based within a unified framework of formal semantics.
Consistency in Networks of Relations
Constraint satisfaction algorithms 1
TLDR
A unified survey of tree search, arc consistency, and hybrid tree search/arc consistency algorithms, in terms of three classes, suggests several new algorithms to be the best algorithm so far.
Increasing Tree Search Efficiency for Constraint Satisfaction Problems
clp(FD) User’s Manual
  • INRIA, Le Chesnay, France,
  • 1994
Utilisation des techniques de recherche opérationnelle pour leslesétudes Air Traffic Management
  • Utilisation des techniques de recherche opérationnelle pour leslesétudes Air Traffic Management
  • 1992
...
...