Search results for "integer programming"

showing 10 items of 69 documents

Integer programming models for the pre-marshalling problem

2019

[EN] The performance of shipping companies greatly depends on reduced berthing times. The trend towards bigger ships and shorter berthing times places severe stress on container terminals, which cannot simply increase the available cranes indefinitely. Therefore, the focus is on optimizing existing resources. An effective way of speeding up the loading/unloading operations of ships at the container terminal is to use the idle time before the arrival of a ship for sorting the stored containers in advance. The pre-marshalling problem consists in rearranging the containers placed in a bay in the order in which they will be required later, looking for a sequence with the minimum number of moves…

OptimizationMathematical optimizationInformation Systems and ManagementGeneral Computer ScienceComputer scienceESTADISTICA E INVESTIGACION OPERATIVA0211 other engineering and technologies02 engineering and technologyLogisticsManagement Science and Operations ResearchUpper and lower boundsIndustrial and Manufacturing EngineeringMarshalling0502 economics and businessPre-marshallingInteger programmingStorage area050210 logistics & transportationFocus (computing)Sequence021103 operations research05 social sciencesSortingInteger programmingTerminal (electronics)Modeling and SimulationContainer (abstract data type)
researchProduct

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…

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniConsumption (economics)Smart HomeInformation Systems and ManagementOperations researchbusiness.industryComputer scienceHeuristic (computer science)Energy management020209 energySocial-Behavioral aware OptimizationEnergy Consumption02 engineering and technologyEnergy consumptionDemand responseComputer Networks and CommunicationHome automation0202 electrical engineering electronic engineering information engineeringSet (psychology)businessInteger programming2018 14th International Conference on Distributed Computing in Sensor Systems (DCOSS)
researchProduct

Decentralized price-driven grid balancing via repurposed electric vehicle batteries

2017

Abstract The share of electricity generated from intermittent renewable sources, e.g., wind and solar grows rapidly. This affects grid stability and power quality. If the share of renewable power generation is to be increased further, additional flexibilities must be introduced. Aggregating small, distributed loads and energy storage facilities is a good medium-term option. In this paper, the suitability of decentralized and on-site optimized storage system consisting of repurposed electric vehicle batteries for grid balancing is investigated. Battery operation is controlled via an optimization procedure, which relies on a one-way communicated pseudo-cost function (PCF). Day-ahead electrici…

EngineeringMathematical optimizationbusiness.product_category020209 energy02 engineering and technologyIndustrial and Manufacturing EngineeringEnergy storageElectric vehicleIntermittent energy source0202 electrical engineering electronic engineering information engineering0601 history and archaeologyElectrical and Electronic EngineeringInteger programmingCivil and Structural EngineeringSequential quadratic programming060102 archaeologybusiness.industryMechanical EngineeringElectrical engineering06 humanities and the artsBuilding and ConstructionGridPollutionRenewable energyGeneral EnergyDistributed generationbusinessEnergy
researchProduct

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, …

TruckMathematical optimization021103 operations researchGeneral Computer ScienceMathematical modelComputer science0211 other engineering and technologiesGeneral Engineering02 engineering and technologyContainer loading; Cutting stock problem; Integer programming; Optimization; Computer Science (all); Engineering (all)Cutting stock problemContainer (abstract data type)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingPalletInteger programmingInteger (computer science)
researchProduct

Packing a Trunk

2003

We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car trunk, the aim is to pack as many identical boxes of size 4 × 2 × 1 units as possible into the interior of the trunk. This measure is important for car manufacturers, because it is a standard in the European Union.

CombinatoricsPacking problemsMeasure (data warehouse)Linear programmingPolytope modelmedia_common.cataloged_instanceEuropean unionGreedy algorithmInteger programmingAlgorithmTrunkMathematicsmedia_common
researchProduct

On the Reliability of Optimization Results for Trigeneration Systems in Buildings, in the Presence of Price Uncertainties and Erroneous Load Estimati…

2016

Cogeneration and trigeneration plants are widely recognized as promising technologies for increasing energy efficiency in buildings. However, their overall potential is scarcely exploited, due to the difficulties in achieving economic viability and the risk of investment related to uncertainties in future energy loads and prices. Several stochastic optimization models have been proposed in the literature to account for uncertainties, but these instruments share in a common reliance on user-defined probability functions for each stochastic parameter. Being such functions hard to predict, in this paper an analysis of the influence of erroneous estimation of the uncertain energy loads and pric…

OptimizationMathematical optimizationEngineeringenergy loadControl and OptimizationLinear programming020209 energyEnergy Engineering and Power TechnologyPrice02 engineering and technologycogeneration; trigeneration; buildings; optimization; linear programming; stochastic; uncertainty; sensitivity; energy loads; priceslcsh:TechnologyCogenerationbuildingSettore ING-IND/10 - Fisica Tecnica Industriale0202 electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringEngineering (miscellaneous)Integer programminglcsh:TTrigenerationRenewable Energy Sustainability and the Environmentbusiness.industryUncertaintylinear programmingcogenerationsensitivitybuildingsStochasticPower (physics)energy loadsProfitability indexStochastic optimizationElectricitybusinesspricesEnergy (miscellaneous)Efficient energy useEnergies; Volume 9; Issue 12; Pages: 1049
researchProduct

A new compact formulation for the discrete p-dispersion problem

2017

Abstract This paper addresses the discrete p -dispersion problem (PDP) which is about selecting  p facilities from a given set of candidates in such a way that the minimum distance between selected facilities is maximized. We propose a new compact formulation for this problem. In addition, we discuss two simple enhancements of the new formulation: Simple bounds on the optimal distance can be exploited to reduce the size and to increase the tightness of the model at a relatively low cost of additional computation time. Moreover, the new formulation can be further strengthened by adding valid inequalities. We present a computational study carried out over a set of large-scale test instances i…

Binary search algorithmMathematical optimization021103 operations researchInformation Systems and ManagementLine searchGeneral Computer Science0211 other engineering and technologies0102 computer and information sciences02 engineering and technologyManagement Science and Operations ResearchSolver01 natural sciencesIndustrial and Manufacturing EngineeringFacility location problemSet (abstract data type)010201 computation theory & mathematicsModeling and SimulationProgramming paradigmInteger programmingAlgorithmStandard model (cryptography)MathematicsEuropean Journal of Operational Research
researchProduct

A note on the separation of subtour elimination constraints in elementary shortest path problems

2013

Abstract This note proposes an alternative procedure for identifying violated subtour elimination constraints (SECs) in branch-and-cut algorithms for elementary shortest path problems. The procedure is also applicable to other routing problems, such as variants of travelling salesman or shortest Hamiltonian path problems, on directed graphs. The proposed procedure is based on computing the strong components of the support graph. The procedure possesses a better worst-case time complexity than the standard way of separating SECs, which uses maximum flow algorithms, and is easier to implement.

Mathematical optimizationInformation Systems and ManagementGeneral Computer ScienceDirected graphManagement Science and Operations ResearchHamiltonian pathTravelling salesman problemIndustrial and Manufacturing Engineeringsymbols.namesakeModeling and SimulationShortest path problemsymbolsGraph (abstract data type)Branch and cutTime complexityInteger programmingMathematicsofComputing_DISCRETEMATHEMATICSMathematicsEuropean Journal of Operational Research
researchProduct

Field testing of repurposed electric vehicle batteries for price-driven grid balancing

2019

Abstract As electric cars become more widespread, the disposal and recycling of used batteries will become an important challenge. Typically, vehicle batteries are replaced if their capacity drops to 70–80% of initial capacity. However, they may still be useful for stationary applications. In this paper, results from a field test of a molten salt high-temperature electric vehicle battery repurposed as stationary storage for grid balancing are presented. In a previous study, we have shown that a mixed integer linear programming control strategy driven by a spot-market price for electricity is best suited for an implementation on hardware with limited computational resources. A 14-day experim…

business.product_categoryMean squared errorRenewable Energy Sustainability and the Environmentbusiness.industryComputer science020209 energyEnergy Engineering and Power Technology02 engineering and technology021001 nanoscience & nanotechnologyGridAutomotive engineeringState of chargeElectric vehicle0202 electrical engineering electronic engineering information engineeringElectric-vehicle batteryElectricityElectrical and Electronic Engineering0210 nano-technologybusinessInteger programmingEfficient energy useJournal of Energy Storage
researchProduct

Fair Transfer Prices of Global Supply Chains in the Process Industry

2016

This work addresses the optimisation of transfer prices for the fair profit distribution among the members involved in a global supply chain in the process industry. A mixed integer linear programming (MILP) model is developed for production and distribution planning of global supply chains, where the optimal transfer prices of products between plants and markets are determined. Two solution approaches are presented for fair solutions using Nash and lexicographic maximin principles. The applicability of the proposed models and approaches are demonstrated by an illustrative example. The results show that both approaches can fairly distribute the whole supply chain’s profit to the members.

MicroeconomicsSupply chainSupply chain networkBusinessProcess industryMinimaxLexicographical orderInteger programmingProfit distributionProfit (economics)
researchProduct