A constraint satisfaction problem is a permutation problem if it has the same number of values as variables, all variables have the same domain and any solution assigns a permutation of the values to the variables. th...
详细信息
the most advanced implementation of adaptive constraint processing withconstraint Handling Rules (CHR) is introduced in the imperative object-oriented programming language Java. the presented Java implementation cons...
详细信息
We describe a large neighbourhood search (LNS) solver based on a constraintprogramming (cp) model for a real-world rich vehicle routing problem with compartments arising in the context of fuel delivery. Our solver su...
详细信息
ISBN:
(纸本)9783319661582;9783319661575
We describe a large neighbourhood search (LNS) solver based on a constraintprogramming (cp) model for a real-world rich vehicle routing problem with compartments arising in the context of fuel delivery. Our solver supports both single-day and multi-day scenarios and a variety of real-world aspects including time window constraints, compatibility constraints, and split deliveries. It can be used both to plan the daily delivery operations, and to inform decisions on the long-term fleet composition. We show experimentally the viability of our approach.
At the first PPcpconference in 1995, I was honored to be one of the invited speakers. Twenty conferences later, much has changed in the computational *** have seen the penetration of the Internet in every aspect of h...
ISBN:
(纸本)9783319104287;9783319104270
At the first PPcpconference in 1995, I was honored to be one of the invited speakers. Twenty conferences later, much has changed in the computational *** have seen the penetration of the Internet in every aspect of human life; the establishment of the multi-core era; the arrival of petaflop high performance computing; the rise of big data, analytics and machine learning; and the emergence of the planet-wide computer (the “cloud-.
We investigate techniques that detect, dynamically during search, undeclared symmetries in the form of interchangeability (Freuder’91) in constraint Satisfaction Problems, withthe long-term goal of drawing ...
ISBN:
(纸本)3540428631
We investigate techniques that detect, dynamically during search, undeclared symmetries in the form of interchangeability (Freuder̵7;91) in constraint Satisfaction Problems, withthe long-term goal of drawing a compact landscape of the solution space of a given CSP instance. As a first step towards our goal, we propose a new algorithm for dynamically computing interchangeability during backtrack search and demonstrate how it enhances the performance of search.
In recent years, there is an increasing interest in modeling and reasoning about complex dynamic systems for tasks such as design, configuration, simulation and diagnosis of technical devices. these tasks, however, re...
ISBN:
(纸本)3540428631
In recent years, there is an increasing interest in modeling and reasoning about complex dynamic systems for tasks such as design, configuration, simulation and diagnosis of technical devices. these tasks, however, require expensive reasoning methods, therefore one of the main issues in real applications is how to reduce the computational cost of reasoning about dynamic models.
the aircraft assignment (or tail assignment) problem is to determine the routes flown by each aircraft in a given fleet, such that each flight is included in exactly one route and the aircraft visit maintenance statio...
ISBN:
(纸本)3540428631
the aircraft assignment (or tail assignment) problem is to determine the routes flown by each aircraft in a given fleet, such that each flight is included in exactly one route and the aircraft visit maintenance stations according to regulations. Before this problem is solved, an airline has to: i) construct the timetable of flights, and ii) decide the aircraft type of each flight (fleet assignment). the aircraft assignment problem, thus, is a vehicle scheduling problem for a homogeneous fleet where all flight activities are fixed in time.
Although constraintprogramming offers a wealth of strong, general-purpose methods, in practice a complex, real application demands a person who selects, combines, and refines various available techniques for constrai...
详细信息
How do we do research?We start with a question. then we read books, journal and conference papers, maybe even speak to people. then we do our own work, make our own contribution, maybe coming up with an improved techn...
详细信息
ISBN:
(纸本)9783319104287;9783319104270
How do we do research?We start with a question. then we read books, journal and conference papers, maybe even speak to people. then we do our own work, make our own contribution, maybe coming up with an improved technique or a greater *** then write up our findings, maybe submit this to a conference, present our work and get feedback, and this results in further research. this is a feedback loop, open to scrutiny by our peers.
In this paper we propose off-line and on-line extensions to the Resource Constrained Project Scheduling Problem. the off-line extension is a variant of RcpSP with time lags and uncertain, bounded activity durations. I...
详细信息
ISBN:
(纸本)9783642153952
In this paper we propose off-line and on-line extensions to the Resource Constrained Project Scheduling Problem. the off-line extension is a variant of RcpSP with time lags and uncertain, bounded activity durations. In this context we improve over our previous work presented in [12] by proposing an incremental flow computation for finding minimal conflict sets and a set of filtering rules for cumulative constraint propagation. the on-line extension is based instead on considering an on-line semantics such as the Self-Timed Execution and take it into account in the scheduling process. Adding the on-line aspect to the problem makes the CSP framework no longer suitable. We have extended the CSP framework to take into account general search decisions and auxiliary unbound variables. An extensive set of experimental results show an improvement
暂无评论