| restoptr: an R package for ecological restoration planning Dimitri Justeau-Allaire, Jeffrey O. Hanson, Guillaume Lannuzel, Philippe Vismara, Xavier Lorca and Philippe Birnbaum Restoration Ecology. Vol. 31(5), pp. e13910, 2023. |
| Abstract: Ecological restoration is essential to curb the decline of biodiversity and ecosystems worldwide. Since the resources available for restoration are limited, restoration efforts must be cost-effective to achieve conservation outcomes. Although decision support tools are available to aid in the design of protected areas, little progress has been made to provide such tools for restoration efforts. Here, we introduce the restoptr R package, a decision support tool designed to identify priority areas for ecological restoration. It uses constraint programming---an artificial intelligence technique---to identify optimal plans given ecological and socioeconomic constraints. Critically, it can identify strategic locations to enhance connectivity and reduce fragmentation across a broader landscape using complex landscape metrics. We illustrate its usage with a case study in New Caledonia. By applying this tool, we identified priority areas for restoration that could reverse forest fragmentation induced by mining activities in a specific area. We also found that relatively small investments could deliver large returns to restore connectivity. The restoptr R package is a free and open-source decision support tool available on the Comprehensive R Archive Network (https://cran.r-project.org/package=restoptr). |
BibTeX:
@article{justeau2023,
author = {Justeau-Allaire, Dimitri and Hanson, Jeffrey O. and Lannuzel, Guillaume and Vismara, Philippe and Lorca, Xavier and Birnbaum, Philippe},
title = {restoptr: an R package for ecological restoration planning},
journal = {Restoration Ecology},
year = {2023},
volume = {31},
number = {5},
pages = {e13910},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1111/rec.13910},
doi = {https://doi.org/10.1111/rec.13910}
}
|
| Supporting Sustainable Agroecological Initiatives for Small Farmers through Constraint Programming Margot Challand, Philippe Vismara, Dimitri Justeau-Allaire & Stéphane de Tourdonnet In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI-23., pp. 5924-5931. International Joint Conferences on Artificial Intelligence Organization, 2023. |
BibTeX:
@inproceedings{challand2023,
author = {Challand, Margot and Vismara, Philippe and Justeau-Allaire, Dimitri and de Tourdonnet, Stéphane},
title = {Supporting Sustainable Agroecological Initiatives for Small Farmers through Constraint Programming},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI-23},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
year = {2023},
pages = {5924--5931},
url = {https://doi.org/10.24963/ijcai.2023/657},
doi = {https://doi.org/10.24963/ijcai.2023/657}
}
|
| A new criterion based on estimator variance for model sampling in precision agriculture P. Vismara B. Tisseyre B. Oger G. Le Moguédec Computers and Electronics in Agriculture. Vol. 200, 2022. |
| Abstract: Model sampling has proven to be an interesting approach to optimize the sampling of an agronomic variable of interest at the field level. The use of a model improves the quality of the estimates by making it possible to integrate the information provided by one or more auxiliary data. It has been shown that such an approach gives better estimations compared to more traditional approaches. Through a statistical work describing the properties of model sampling variance, this paper details how the different factors either related to sample characteristics or to the correlation between the auxiliary data and the variable of interest, affect estimation error. The resulting equations show that the use of samples with a mean close to the field mean and with a substantial dispersion reduces the estimation variance. On the basis of these statistical considerations, a variance criterion is defined to compare sample properties. The lower the value of the criterion of a sample, the lower the variance of the estimate and the expected errors. These theoretical insights were applied to real commercial vine fields in order to validate the demonstration. Nine vine fields were considered with the objective to provide the best yield estimation. High resolution vegetative index derived from airborne multispectral image was used to drive the sampling and the estimation. The theoretical considerations were verified on the nine fields; as the observed estimation errors correspond quite well to the values predicted by the equations. The selection of a large number of random samples from these fields confirms that samples associated with higher values of the chosen criterion result, on average, in larger yield estimation errors. Samples with the highest criterion values are associated with mean estimation errors up to two times larger than those of average samples. Random sampling is also compared to two target sampling approaches (Clustering based on quantiles or on k-means algorithm) commonly considered in the literature, whose characteristics improve the value of the proposed criterion. It is shown that these sampling strategies produce samples associated with criterion values up to 100 times smaller than random sampling. The use of these easy-to-implement methods thus guarantees to reduce the variance of the estimation and the estimation errors. |
BibTeX:
@article{oger2022,
author = {B. Oger, G. Le Moguédec, P. Vismara, B. Tisseyre},
title = {A new criterion based on estimator variance for model sampling in precision agriculture},
journal = {Computers and Electronics in Agriculture},
year = {2022},
volume = {200},
doi = {https://doi.org/10.1016/j.compag.2022.107184}
}
|
| Constrained optimization of landscape indices in conservation planning to support ecological restoration in New Caledonia Dimitri Justeau‐Allaire, Ghislain Vieilledent, Nicolas Rinck, Philippe Vismara, Xavier Lorca and Philippe Birnbaum Journal of Applied Ecology. Vol. 58(4), pp. 744-754, 2021. |
| Abstract: Curbing habitat loss, reducing fragmentation and restoring connectivity are frequent concerns of conservation planning. In this respect, the incorporation of spatial constraints, fragmentation and connectivity indices into optimization procedures is an important challenge for improving decision support.. Here we present a novel optimization approach developed to accurately represent a broad range of conservation planning questions with spatial constraints and landscape indices. Relying on constraint programming, a technique from artificial intelligence based on automatic reasoning, this approach provides both constraint satisfaction and optimality guarantees. We applied this approach in a real case study to support managers of the `Côte Oubliée -- `Woen Vùù -- Pwa Pereeù' provincial park project, in the biodiversity hotspot of New Caledonia. Under budget, accessibility and equitable allocation constraints, we identified restorable areas optimal for reducing forest fragmentation and improving inter-patch structural connectivity, respectively measured with the effective mesh size and the integral index of connectivity. Synthesis and applications. Our work contributes to more effective and policy-relevant conservation planning by providing a spatially explicit and problem-focused optimization approach. By allowing an exact representation of spatial constraints and landscape indices, it can address new questions and ensure whether the solutions will be socioeconomically feasible, through optimality and satisfiability guarantees. Our approach is generic and flexible, thus applicable to a wide range of conservation planning problems, such as ecological restoration planning, reserve or corridor design. |
BibTeX:
@article{justeau2021,
author = {Dimitri Justeau‐Allaire, Ghislain Vieilledent, Nicolas Rinck, Philippe Vismara, Xavier Lorca, Philippe Birnbaum},
title = {Constrained optimization of landscape indices in conservation planning to support ecological restoration in New Caledonia},
journal = {Journal of Applied Ecology},
year = {2021},
volume = {58},
number = {4},
pages = {744--754},
doi = {https://doi.org/10.1111/1365-2664.13803}
}
|
| Which routes for optimal yield sampling in viticulture? Philippe Vismara Bruno Tisseyre Baptiste Oger Cécile Laurent IVES technical reviews. , 2021. |
BibTeX:
@article{ogerIVES2021,
author = {Baptiste Oger, Cécile Laurent, Philippe Vismara, Bruno Tisseyre},
title = {Which routes for optimal yield sampling in viticulture?},
journal = {IVES technical reviews},
year = {2021}
}
|
| Is the optimal strategy to decide on sampling route always the same from field to field using the same sampling method to estimate yield? Baptiste Oger, Cécile Laurent, Philippe Vismara and Bruno Tisseyre OENO One. Vol. 55(1), pp. 133-144, 2021. |
BibTeX:
@article{oger2021,
author = {Oger, Baptiste and Laurent, Cécile and Vismara, Philippe and Tisseyre, Bruno},
title = {Is the optimal strategy to decide on sampling route always the same from field to field using the same sampling method to estimate yield?},
journal = {OENO One},
year = {2021},
volume = {55},
number = {1},
pages = {133--144},
url = {https://oeno-one.eu/article/view/3334},
doi = {https://doi.org/10.20870/oeno-one.2021.55.1.3334}
}
|
| Combining target sampling with within field route-optimization to optimise on field yield estimation in viticulture Baptiste Oger, Philippe Vismara and Bruno Tisseyre Precision Agriculture. , 2020. |
| Abstract: his paper describes a new approach for yield sampling in viticulture. It combines approaches based on auxiliary information and path optimization to offer more consistent sampling strategies, integrating statistical approaches with computer methods. To achieve this, groups of potential sampling points, comparable according to their auxiliary data values are created. Then, an optimal path is constituted that passes through one point of each group of potential sampling points and minimizes the route distance. This part is performed using constraint programming, a programming paradigm offering tools to deal efficiently with combinatorial problems. The paper presents the formalization of the problem, as well as the tests performed on nine real fields were high resolution NDVI data and medium resolution yield data were available. In addition, tests on simulated data were performed to examine the sensitivity of the approach to field data characteristics such as the correlation between auxiliary data and yield, the spatial auto-correlation of the data among others. The approach does not alter much the results when compared to conventional approaches but greatly reduces sampling time. Results show that, for a given amount of time, combining model sampling and path optimization can give estimation error up to 30% lower for a given amount of time compared to previous methods. |
BibTeX:
@article{oger2020,
author = {Baptiste Oger, Philippe Vismara, Bruno Tisseyre},
title = {Combining target sampling with within field route-optimization to optimise on field yield estimation in viticulture},
journal = {Precision Agriculture},
year = {2020},
doi = {https://doi.org/10.1007/s11119-020-09744-0}
}
|
| Systematic Conservation Planning for Sustainable Land-use Policies: A Constrained Partitioning Approach to Reserve Selection and Design Dimitri Justeau-Allaire, Philippe Vismara, Philippe Birnbaum & Xavier Lorca In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI 2019)., pp. 5902-5908. International Joint Conferences on Artificial Intelligence Organization, 2019. |
| Abstract: Faced with natural habitat degradation, fragmentation, and destruction, it is a major challenge for environmental managers to implement sustainable land use policies promoting socioeconomic development and natural habitat conservation in a balanced way. Relying on artificial intelligence and operational research, reserve selection and design models can be of assistance. This paper introduces a partitioning approach based on Constraint Programming (CP) for the reserve selection and design problem, dealing with both coverage and complex spatial constraints. Moreover, it introduces the first CP formulation of the buffer zone constraint, which can be reused to compose more complex spatial constraints. This approach has been evaluated in a real-world dataset addressing the problem of forest fragmentation in New Caledonia, a biodiversity hotspot where managers are gaining interest in integrating these methods into their decisional processes. Through several scenarios, it showed expressiveness, flexibility, and ability to quickly find solutions to complex questions. |
BibTeX:
@inproceedings{justeau-allaire2019,
author = {Justeau-Allaire, Dimitri and Vismara, Philippe and Birnbaum, Philippe and Lorca, Xavier},
title = {Systematic Conservation Planning for Sustainable Land-use Policies: A Constrained Partitioning Approach to Reserve Selection and Design},
booktitle = {Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI 2019)},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
year = {2019},
pages = {5902--5908},
url = {https://doi.org/10.24963/ijcai.2019/818},
doi = {https://doi.org/10.24963/ijcai.2019/818}
}
|
| Combining target sampling with route-optimization to optimise yield estimation in viticulture B. Oger, P. Vismara & B. Tisseyre In Proc. 12th European Conference on Precision Agriculture (ECPA 2019)., pp. 173-179, 2019. |
| Abstract: This paper describes a new approach for yield sampling in viticulture. It combines approaches based on auxiliary information and path optimization to offer more consistent sampling strategies, integrating statistical approaches with computer methods. To achieve this, groups of potential sampling points, comparable according to their auxiliary data values are created. Then, an optimal path connecting several points, one from each group of potential sampling points and minimizing the route distance is created. This part is performed using constraint programming, a programming paradigm offering tools to deal efficiently with combinatorial problems. The paper presents the formalization of the problem, as well as the tests performed on real fields. Results show that combining target sampling and path optimization can reduce by 45% the average sampling circuit length compared to previous methods based on auxiliary data while being almost equivalent in yield prediction error. |
BibTeX:
@inproceedings{oger2019,
author = {B. Oger and P. Vismara and B. Tisseyre},
title = {Combining target sampling with route-optimization to optimise yield estimation in viticulture},
booktitle = {Proc. 12th European Conference on Precision Agriculture (ECPA 2019)},
year = {2019},
pages = {173--179},
doi = {https://doi.org/10.3920/978-90-8686-888-9_20}
}
|
| A Circuit Constraint for Multiple Tours Problems Philippe Vismara & Nicolas Briot In Proc. 24th International Conference on Principles and Practice of Constraint Programming (CP 2018). Lecture Notes in Computer Science. Volume 11008, pp. 389-402. Springer International Publishing, 2018. |
| Abstract: Routing problems appear in many practical applications. In the context of Constraint Programming, circuit constraints have been successfully developed to handle problems like the well-known Traveling Salesman Problem or the Vehicle Routing Problem. These kind of constraints are linked to the search for a Hamiltonian circuit in a graph. In this paper we consider a more general multiple tour problem that consists in covering a part of the graph with a set of minimal cost circuits. We define a new global constraint WeightedSubCircuits that generalizes the WeightedCircuit constraint by releasing the need to obtain a Hamiltonian circuit. It enforces multiple disjoint circuits of bounded total cost to partially cover a weighted graph, the subsets of vertices to be covered being induced by external constraints. We show that enforcing Bounds Consistency for WeightedSubCircuits is NP-hard. We propose an incomplete but polynomial filtering method based on the search for a lower bound of a weighted Steiner circuit. |
BibTeX:
@inproceedings{vismara2018,
author = {Philippe Vismara and Nicolas Briot},
title = {A Circuit Constraint for Multiple Tours Problems},
booktitle = {Proc. 24th International Conference on Principles and Practice of Constraint Programming (CP 2018)},
publisher = {Springer International Publishing},
year = {2018},
series = {Lecture Notes in Computer Science},
volume = {11008},
pages = {389--402},
doi = {https://doi.org/10.1007/978-3-319-98334-9_26}
}
|
| Échantillonnage sous contraintes en viticulture de précision Baptiste Oger, Bruno Tisseyre & Philippe Vismara In Actes des quatorzièmes Journées Francophones de Programmation par Contraintes (JFPC 2018)., pp. 119-122, 2018. |
| Abstract: [FR] Le développement de l'agriculture de précision nécessite de collecter des données par échantillonnage de manière plus rationnelle. Cet échantillonnage s'appuie sur des outils statistiques qui n'intègrent pas toujours les contraintes opérationnelles. L'objet de cette étude est d'utiliser le raisonnement par contraintes pour optimiser l'échantillonnage dans une parcelle de vigne. Il s'agit à la fois de choisir, dans la parcelle, les points qui respectent les contraintes d'échantillonnage tout en optimisant le déplacement du technicien. C'est donc un problème de tournée, pour lequel la Programmation par Contrainte a développé de nombreux algorithmes de filtrage ces dernières années, notamment la contrainte WeightedSubCircuit [Briot et al. 2017] bien adaptée aux tournées ne passant que par un sous-ensemble de points. Nous proposons ici un modèle pour une version simplifiée du problème et les premiers résultats obtenus avec le solveur Choco. [EN] The development of precision agriculture pushes growers to collect sampling data more efficiently. Sampling methods rely on statistical tools that do not always consider operational constraints. The purpose of this study is to use Constraint Programming to optimize sampling in vineyard block. It is both about choosing sampling points that meet operational constraints in the vineyard and optimizing the path taken by the practionner. It is thus a routing problem for which Constraint Programing developed many filtering algorithms in the last few years, in particular the constraint WeightedSubCircuit [Briot et al. 2017], well suited for routes connecting a small subset of points. We expose in this paper a first model for a simplified approach of the problem as well as the first results that we get from the Choco solver. |
BibTeX:
@inproceedings{oger2018,
author = {Oger, Baptiste and Tisseyre, Bruno and Vismara, Philippe},
title = {Échantillonnage sous contraintes en viticulture de précision},
booktitle = {Actes des quatorzièmes Journées Francophones de Programmation par Contraintes (JFPC 2018)},
year = {2018},
pages = {119--122}
}
|
| Constraint Programming for Technician Scheduling in Precision agriculture Nicolas Briot, Sébastien Payen & Philippe Vismara In European conference dedicated to the future use of ICT in the agri-food sector, bioresource and biomass sector (EFITA WCCA 2017)., pp. 7-8, 2017. |
BibTeX:
@inproceedings{briot2017b,
author = {Briot, Nicolas and Payen, Sébastien and Vismara, Philippe},
title = {Constraint Programming for Technician Scheduling in Precision agriculture},
booktitle = {European conference dedicated to the future use of ICT in the agri-food sector, bioresource and biomass sector (EFITA WCCA 2017)},
year = {2017},
pages = {7--8}
}
|
| Une contrainte de circuit adaptée aux tournées multiples Nicolas Briot, Christian Bessiere & Philippe Vismara In Actes des Treizièmes Journées Francophones de Programmation par Contraintes (JFPC 2017)., pp. 137-144, 2017. |
| Abstract: Il existe de nombreuses applications réelles contenant un problème de tournées de véhicules. La programmation par contraintes permet d'aborder ces problèmes de fa¸ con efficace. Des contraintes de circuits ont été définies pour traiter du problème de voyageur de commerce (TSP) ou de tournées de véhicules (VRP). Ces contraintes sont basées sur la recherche d'un circuit hamiltonien dans un graphe. Dans cet article, nous nous intéressons au problème plus général de tournées multiples dans lequel on cherche à couvrir une partie du graphe par un ensemble de circuits de coût minimal. Nous proposons une nouvelle contrainte globale basée sur la recherche de circuits élémentaires disjoints dans un graphe. Contrairement aux contraintes existantes, on ne cherche pas un circuit hamiltonien mais un ensemble de circuits de Steiner. Après avoir défini cette contrainte, nous montrons que le filtrage au bornes est NP-difficile. Nous proposons donc une méthode de filtrage incomplète basée sur la recherche d'une borne inférieure d'un circuit de Steiner. |
BibTeX:
@inproceedings{briot2017,
author = {Briot, Nicolas and Bessiere, Christian and Vismara, Philippe},
title = {Une contrainte de circuit adaptée aux tournées multiples},
booktitle = {Actes des Treizièmes Journées Francophones de Programmation par Contraintes (JFPC 2017)},
year = {2017},
pages = {137--144}
}
|
| Constrained global optimization for wine blending Philippe Vismara, Remi Coletta and Gilles Trombettoni Constraints. Vol. 21(4), pp. 597-615, 2016. |
| Abstract: Assemblage consists in blending base wines in order to create target wines. Recent developments in aroma analysis allow us to measure chemical compounds impacting the taste of wines. This chemical analysis makes it possible to design a decision tool for the following problem: given a set of target wines, determine which volumes must be extracted from each base wine to produce wines that satisfy constraints on aroma concentration, volumes, alcohol contents and price. This paper describes the modeling of wine assemblage as a mixed constrained optimization problem, where the main goal is to minimize the gap to the desired concentrations for every aromatic criterion. The deterministic branch and bound solvers Couenne and IbexOpt behave well on the wine blending problem thanks to their interval constraint propagation/programming and polyhedral relaxation methods. We also study the performance of other optimization goals that could be embedded in a configuration tool, where the different possible interactions amount to solving the same constraints with different objective functions. We finally show on a recent generic wine blending instance that the proposed optimization process scales up well with the number of base wines. |
BibTeX:
@article{vismara2016,
author = {Vismara, Philippe and Coletta, Remi and Trombettoni, Gilles},
title = {Constrained global optimization for wine blending},
journal = {Constraints},
year = {2016},
volume = {21},
number = {4},
pages = {597--615},
doi = {https://doi.org/10.1007/s10601-015-9235-5}
}
|
| Integration of Operational Constraints to Optimize Differential Harvest in Viticulture Nicolas Briot, Christian Bessiere, Bruno Tisseyre & Philippe Vismara In Proc. 10th European Conference on Precision Agriculture (ECPA 2015)., pp. 487-494, 2015. |
| Abstract: One of the most important applications of precision agriculture to viticulture is the management of the quality of grapes at the field level through selective harvest. The recent developments of prototypes of conventional grape harvesting machines are able to sort two types of harvest quality. In this paper, we propose a formal description of the problem of differential harvesting. The objective is to optimize the routing of the grape harvester under several constraints. Our approach is based on Constraint Programming (CP), which is a powerful paradigm to solve combinatorial problems. We give a formulation of the problem as a Constraint Optimization Problem. The last section of the paper is devoted to preliminary experimental results on real data from a French vineyard. |
BibTeX:
@inproceedings{briot2015b,
author = {Briot, Nicolas and Bessiere, Christian and Tisseyre, Bruno and Vismara, Philippe},
title = {Integration of Operational Constraints to Optimize Differential Harvest in Viticulture},
booktitle = {Proc. 10th European Conference on Precision Agriculture (ECPA 2015)},
year = {2015},
pages = {487--494},
doi = {https://doi.org/10.3920/978-90-8686-814-8_60}
}
|
| Programmation par contraintes pour la vendange sélective Nicolas Briot, Christian Bessiere & Philippe Vismara In Actes des Onzièmes Journées Francophones de Programmation par Contraintes (JFPC 2015)., pp. 51-56, 2015. |
| Abstract: En viticulture de précision, la vendange sélective consiste à récolter séparément deux qualités de raisin dans une même vigne. On dispose pour cela d'une machine à vendanger comportant deux trémies et on connait la localisation des zones de qualités ainsi qu'une estimation des quantités à récolter. Le problème consiste à optimiser le trajet de la machine à vendanger tout en respectant de nombreuses contraintes comme la prise en compte du sens de traitement des rangs, la capacité de stockage de la machine, son rayon de braquage, le nombre de vidanges, etc. Après une formalisation du problème de la vendange sélective, cet article présente une modélisation sous la forme d'un problème d'optimisation de contraintes. La dernière section donne des résultats préliminaires fournis par le solveur AbsCon. |
BibTeX:
@inproceedings{briot2015,
author = {Briot, Nicolas and Bessiere, Christian and Vismara, Philippe},
title = {Programmation par contraintes pour la vendange sélective},
booktitle = {Actes des Onzièmes Journées Francophones de Programmation par Contraintes (JFPC 2015)},
year = {2015},
pages = {51--56}
}
|
| A Constraint-Based Approach to the Differential Harvest Problem Nicolas Briot, Christian Bessiere & Philippe Vismara In Proc. 21st International Conference on Principles and Practice of Constraint Programming (CP 2015). Lecture Notes in Computer Science. Volume 9255, pp. 541-556. Springer Berlin / Heidelberg, 2015. |
| Abstract: In this paper, we study the problem of differential harvest in precision viticulture. Some recent prototypes of grape harvesting machines are supplied with two hoppers and are able to sort two types of grape quality. Given estimated qualities and quantities on the different areas of the vineyard, the problem is to optimize the routing of the grape harvester under several constraints. The main constraints are the amount of first quality grapes to harvest and the capacity of the hoppers. We model the differential harvest problem as a constraint optimization problem. We present preliminary results on real data. We also compare our constraint model to an integer linear programming approach and discuss expressiveness and efficiency. |
BibTeX:
@inproceedings{briot2015c,
author = {Briot, Nicolas and Bessiere, Christian and Vismara, Philippe},
title = {A Constraint-Based Approach to the Differential Harvest Problem},
booktitle = {Proc. 21st International Conference on Principles and Practice of Constraint Programming (CP 2015)},
publisher = {Springer Berlin / Heidelberg},
year = {2015},
series = {Lecture Notes in Computer Science},
volume = {9255},
pages = {541--556},
doi = {https://doi.org/10.1007/978-3-319-23219-5_38}
}
|
| Q-Intersection Algorithms for Constraint-Based Robust Parameter Estimation Clément Carbonnel, Gilles Trombettoni, Philippe Vismara & Gilles Chabert In Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence., pp. 2630-2636. AAAI Press, 2014. |
| Abstract: Given a set of axis-parallel n-dimensional boxes, the q-intersection is defined as the smallest box encompassing all the points that belong to at least q boxes. Computing the q-intersection is a combinatorial problem that allows us to handle robust parameter estimation with a numerical constraint programming approach. The q-intersection can be viewed as a filtering operator for soft constraints that model measurements subject to outliers. This paper highlights the equivalence of this operator with the search of q-cliques in a graph whose boxicity is bounded by the number of variables in the constraint network. We present a computational study of the q-intersection. We also propose a fast heuristic and a sophisticated exact q-intersection algorithm. First experiments show that our exact algorithm outperforms the existing one while our heuristic performs an efficient filtering on hard problems |
BibTeX:
@inproceedings{carbonnel2014,
author = {Carbonnel, Clément and Trombettoni, Gilles and Vismara, Philippe and Chabert, Gilles},
title = {Q-Intersection Algorithms for Constraint-Based Robust Parameter Estimation},
booktitle = {Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence},
publisher = {AAAI Press},
year = {2014},
pages = {2630--2636},
url = {http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8290/8727}
}
|
| Constrained Wine Blending Philippe Vismara, Rémi Coletta & Gilles Trombettoni In Principles and Practice of Constraint Programming (CP 2013). Lecture Notes in Computer Science. Volume 8124, pp. 864-879. Springer Berlin / Heidelberg, 2013. |
| Abstract: Assemblage consists in blending base wines in order to create a target wine. Recent developments in aroma analysis allow us to measure chemical compounds impacting the taste of wines. This chemical analysis makes it possible to design a decision tool for the following problem: given a set of target wines, determine which volumes must be extracted from each base wine to produce wines that satisfy constraints on aroma concentration, volumes, alcohol contents and price. This paper describes the modeling of wine assemblage as a non linear constrained Min-Max problem (minimizing the gap to the desired concentrations for every aromatic criterion) effciently handled by the Ibex interval branch and bound. |
BibTeX:
@inproceedings{vismaraCP2013,
author = {Vismara, Philippe and Coletta, Rémi and Trombettoni, Gilles},
title = {Constrained Wine Blending},
booktitle = {Principles and Practice of Constraint Programming (CP 2013)},
publisher = {Springer Berlin / Heidelberg},
year = {2013},
series = {Lecture Notes in Computer Science},
volume = {8124},
pages = {864--879},
doi = {https://doi.org/10.1007/978-3-642-40627-0_63}
}
|
| Éliminations des solutions symétriques pour l'isomorphisme de sous-graphe Philippe Vismara In Actes JFPC 2013. Aix en Provence, France., pp. 343-346, 2013. |
| Abstract: La programmation par contrainte fournit aujourd'hui des modèles efficaces pour résoudre les problèmes d'isomorphisme de sous-graphe. Beaucoup de problèmes réels nécessitent l'énumération de toutes les solutions qui ne sont pas équivalentes à une symétrie d'un des graphes traités. Dans cet article nous nous intéressons aux conditions sous lesquelles il est possible d'éliminer ces symétries en utilisant des contraintes lexicographiques. Dans le cas où le nombre de symétries devient trop important, nous proposons une méthode basée sur des contraintes ensemblistes. |
BibTeX:
@inproceedings{vismaraJFPC2013,
author = {Philippe Vismara},
title = {Éliminations des solutions symétriques pour l'isomorphisme de sous-graphe},
booktitle = {Actes JFPC 2013},
year = {2013},
pages = {343--346}
}
|
| Assemblage de vins sous contraintes Philippe Vismara, Rémi Coletta & Gilles Trombettoni In Actes JFPC 2013. Aix en Provence, France., pp. 333-342, 2013. |
| Abstract: En oenologie, l'assemblage consiste à mélanger plusieurs cuvées afin d'obtenir un vin cible. Des progrès dans l'analyse des arômes permettent aujourd'hui de mesurer un ensemble de composés chimiques influen¸ cant le goût d'un vin. Il devient ainsi possible de concevoir un outil d'aide à la décision pour le problème suivant : étant donné un ensemble de vins cibles à produire, quelles quantités doit-on prélever dans chaque cuvée afin de produire des vins qui respectent des contraintes de concentration en arômes, de volumes, de degré alcoolique et de prix. L'article décrit la modélisation de ce problème sous forme d'une optimisation Min-Max (pour minimiser les écarts obtenus avec les concentrations souhaitées pour chaque critère aromatique) sous contraintes numériques linéaires et quadratiques, et son traitement efficace avec le branch and bound intervalles de Ibex |
BibTeX:
@inproceedings{vismaraetalJFPC2013,
author = {Vismara, Philippe and Coletta, Rémi and Trombettoni, Gilles},
title = {Assemblage de vins sous contraintes},
booktitle = {Actes JFPC 2013},
year = {2013},
pages = {333--342}
}
|
| Symmetries in graph monomorphism problems Philippe Vismara In 12th International Workshop on Symmetry in Constraint Satisfaction Problems (SymCon'12)., 2012. |
| Abstract: During the last decade, Constraint Programming has been successful in solving graph monomorphism problems such as graph and subgraph isomorphism or maximum common subgraph. We focus on symmetry questions for these problems especially when we want to enumerate non-equivalent solutions. |
BibTeX:
@inproceedings{vismara2012b,
author = {Philippe Vismara},
title = {Symmetries in graph monomorphism problems},
booktitle = {12th International Workshop on Symmetry in Constraint Satisfaction Problems (SymCon'12)},
year = {2012}
}
|
| Breaking Variable Symmetry in Almost Injective Problems Philippe Vismara & Rémi Coletta In Principles and Practice of Constraint Programming. Lecture Notes in Computer Science. Volume 7514, pp. 664-671. Springer Berlin / Heidelberg, 2012. |
| Abstract: Lexicographic constraints are commonly used to break variable symmetries. In the general case, the number of constraint to be posted is potentially exponential in the number of variables. For injective problems (AllDiff), Puget's method breaks all variable symmetries with a linear number of constraints. In this paper we assess the number of constraints for ``almost'' injective problems. We propose to characterize them by a parameter μ based on Global Cardinality Constraint as a generalization of the AllDiff constraint. We show that for almost injective problems, variable symmetries can be broken with no more than constraints which is XP in the framework of parameterized complexity. When only ν variables can take duplicated values, the number of constraints is FPT in μ and ν . |
BibTeX:
@inproceedings{vismaraCP2012,
author = {Vismara, Philippe and Coletta, Rémi},
title = {Breaking Variable Symmetry in Almost Injective Problems},
booktitle = {Principles and Practice of Constraint Programming},
publisher = {Springer Berlin / Heidelberg},
year = {2012},
series = {Lecture Notes in Computer Science},
volume = {7514},
pages = {664--671},
doi = {https://doi.org/10.1007/978-3-642-33558-7_48}
}
|
| Casser les symétries de variables dans un problème "presque" injectif Philippe Vismara & Rémi Coletta In Actes JFPC 2012. Toulouse, France., pp. 338-342, 2012. |
| Abstract: Lexicographic constraints are commonly used to break variable symmetries. In the general case, the number of constraint to be posted is potentially exponential in the number of variables. For injective problems (AllDiff), Puget's method breaks all variable symmetries with a linear number of constraints. In this paper we assess the number of constraints for "almost" injective problems. We propose to characterize them by a parameter μ based on Global Cardinality Constraint as a generalization of the AllDiff constraint. We show that for almost injective problems, variable symmetries can be broken with no more than nμ constraints which is XP in the framework of parameterized complexity. When only μ variables can take duplicated values, the number of constraints is FPT in μ and ν |
BibTeX:
@inproceedings{vismaraJFPC2012,
author = {Philippe Vismara and Rémi Coletta},
title = {Casser les symétries de variables dans un problème "presque" injectif},
booktitle = {Actes JFPC 2012},
year = {2012},
pages = {338-342}
}
|
| Efficient Retrieval and Ranking of Undesired Package Cycles in Large Software Systems Jannik Laval, Jean-Rémy Falleri, Philippe Vismara and Stéphane Ducasse Journal of Object Technology. Vol. 11(1), pp. 1-24, 2012. |
| Abstract: Many design guidelines state that a software system architecture should avoid cycles between its packages. Yet such cycles appear again and again in many programs. We believe that the existing approaches for cycle detection are too coarse to assist developers to remove cycles from their programs. In this paper, we describe an efficient algorithm that performs a fine-grained analysis of cycles among application packages. In addition, we define multiple metrics to rank cycles by their level of undesirability, prioritizing cycles that are the more undesired by developers. We compare these multiple ranking metrics on four large and mature software systems in Java and Smalltalk. |
BibTeX:
@article{JOT:issue_2012_04/article4,
author = {Jannik Laval and Jean-Rémy Falleri and Philippe Vismara and Stéphane Ducasse},
title = {Efficient Retrieval and Ranking of Undesired Package Cycles in Large Software Systems},
journal = {Journal of Object Technology},
year = {2012},
volume = {11},
number = {1},
pages = {1--24},
url = {http://www.jot.fm/contents/issue_2012_04/article4.html},
doi = {https://doi.org/10.5381/jot.2012.11.1.a4}
}
|
| Efficient Retrieval and Ranking of Undesired Package Cycles in Large Software Systems Jean-Rémy Falleri, Simon Denier, Jannik Laval, Philippe Vismara & Stéphane Ducasse In Objects, Models, Components, Patterns, Proc. 49th International Conference TOOLS 2011. Lecture Notes in Computer Science. Volume 6705, pp. 260-275. Springer Berlin / Heidelberg, 2011. |
| Abstract: Many design guidelines state that a software system architecture should avoid cycles between its packages. Yet such cycles appear again and again in many programs. We believe that the existing approaches for cycle detection are too coarse to assist the developers to remove cycles from their programs. In this paper, we describe an efficient algorithm that performs a fine-grained analysis of the cycles among the packages of an application. In addition, we define a metric to rank cycles by their level of undesirability, prioritizing the cycles that seems the more undesired by the developers. Our approach is validated on two large and mature software systems in Java and Smalltalk. |
BibTeX:
@inproceedings{falleri2011,
author = {Jean-Rémy Falleri and Simon Denier and Jannik Laval and Philippe Vismara and Stéphane Ducasse},
title = {Efficient Retrieval and Ranking of Undesired Package Cycles in Large Software Systems},
booktitle = {Objects, Models, Components, Patterns, Proc. 49th International Conference TOOLS 2011},
publisher = {Springer Berlin / Heidelberg},
year = {2011},
series = {Lecture Notes in Computer Science},
volume = {6705},
pages = {260-275},
doi = {https://doi.org/10.1007/978-3-642-21952-8_19}
}
|
| Programmation par contraintes pour les problèmes de plus grand sous-graphe commun Philippe Vismara In Actes JFPC 2011. Lyon, France., pp. 327-335, 2011. |
| Abstract: Constraint Programming has proven its efficiency to solve graph matching problems such as graph or subgraph isomorphism. It is much harder to compute maximum common subgraphs and this problem has received little attention in the CSP litterature. In this paper we discuss different variants of the problem. We consider how to model them with a conventional CSP solver and we focus on the connexity and symmetry topics. Finally, we present some experimental results. |
BibTeX:
@inproceedings{vismara2011,
author = {Philippe Vismara},
title = {Programmation par contraintes pour les problèmes de plus grand sous-graphe commun},
booktitle = {Actes JFPC 2011},
year = {2011},
pages = {327-335}
}
|
| Graph-Mining Algorithm for the Evaluation of Bond Formability Frédéric Pennerath, Gilles Niel, Philippe Vismara, Philippe Jauffret, Claude Lauren¸ co and Amedeo Napoli Journal of chemical information and modeling. Vol. 50(2), pp. 221-239, 2010. |
| Abstract: The formability of a bond in a target molecule is a bond property related to the problem of finding a reaction that synthesizes the target by forming the bond: the easier this problem, the higher the formability. Bond formability provides an interesting piece of information that might be used for selecting strategic bonds during a retrosynthesic analysis or for assessing synthetic accessibility in virtual screening. The article describes a graph-mining algorithm called GemsBond that evaluates formability of bonds by mining structural environments contained in several thousand molecular graphs of reaction products. When tested on reaction databases, GemsBond recognizes most formed bonds in reaction products and provides explanations consistent with knowledge in organic synthesis. |
BibTeX:
@article{pennerath2010,
author = {Pennerath, Frédéric and Niel, Gilles and Vismara, Philippe and Jauffret, Philippe and Lauren¸ co, Claude and Napoli, Amedeo},
title = {Graph-Mining Algorithm for the Evaluation of Bond Formability},
journal = {Journal of chemical information and modeling},
year = {2010},
volume = {50},
number = {2},
pages = {221-239},
doi = {https://doi.org/10.1021/ci9003909}
}
|
| Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms Philippe Vismara & Benoît Valery In Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2008 Proceedings. Communications in Computer and Information Science. Volume 14, pp. 358-368. Springer, 2008. |
| Abstract: This paper investigates the problem of Maximum Common Connected Subgraph (MCCS) which is not necessarily an induced subgraph. This problem has so far been neglected by the literature which is mainly devoted to the MCIS problem. Two reductions of the MCCS problem to a MCCIS problem are explored: a classic method based on linegraphs and an original approach using subdivision graphs. Then we propose a method to solve MCCS that searchs for a maximum clique in a compatibility graph. To compare with backtrack approach we explore the applicability of Constraint Satisfaction framework to the MCCS problem for both reductions. |
BibTeX:
@inproceedings{vismara2008,
author = {Philippe Vismara and Benoît Valery},
title = {Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms},
booktitle = {Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2008 Proceedings},
publisher = {Springer},
year = {2008},
series = {Communications in Computer and Information Science},
volume = {14},
pages = {358-368}
}
|
| Maximum Symmetrical Split of Molecular Graphs. Application to Organic Synthesis Design Philippe Vismara, Yannick Tognetti and Claude Laurenço J. Chem. Inf. Model. Vol. 45(3), pp. 685-695. ACS Publications, 2005. |
| Abstract: Whereas the potential symmetry of a molecule may be a feature of importance in synthesis design, this one is often difficult to detect visually in the structural formula. In the present article, we describe an efficient algorithm for the perception of this molecular property. We have addressed this problem in terms of graph theory and defined it as the Maximum Symmetrical Split of a molecular graph. A solution is obtained by deleting in such a graph a minimum number of edges and vertices so that the resulting subgraph consists of exactly two isomorphic connected components that correspond to a pair of synthetically equivalent synthons. In view to reduce the search space of the problem, we have based our algorithm on CSP techniques. In this study, we have found that the maximum symmetrical split is an original kind of Constraint Satisfaction Problem. The algorithm has been implemented into the RESYN_Assistant system, and its performance has been tested on a set of varied molecules which were the targets of previously published synthetic studies. The results show that potential symmetry is perceived quickly and efficiently by the program. The graphical display of this perception information may help a chemist to design reflexive or highly convergent syntheses. |
BibTeX:
@article{vismara2005,
author = {Philippe Vismara and Yannick Tognetti and Claude Laurenço},
title = {Maximum Symmetrical Split of Molecular Graphs. Application to Organic Synthesis Design},
journal = {J. Chem. Inf. Model},
publisher = {ACS Publications},
year = {2005},
volume = {45},
number = {3},
pages = {685--695},
doi = {https://doi.org/10.1021/ci049713h}
}
|
| An abstract representation for molecular graphs Philippe Vismara & Claude Laurenço In Discrete Mathematical Chemistry. Discrete Mathematics and Theoretical Computer Science. Volume 51, pp. 343-366. American Mathematical Society, 2000. |
| Abstract: The design of a synthesis strategy in Organic Chemistry rests on the perception of the target molecule. This one has to be perceived from several viewpoints: topology, stereochemistry, functionality... We propose an abstract representation of molecules which describes the topological viewpoint (cycles, carbon chains and their structural relationships). This representation is based on a polynomial algorithm that computes the set of relevant cycles in the molecular graph. This set is equal to the union of all the minimum cycle bases of the graph. The abstract representation is integrated in RESYN, a system for computer-aided organic synthesis planning. |
BibTeX:
@inproceedings{vismara00b,
author = {Philippe Vismara and Claude Laurenço},
title = {An abstract representation for molecular graphs},
booktitle = {Discrete Mathematical Chemistry},
publisher = {American Mathematical Society},
year = {2000},
series = {Discrete Mathematics and Theoretical Computer Science},
volume = {51},
pages = {343--366}
}
|
| Un Max-Var-CSP pour la recherche de décompositions symétriques Philippe Vismara & Yannick Tognetti In Actes du congres RFIA 2000., pp. 449-458, 2000. |
BibTeX:
@inproceedings{vismara2000,
author = {Philippe Vismara and Yannick Tognetti},
title = {Un Max-Var-CSP pour la recherche de décompositions symétriques},
booktitle = {Actes du congres RFIA 2000},
year = {2000},
pages = {449--458}
}
|
| Computer Aided Organic Synthesis Planning: The RESYN Project Claude Laurenço, Yolande Ahronovitz, Jacques Coste, Andreas Dietz, Roland Ducournau, Olivier Gien, Michel Habib, Pierre Jambaud, Jean Lieber, Amedeo Napoli, Joël Quinqueton & Philippe Vismara In XII International Conference on Computers in Chemical Research and Education (XII ICCCRE), Prunde (Inde)., 1998. |
BibTeX:
@inproceedings{laurenco-etal98,
author = {Claude Laurenço and Yolande Ahronovitz and Jacques Coste and Andreas Dietz and Roland Ducournau and Olivier Gien and Michel Habib and Pierre Jambaud and Jean Lieber and Amedeo Napoli and Joël Quinqueton and Philippe Vismara},
title = {Computer Aided Organic Synthesis Planning: The RESYN Project},
booktitle = {XII International Conference on Computers in Chemical Research and Education (XII ICCCRE), Prunde (Inde)},
year = {1998}
}
|
| RESYN : objets, classification et raisonnement distribué en chimie organique Philippe Vismara, Pierre Jambaud, Claude Laurenço & Joël Quinqueton In Langages et modèles à objets : États des recherches et perspectives. Collection didactique. Volume 19, pp. 397-419. INRIA, 1998. |
BibTeX:
@inproceedings{vismara98b,
author = {Philippe Vismara and Pierre Jambaud and Claude Laurenço and Joël Quinqueton},
title = {RESYN : objets, classification et raisonnement distribué en chimie organique},
booktitle = {Langages et modèles à objets : États des recherches et perspectives},
publisher = {INRIA},
year = {1998},
series = {Collection didactique},
volume = {19},
pages = {397--419}
}
|
| Aspects actuels des représentations de connaissances par objets et de la classification A. Napoli, I. Crampé, R. Ducournau, J. Euzenat, O. Guinaldo, M. Huchard, M. Leclère & P. Vismara In Actes des 6e journées nationales du PRC-GDR Intelligence artificielle., pp. 289-314. Hermes, 1997. |
BibTeX:
@inproceedings{napoli-etal97,
author = {A. Napoli and I. Crampé and R. Ducournau and J. Euzenat and O. Guinaldo and M. Huchard and M. Leclère and P. Vismara},
title = {Aspects actuels des représentations de connaissances par objets et de la classification},
booktitle = {Actes des 6e journées nationales du PRC-GDR Intelligence artificielle},
publisher = {Hermes},
year = {1997},
pages = {289--314}
}
|
| Union of all the minimum cycle bases of a graph Philippe Vismara Electronic Journal of Combinatorics. Vol. 4(R9), pp. 15, 1997. |
BibTeX:
@article{vismara97,
author = {Philippe Vismara},
title = {Union of all the minimum cycle bases of a graph},
journal = {Electronic Journal of Combinatorics},
year = {1997},
volume = {4},
number = {R9},
pages = {15},
url = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v4i1r9}
}
|
| Appariements dirigés pour le Raisonnement par Classification sur des Hiérarchies de Graphes Philippe Vismara In Actes Langages et Modèles à Objets (LMO'96). Leysin, Suisse., pp. 201-214, 1996. |
BibTeX:
@inproceedings{vism96,
author = {Philippe Vismara},
title = {Appariements dirigés pour le Raisonnement par Classification sur des Hiérarchies de Graphes},
booktitle = {Actes Langages et Modèles à Objets (LMO'96)},
year = {1996},
pages = {201-214}
}
|
| Design of Planification of synthesis in Organic Chemistry P. Vismara & J. Quinqueton In proc. Thirteenth IASTED International Conference on Applied Informatics., pp. 139-141, 1995. |
BibTeX:
@inproceedings{vism95,
author = {P. Vismara and J. Quinqueton},
title = {Design of Planification of synthesis in Organic Chemistry},
booktitle = {proc. Thirteenth IASTED International Conference on Applied Informatics},
year = {1995},
pages = {139--141}
}
|
| Reconnaissance et représentation d'éléments structuraux pour la description d'objets complexes. Application à l'élaboration de stratégies de synthèse en chimie organique Philippe Vismara In Thèse de doctorat. School: Université Montpellier II. , 1995. |
| Abstract: In this thesis, we deal with structural analysis of complex objects which can be represented as graphs. The application domain is the design of synthesis strategies in organic chemistry. We define the set of relevant cycles (denoted by C_P) as the union of all the minimum cycle bases. We present a polynomial algorithm to compute C_P as a set of cycle prototypes from which all the relevant cycles can be enumerated. We propose a polynomial algorithm to compute the cardinality of C_P and the number of relevant cycles which include a given vertex. The analysis of a molecular graph is followed by studying the symmetry and defining an abstract representation which describes the structural relationships between patterns (cycles, carbon chains, ...). The second part of this thesis deals with the representation of structural patterns with an object oriented language and their organization as a hierarchy of graphs. We propose an original definition of directed matching which makes the subsomption reasoning on graph hierarchies easier. These algorithms are integrated in RESYN, a system for computer-aided organic synthesis. |
BibTeX:
@phdthesis{vism95b,
author = {Philippe Vismara},
title = {Reconnaissance et représentation d'éléments structuraux pour la description d'objets complexes. Application à l'élaboration de stratégies de synthèse en chimie organique},
booktitle = {Thèse de doctorat},
school = {Université Montpellier II},
year = {1995}
}
|
| RESYN : Un système d'aide à la conception de plans de synthèse en chimie organique Philippe Vismara, Jean-Charles Régin, Joël Quinqueton, Michel Py, Claude Laurenço & Laurent Lapied In Actes de la 12e conférence d'intelligence artificielle. Avignon. Volume 1, pp. 305-318. EC2, 1992. |
BibTeX:
@inproceedings{vism92,
author = {Philippe Vismara and Jean-Charles Régin and Joël Quinqueton and Michel Py and Claude Laurenço and Laurent Lapied},
title = {RESYN : Un système d'aide à la conception de plans de synthèse en chimie organique},
booktitle = {Actes de la 12e conférence d'intelligence artificielle},
publisher = {EC2},
year = {1992},
volume = {1},
pages = {305--318}
}
|
Created by JabRef
