Search results for "Integer programming"
showing 10 items of 69 documents
Flexible Spare Core Placement in Torus Topology based NoCs and its validation on an FPGA
2021
In the nano-scale era, Network-on-Chip (NoC) interconnection paradigm has gained importance to abide by the communication challenges in Chip Multi-Processors (CMPs). With increased integration density on CMPs, NoC components namely cores, routers, and links are susceptible to failures. Therefore, to improve system reliability, there is a need for efficient fault-tolerant techniques that mitigate permanent faults in NoC based CMPs. There exists several fault-tolerant techniques that address the permanent faults in application cores while placing the spare cores onto NoC topologies. However, these techniques are limited to Mesh topology based NoCs. There are few approaches that have realized …
Flexibility Services to Minimize the Electricity Production from Fossil Fuels. A Case Study in a Mediterranean Small Island
2019
The design of multi-carrier energy systems (MESs) has become increasingly important in the last decades, due to the need to move towards more efficient, flexible, and reliable power systems. In a MES, electricity, heating, cooling, water, and other resources interact at various levels, in order to get optimized operation. The aim of this study is to identify the optimal combination of components, their optimal sizes, and operating schedule allowing minimizing the annual cost for meeting the energy demand of Pantelleria, a Mediterranean island. Starting from the existing energy system (comprising diesel generators, desalination plant, freshwater storage, heat pumps, and domestic hot water st…
An adaptive multimeme algorithm for designing HIV multidrug therapies.
2007
This paper proposes a period representation for modeling the multidrug HIV therapies and an Adaptive Multimeme Algorithm (AMmA) for designing the optimal therapy. The period representation offers benefits in terms of flexibility and reduction in dimensionality compared to the binary representation. The AMmA is a memetic algorithm which employs a list of three local searchers adaptively activated by an evolutionary framework. These local searchers, having different features according to the exploration logic and the pivot rule, have the role of exploring the decision space from different and complementary perspectives and, thus, assisting the standard evolutionary operators in the optimizati…
Social-Behavioral Aware Optimization of Energy Consumption in Smart Homes
2018
Residential energy consumption is skyrocketing, as residential customers in the U.S. alone used 1.4 trillion kilowatt-hours in 2014 and the consumption is expected to increase in the next years. Previous efforts to limit such consumption have included demand response and smart residential environments. However, recent research has shown that such approaches can actually increase the overall energy consumption due to the numerous complex human psychological processes that take place when interacting with electrical appliances. In this paper we propose a social-behavioral aware framework for energy management in smart residential environments. We envision a smart home where appliances are int…
Enabling peer-to-peer User-Preference-Aware Energy Sharing Through Reinforcement Learning
2020
Renewable, heterogeneous and distributed energy resources are the future of power systems, as envisioned by the recent paradigm of Virtual Power Plants (VPPs). Residential electricity generation, e.g., through photovoltaic panels, plays a fundamental role in this paradigm, where users are able to participate in an energy sharing system and exchange energy resources among each other. In this work, we study energy sharing systems and, differently from previous approaches, we consider realistic user behaviors by taking into account the user preferences and level of engagement in the energy trades. We formulate the problem of matching energy resources while contemplating the user behavior as a …
Cotas inferiores para el QAP-Arbol
1985
The Tree-QAP is a special case of the Quadratic Assignment Problem where the flows not equal zero form a tree. No condition is required for the distance matrix. In this paper we present an integer programming formulation for the Tree-QAP. We use this formulation to construct four Lagrangean relaxations that produce several lower bounds for this problem. To solve one of the relaxed problems we present a Dynamic Programming algorithm which is a generalization of the algorithm of this type that gives a lower bound for the Travelling Salesman Problem. A comparison is given between the lower bounds obtained by each ralaxation for examples with size from 12 to 25.
Data for: Decorous Combinatorial Lower Bounds for Row Layout Problems
2021
Files of the new randomly generated instancesnlengths of the departmentsmatrix with the transport weights THIS DATASET IS ARCHIVED AT DANS/EASY, BUT NOT ACCESSIBLE HERE. TO VIEW A LIST OF FILES AND ACCESS THE FILES IN THIS DATASET CLICK ON THE DOI-LINK ABOVE
A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots
2016
International audience; In the single truck and trailer routing problem with satellite depots (STTRPSD), a truck with a detachable trailer based at a main depot must serve the demand of a set of customers accessible only by truck. Therefore, before serving the customers, it is necessary to detach the trailer in an appropriate parking place (called either a satellite depot or a trailer point) and transfer goods between the truck and the trailer. This problem has applications in milk collection for farms that cannot be reached using large vehicles. In this work we present an integer programming formulation of the STTRPSD. This formulation is tightened with several families of valid inequaliti…
Mathematical models for multicontainer loading problems
2017
Abstract This paper deals with the problem of a distribution company that has to serve its customers by putting first the products on pallets and then loading the pallets onto trucks. We approach the problem by developing and solving integer linear models. We start with basic models, that include the essential features of the problem, such as respecting the dimensions of the truck, and not exceeding the total weight capacity and the maximum weigh capacity on each axle. Then, we add progressively new conditions to consider the weight and volume of pallet bases and to include other desirable features for the solutions to be useful in practice, such as the position of the center of gravity and…
Mathematical models for Multi Container Loading Problems with practical constraints
2019
Abstract We address the multi container loading problem of a company that serves its customers’ orders by building pallets with the required products and loading them into trucks. The problem is solved by using integer linear models. To be useful in practice, our models consider three types of constraints: geometric constraints, so that pallets lie completely inside the trucks and do not overlap; weight constraints, defining the maximum weights supported by a truck and by each axle, as well as the position of the centre of gravity of the cargo; and dynamic stability constraints. These last constraints forbid empty spaces between pallets to avoid cargo displacement when the truck is moving, …