Declarative and Mathematical Programming approaches to Decision Support Systems for food recycling

Every year about one third of the food production intended for humans gets lost or wasted. This wastefulness of resources leads to the emission of unnecessary greenhouse gas, contributing to global warming and climate change. The solution proposed by the SORT project is to “recycle” the surplus of f...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Engineering applications of artificial intelligence Ročník 95; s. 103861
Hlavní autoři: Chesani, Federico, Cota, Giuseppe, Gavanelli, Marco, Lamma, Evelina, Mello, Paola, Riguzzi, Fabrizio
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.10.2020
Témata:
Answer Set Programming
Binary Linear Programming
Constraint Logic Programming
Decision Support System
Food recycling
Decision Support System
Binary Linear Programming
Answer Set Programming
Food recycling
Constraint Logic Programming
ISSN:0952-1976, 1873-6769
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Every year about one third of the food production intended for humans gets lost or wasted. This wastefulness of resources leads to the emission of unnecessary greenhouse gas, contributing to global warming and climate change. The solution proposed by the SORT project is to “recycle” the surplus of food by reconditioning it into animal feed or fuel for biogas/biomass power plants. In order to maximize the earnings and minimize the costs, several choices must be made during the reconditioning process. Given the extremely complex nature of the process, Decision Support Systems (DSSs) could be helpful to reduce the human effort in decision making. In this paper, we present a DSS for food recycling developed using two approaches for finding the optimal solution: one based on Binary Linear Programming (BLP) and the other based on Answer Set Programming (ASP), which outperform our previous approach based on Constraint Logic Programming (CLP) on Finite Domains (CLP(FD)). In particular, the BLP and the CLP(FD) approaches are developed in ECLiPSe, a Prolog system that interfaces with various state-of-the-art Mathematical and Constraint Programming solvers. The ASP approach, instead, is developed in clingo. The three approaches are compared on several synthetic datasets that simulate the operative conditions of the DSS. •We propose a Decision Support System (DSS) for aiding the process of food recycling.•Three techniques are compared: Constraint Logic Programming, Binary Linear Programming and Answer Set Programming.•The method based on Binary Linear Programming scales better in this application.
ISSN:0952-1976
1873-6769
DOI:10.1016/j.engappai.2020.103861