Search

Your search keyword '"Federico Liberatore"' showing total 4 results
Start Over Author "Federico Liberatore" Publisher scitepress - science and technology publications
4 results on '"Federico Liberatore"'

3. Optimization of Direct Transportation Flows for the Removal of Construction Waste Bins with both Resource and Task Availability Interval Constraints

Author

Abderebbi, Safae, Ramdane Cherif-Khettaf, Wahiba, Mines Nancy, Loria, OPTImisation Methods for Integrated SysTems (OPTIMIST), Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), ADEME, Federico Liberatore, Slawo Wesolkowski, and Greg H. Parlier

Subjects
Waste transportation, parallel machine scheduling problem, [INFO]Computer Science [cs], waste bin removal, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], multiple availability interval constraints, mixed integer programming
Abstract

This study focuses on a new real-word problem encountered in the construction sector, which concerns the optimization of the removal of construction waste bins from construction sites to a massification platform, where a limited heterogeneous fleet of tipper trucks (vehicles) must perform direct trips from the platform to the construction sites to collect the waste bins. Each vehicle has a capacity of one bin, it leaves the platform with an empty bin, travels to the construction site, drops off the empty bin in the construction site, collects the full bin and returns to the platform to unload the full bin. The issue is that the vehicles and the construction sites have one or more periods of availability, and thus are not available any time. This problem is modeled as a parallel machine scheduling problem of bin removal tasks on non-identical machines (vehicles), with new constraints that concern the presence of multiple availability intervals for both vehicles and tasks. Two mixed-integer programming (MIP) models are presented and evaluated on 18 new instances derived from real industrial case study.

Published
2023

4. A Hierarchical Decomposition Approach for the Optimal Design of a District Cooling System

Author

Francois Courtot, Céline Gicquel, Dominique Quadri, Côme Bissuel, Bingqian Liu, EDF R&D (EDF R&D), EDF (EDF), Réseaux & Optimisation Combinatoire et Stochastique (ROCS), Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Science des Données (SDD), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Greg H. Parlier, Federico Liberatore, Marc Demange, Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Science des Données (SDD), and Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)

Subjects
Optimal design, Mathematical optimization, [SPI.GCIV]Engineering Sciences [physics]/Civil Engineering, Computer science, Local energy system design, Branch-and-bound, District cooling, [SPI.MECA.THER]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Thermics [physics.class-ph], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], mixed-integer linear programming, Hierarchical decomposition
Abstract

International audience; A district cooling system is a centralized cooling supply system providing air conditioning to a set of buildings located in the same district. Designing and sizing such a system is very complex, as both the initial construction cost and the operation cost of the cooling system during its entire life must be considered. We first propose a modeling approach aiming at formulating this combinatorial optimization problem as a mixed-integer linear program of tractable size. We then extend a previously published hierarchical decomposition technique in order to find the optimal solution in an efficient way. Finally, we provide preliminary computational results based on a real-life case study located in China.

Published
2021

Catalog

Books, media, physical & digital resources
See catalog results