Picking operations inside a warehouse are the major share of the total costs of retailing operations. Optimization and harmonization of operations is therefore crucial in the economy of a successful business. In this ...
详细信息
ISBN:
(纸本)9781643683850
Picking operations inside a warehouse are the major share of the total costs of retailing operations. Optimization and harmonization of operations is therefore crucial in the economy of a successful business. In this paper we consider the case of a leading German grocery retailer company and we adapt to their case a mixedintegerlinear Program solving the order batching, assignment and pickers routing problems. Improvements to the model are also discussed, Computational experiments are finally presented, validating the different models and ranking them in terms of their applicability to real scenarios.
This study focuses on the development and analysis of a real-time updated operations strategy of a distributed energy system(DES).Owing to the relevant Chinese policy of electrical transmission and distribution,combin...
详细信息
This study focuses on the development and analysis of a real-time updated operations strategy of a distributed energy system(DES).Owing to the relevant Chinese policy of electrical transmission and distribution,combined cooling,heating,and power system(CCHP)and photovoltaic(PV)systems are not currently ***,with the Chinese supply-side power grid reform,the permissions for connections between DESs and utilities are gradually *** performing building simulation and using mixed integer linear programming(MILP),a real-time updated operation strategy of a DES is ***,considering the DES from Tianjin Eco-city as a case study,a comparative analysis between this updated strategy and the current operation strategy is performed by evaluating three factors:economic efficiency,energy consumption,and CO2 *** results show that the updated strategy can reduce 29.12%of electricity time-of-use cost,10.11%of total fuel consumption,and 18.40%of CO2 emission during the cooling ***,a method of“rolling load forecasting”for DES by using Support vector regression machine(SVR)is proposed and *** testing shows that the Mean Absolute Percentage Error(MAPE)is below 7.5%.And when the training sample is large,the particle swarm optimization algorithm can be used to shorten the modeling time of the air conditioning load forecasting model.
We consider the minimum weighted tree reconstruction (MWTR) problem and two matheuristic methods to obtain optimal or near-optimal solutions: the Feasibility Pump heuristic and the Local Branching heuristic. These mat...
详细信息
We consider the minimum weighted tree reconstruction (MWTR) problem and two matheuristic methods to obtain optimal or near-optimal solutions: the Feasibility Pump heuristic and the Local Branching heuristic. These matheuristics are based on a mixedintegerprogramming model used to find feasible solutions. We discuss the applicability and effectiveness of the matheuristics to obtain solutions to the MWTR problem. The purpose of the MWTR problem is to find a minimum weighted tree connecting a set of leaves in such a way that the length of the path between each pair of leaves is greater than or equal to a given distance between the considered pair of leaves. The Feasibility Pump matheuristic starts with the linearprogramming solution, iteratively fixes the values of some variables and solves the corresponding problem until a feasible solution is achieved. The Local Branching matheuristic, in its turn, improves a feasible solution by using a local search. Computational results using two different sets of instances, one from the phylogenetic area and another from the telecommunications area, show that these matheuristics are quite effective in finding feasible solutions and present small gap values. Each matheuristic can be used independently;however, the best results are obtained when used together. For instances of the problem having up to 17 leaves, the feasible solution obtained by the Feasibility Pump heuristic is improved by the Local Branching heuristic. Noticeably, when comparing with existing based models processes that solve instances having up to 15 leaves, this achievement of the matheuristic increases the size of solved instances.
To deal with the nonlinear problem of the active distribution network (ADN) flow equation model, a linearized power flow constraints is proposed. Taking the minimum power purchase cost and the operation cost of distri...
详细信息
ISBN:
(纸本)9798350339345
To deal with the nonlinear problem of the active distribution network (ADN) flow equation model, a linearized power flow constraints is proposed. Taking the minimum power purchase cost and the operation cost of distributed generation power as the objective, and considering the flexible characteristics of the load in the ADN, a mathematical model of the flexible load is structured. Then, to improve the computational efficiency, linear change of AC Load Flow (AC-LF)equation in the proposed model;Finally, the validity of the put forward model is demonstrated by the simulation of the IEEE 33-bus ADN and the IEE E 69-bus ADN.
Plug-in electric vehicles have large batteries and/or on-board power generators that can provide backup capabilities when the grid fails if they are configured to support vehicle-to-load (V2L) or bidirectional chargin...
详细信息
ISBN:
(纸本)9781665464413
Plug-in electric vehicles have large batteries and/or on-board power generators that can provide backup capabilities when the grid fails if they are configured to support vehicle-to-load (V2L) or bidirectional charging in a vehicle-to-home (V2H) configuration. This capability is becoming increasingly valuable as the electric grid is experiencing an increasing number of failures. These electric vehicles are compelling options for backup power with lower emissions, noise, fuel consumption, and lower operating costs compared to a traditional internal combustion engine driven generator or a system using rooftop PV combined with behind-the-meter (BTM) home battery systems. The authors created a flexible tool that enables a user to configure different home loads combined with various generator and storage types and sizes to estimate the home loads that a configuration can support or how long a V2H system can provide backup power to a given set of loads and under various weather and home conditions.
Attack trees (ATs) are an important tool in security analysis, and an important part of AT analysis is computing metrics. However, metric computation is NP-complete in general. In this paper, we showcase the use of mi...
详细信息
ISBN:
(纸本)9783031471148;9783031471155
Attack trees (ATs) are an important tool in security analysis, and an important part of AT analysis is computing metrics. However, metric computation is NP-complete in general. In this paper, we showcase the use of mixed integer linear programming (MILP) as a tool for quantitative analysis. Specifically, we use MILP to solve the open problem of calculating the min time metric of dynamic ATs, i.e., the minimal time to attack a system. We also present two other tools to further improve our MILP method: First, we show how the computation can be sped up by identifying the modules of an AT, i.e. subtrees connected to the rest of the AT via only one node. Second, we define a general semantics for dynamic ATs that significantly relaxes the restrictions on attack trees compared to earlier work, allowing us to apply our methods to a wide variety of ATs. Experiments on a synthetic testing set of large ATs verify that both the integerlinearprogramming approach and modular analysis considerably decrease the computation time of attack time analysis.
In this paper, an optimization tool based on a MILP model to support the teaching assignment process is proposed. It considers not only hierarchical issues among lecturers but also their preferences to teach a particu...
详细信息
In this paper, an optimization tool based on a MILP model to support the teaching assignment process is proposed. It considers not only hierarchical issues among lecturers but also their preferences to teach a particular subject, the non-regular time schedules throughout the academic year, different type of credits, number of groups and other specific characteristics. Besides, it adds restrictions based on the time compatibility among the different subjects, the lecturers' availability, the maximum number of subjects per lecturer, the maximum number of lecturers per subject as well as the maximum and minimum saturation level for each lecturer, all of them in order to increase the teaching quality. Schedules heterogeneity and other features regarding the operation of some universities justify the usefulness of this model since no study that deals with all of them has been found in the literature review. Model validation has been performed with two real data sets collected from one academic year schedule at the Spanish University Universitat Politecnica de Valencia.
Displacing combustion engine vehicles with electric ones has recently emerged for reducing adverse environmental impacts and dependencies on fossil fuels. However, high electric vehicle penetration might disrupt the s...
详细信息
Displacing combustion engine vehicles with electric ones has recently emerged for reducing adverse environmental impacts and dependencies on fossil fuels. However, high electric vehicle penetration might disrupt the smooth operation of power sectors due to increased peak loads. A thorough investigation is therefore required, considering the charging of multiple electric vehicles, as flexible loads, in the Unit Commitment Problem. A novel approach for resolving this Operational Research problem is hereby presented, combining power flow and transmission constraints with various scenarios of electric vehicles' penetration. A variant of Differential Evolution, aided by heuristic repair mechanisms, Priority Lists and advanced State-of-the-Art constraint handling techniques, is implemented to obtain feasible, near-optimal solutions. Well-established power systems including transmission constraints were used as benchmarks for testing the method proposed. The results are compared with those of a mixedinteger-linear algorithm based on the same formulation. They indicated that low and average demand cases might be resolved efficiently using the evolutionary approach proposed. As for large scale fleets, they might be handled by power systems at near optimal states exhibiting viable and resilient production schedules.
The Precedence-Constrained Minimum-Cost Arborescence problem, has been recently proposed. The purpose of the precedence constraints, that are enforced between pairs of vertices, is to prevent certain directed paths to...
详细信息
ISBN:
(纸本)9781643683850
The Precedence-Constrained Minimum-Cost Arborescence problem, has been recently proposed. The purpose of the precedence constraints, that are enforced between pairs of vertices, is to prevent certain directed paths to appear in the tree that violate a precedence relationship. In this work we introduce a new mixed integer linear programming model that uses a smaller number of variables and constraints to model the precedence relationships compared to those previously appeared in the literature. Furthermore, two models with a polynomial number of variables and constraints are introduced. It is based on a network-flow formulation to model the connectivity of the arborescence. Extensive computational experiments have been run to validate the new models.
Chile is the world's leading producer of copper, with a market share of 26.8% and accounting for approximately 10% of the gross domestic product. Given the importance of this industrial sector in the country, mine...
详细信息
Chile is the world's leading producer of copper, with a market share of 26.8% and accounting for approximately 10% of the gross domestic product. Given the importance of this industrial sector in the country, mine planning is a fundamental tool for achieving strategic, tactical and operational goals. This paper proposes methods to solve the problem of scheduling production in mining, considering the storage and sequencing of power shovels in open-pit mines. The first problem is tactical and operational and seeks to determine the extraction period and destination of each block. The second problem is of an operational nature and consists of defining the optimal sequence of block extraction, considering the mining power shovels. To solve both problems, two mixed integer linear programming models have been proposed and tested in real and random structured instances. The objective function of the proposed models is to maximize the net present value (NPV) of scheduling and maximize the work efficiency of the power shovels in the extraction. The proposed models have been implemented in AMPL and have been solved through the IBM CPLEX and Gurobi solvers. The results show the efficiency of the proposed models, demonstrating that including the storage option in the production schedule increases the operational NPV.
暂无评论