Proceedings of the Second ESSLLI Student Session, …, 1997
We are interested in constraint manipulation using rule-based algorithms because of the explicit ... more We are interested in constraint manipulation using rule-based algorithms because of the explicit distinction made in this approach between deduction rules and control. We associate actions with rewrite rules and control with strategies that establish the order of ...
2009 Eighth Mexican International Conference on Artificial Intelligence, 2009
Constraint Programming is a powerful paradigm for solving Combinatorial Problems. In this solver ... more Constraint Programming is a powerful paradigm for solving Combinatorial Problems. In this solver approach, Enumeration Strategies are crucial for resolution performances. In a previous work, we proposed a framework to reactively change strategies showing bad performances, and to use metabacktracks to restore better states when bad decisions were made. In this paper, we design and evaluate strategies to improve resolution performances of a set of problems. Experimental results show the effectiveness of our approach.
A fuel-air explosive weapon launched from a remote distance is used for clearing minefields. A se... more A fuel-air explosive weapon launched from a remote distance is used for clearing minefields. A set timing pattern in the operation of the minefield clearance round permits varied range through retarding the length of time that a programed sequence of events occurs at the launch site. Upon flight, the round follows a predetermined pattern in deployment of a parachute, firing cloud detonators and initiation of a burster charge. An extendable probe at the front of the round permits detonation at a predetermined level above ground. The descent by parachute provides a relatively stable launching platform for cloud detonators if they are fired prior to the burster charge detonation for dispersal of the fuel-air cloud.
Set Covering Problems and Set Partitioning Problems can model several real life situations. In th... more Set Covering Problems and Set Partitioning Problems can model several real life situations. In this paper, we solve some bench- marks of them with Ant Colony Optimization algorithms and some hy- bridizations of Ant Colony Optimization with Constraint Programming techniques. A lookahead mechanism allows the incorporation of informa- tion on the anticipated decisions that are beyond the immediate choice horizon.
In this paper we solve the Dial-A-Ride Problem (DARP). The main objective of the DARP is to minim... more In this paper we solve the Dial-A-Ride Problem (DARP). The main objective of the DARP is to minimize operation costs for renting pieces of work from the transportation service providers. The resolution approach considered in this work, starting from a network formulation of the DARP, decomposes the problem in two phases: Clustering and Chaining. We model both phases like a
Our research is focused on developing hybrid solvers for Combinatorial Optimization Problems. We ... more Our research is focused on developing hybrid solvers for Combinatorial Optimization Problems. We are concerned with the design of hybrid resolution approaches including Constraint Programming and Metaheuristics. We have been working on that area during the last years, exploring the different issues involved in algorithm design, implementation, tuning and experimental evaluation. We provide an overview of the research we have
In Constraint Programming, enumeration strategies are crucial for resolution performances. The ef... more In Constraint Programming, enumeration strategies are crucial for resolution performances. The effect of strategies is generally unpredictable. In a previous work, we proposed to dynamically change strategies showing bad performances, and to use metabacktrack to ...
A fuel-air explosive weapon launched from a remote distance is used for clearing minefields. A se... more A fuel-air explosive weapon launched from a remote distance is used for clearing minefields. A set timing pattern in the operation of the minefield clearance round permits varied range through retarding the length of time that a programed sequence of events occurs at the launch site. Upon flight, the round follows a predetermined pattern in deployment of a parachute, firing cloud detonators and initiation of a burster charge. An extendable probe at the front of the round permits detonation at a predetermined level above ground. The descent by parachute provides a relatively stable launching platform for cloud detonators if they are fired prior to the burster charge detonation for dispersal of the fuel-air cloud.
Set Covering Problems and Set Partitioning Problems can model several real life situations. In th... more Set Covering Problems and Set Partitioning Problems can model several real life situations. In this paper, we solve some bench- marks of them with Ant Colony Optimization algorithms and some hy- bridizations of Ant Colony Optimization with Constraint Programming techniques. A lookahead mechanism allows the incorporation of informa- tion on the anticipated decisions that are beyond the immediate choice horizon.
In this paper we solve the Dial-A-Ride Problem (DARP). The main objective of the DARP is to minim... more In this paper we solve the Dial-A-Ride Problem (DARP). The main objective of the DARP is to minimize operation costs for renting pieces of work from the transportation service providers. The resolution approach considered in this work, starting from a network formulation of the DARP, decomposes the problem in two phases: Clustering and Chaining. We model both phases like a
Our research is focused on developing hybrid solvers for Combinatorial Optimization Problems. We ... more Our research is focused on developing hybrid solvers for Combinatorial Optimization Problems. We are concerned with the design of hybrid resolution approaches including Constraint Programming and Metaheuristics. We have been working on that area during the last years, exploring the different issues involved in algorithm design, implementation, tuning and experimental evaluation. We provide an overview of the research we have
Proceedings of the Second ESSLLI Student Session, …, 1997
We are interested in constraint manipulation using rule-based algorithms because of the explicit ... more We are interested in constraint manipulation using rule-based algorithms because of the explicit distinction made in this approach between deduction rules and control. We associate actions with rewrite rules and control with strategies that establish the order of ...
2009 Eighth Mexican International Conference on Artificial Intelligence, 2009
Constraint Programming is a powerful paradigm for solving Combinatorial Problems. In this solver ... more Constraint Programming is a powerful paradigm for solving Combinatorial Problems. In this solver approach, Enumeration Strategies are crucial for resolution performances. In a previous work, we proposed a framework to reactively change strategies showing bad performances, and to use metabacktracks to restore better states when bad decisions were made. In this paper, we design and evaluate strategies to improve resolution performances of a set of problems. Experimental results show the effectiveness of our approach.
A fuel-air explosive weapon launched from a remote distance is used for clearing minefields. A se... more A fuel-air explosive weapon launched from a remote distance is used for clearing minefields. A set timing pattern in the operation of the minefield clearance round permits varied range through retarding the length of time that a programed sequence of events occurs at the launch site. Upon flight, the round follows a predetermined pattern in deployment of a parachute, firing cloud detonators and initiation of a burster charge. An extendable probe at the front of the round permits detonation at a predetermined level above ground. The descent by parachute provides a relatively stable launching platform for cloud detonators if they are fired prior to the burster charge detonation for dispersal of the fuel-air cloud.
Set Covering Problems and Set Partitioning Problems can model several real life situations. In th... more Set Covering Problems and Set Partitioning Problems can model several real life situations. In this paper, we solve some bench- marks of them with Ant Colony Optimization algorithms and some hy- bridizations of Ant Colony Optimization with Constraint Programming techniques. A lookahead mechanism allows the incorporation of informa- tion on the anticipated decisions that are beyond the immediate choice horizon.
In this paper we solve the Dial-A-Ride Problem (DARP). The main objective of the DARP is to minim... more In this paper we solve the Dial-A-Ride Problem (DARP). The main objective of the DARP is to minimize operation costs for renting pieces of work from the transportation service providers. The resolution approach considered in this work, starting from a network formulation of the DARP, decomposes the problem in two phases: Clustering and Chaining. We model both phases like a
Our research is focused on developing hybrid solvers for Combinatorial Optimization Problems. We ... more Our research is focused on developing hybrid solvers for Combinatorial Optimization Problems. We are concerned with the design of hybrid resolution approaches including Constraint Programming and Metaheuristics. We have been working on that area during the last years, exploring the different issues involved in algorithm design, implementation, tuning and experimental evaluation. We provide an overview of the research we have
In Constraint Programming, enumeration strategies are crucial for resolution performances. The ef... more In Constraint Programming, enumeration strategies are crucial for resolution performances. The effect of strategies is generally unpredictable. In a previous work, we proposed to dynamically change strategies showing bad performances, and to use metabacktrack to ...
A fuel-air explosive weapon launched from a remote distance is used for clearing minefields. A se... more A fuel-air explosive weapon launched from a remote distance is used for clearing minefields. A set timing pattern in the operation of the minefield clearance round permits varied range through retarding the length of time that a programed sequence of events occurs at the launch site. Upon flight, the round follows a predetermined pattern in deployment of a parachute, firing cloud detonators and initiation of a burster charge. An extendable probe at the front of the round permits detonation at a predetermined level above ground. The descent by parachute provides a relatively stable launching platform for cloud detonators if they are fired prior to the burster charge detonation for dispersal of the fuel-air cloud.
Set Covering Problems and Set Partitioning Problems can model several real life situations. In th... more Set Covering Problems and Set Partitioning Problems can model several real life situations. In this paper, we solve some bench- marks of them with Ant Colony Optimization algorithms and some hy- bridizations of Ant Colony Optimization with Constraint Programming techniques. A lookahead mechanism allows the incorporation of informa- tion on the anticipated decisions that are beyond the immediate choice horizon.
In this paper we solve the Dial-A-Ride Problem (DARP). The main objective of the DARP is to minim... more In this paper we solve the Dial-A-Ride Problem (DARP). The main objective of the DARP is to minimize operation costs for renting pieces of work from the transportation service providers. The resolution approach considered in this work, starting from a network formulation of the DARP, decomposes the problem in two phases: Clustering and Chaining. We model both phases like a
Our research is focused on developing hybrid solvers for Combinatorial Optimization Problems. We ... more Our research is focused on developing hybrid solvers for Combinatorial Optimization Problems. We are concerned with the design of hybrid resolution approaches including Constraint Programming and Metaheuristics. We have been working on that area during the last years, exploring the different issues involved in algorithm design, implementation, tuning and experimental evaluation. We provide an overview of the research we have
Uploads