this paper presents an approach for the provision of minute reserve capacity products at the German minute reserve market provided by a pool of electric vehicles. therefore, the requirements of prequalification for ma...
详细信息
this paper presents an approach for the provision of minute reserve capacity products at the German minute reserve market provided by a pool of electric vehicles. therefore, the requirements of prequalification for market participation have been analyzed and examined with regard to electric vehicle pools. A mixed integer linear programming model has been developed. It ensures the provision and delivery of capacity products in an optimal way, whilst the electric vehicles charging demands are also ensured.
With increasing penetration of distributed generation (DG) in the distribution networks (DN), the secure and optimal operation of DN has become an important concern. In this paper, an iterative mixed integer quadratic...
详细信息
ISBN:
(纸本)9780769556703
With increasing penetration of distributed generation (DG) in the distribution networks (DN), the secure and optimal operation of DN has become an important concern. In this paper, an iterative mixed integer quadratic constrained quadratic programming model to optimize the operation of a three phase unbalanced distribution system with high penetration of Photovoltaic (PV) panels, DG and energy storage (ES) is developed. the proposed model minimizes not only the operating cost, including fuel cost and purchasing cost, but also voltage deviations and power loss. the optimization model is based on the linearized sensitivity coefficients between state variables (e.g., node voltages) and control variables (e.g., real and reactive power injections of DG and ES). To avoid slow convergence when close to the optimum, a golden search method is introduced to control the step size and accelerate the convergence. the proposed algorithm is demonstrated on modified IEEE 13 nodes test feeders with multiple PV panels, DG and ES. Numerical simulation results validate the proposed algorithm. Various scenarios of system configuration are studied and some critical findings are concluded.
the development and research of discrete optimization models with logical, resource and other constraints to solve complex products design problems are continued in the article. these models are based on the SAT probl...
详细信息
Vehicle-to-Grid and a microgrid are emerging concepts which are expected to replace the conventional energy and transportation systems with more efficient and flexible ones. there have been research on the integration...
详细信息
ISBN:
(纸本)9781467399760
Vehicle-to-Grid and a microgrid are emerging concepts which are expected to replace the conventional energy and transportation systems with more efficient and flexible ones. there have been research on the integration of these technologies, but a microgrid with fuel cell vehicles (FCVs) have hardly been studied at the moment in spite of the several technical advantages of FCVs as generating units. this paper therefore presents the mathematical model of a microgrid which includes FCVs, on-site hydrogen stations, solar photovoltaic systems and a wind turbine. the optimal scheduling of hydrogen production, hydrogen refueling to FCVs and electricity supply from FCVs which minimizes the power imported from the main grid is obtained by solving a mixed integer linear programming problem. the computation results of a test case indicate that the model can be used for identifying a bottleneck in the energy flow of a microgrid. the presented model can be extended by including important factors to consider for further research on the integration of microgrids and FCVs.
Nowadays, we're all familiar withthe speed of e-commerce development, but we have to admit that logistics industry in rural areas is still in its infancy. As deficient rural logistics network has restricted the r...
详细信息
ISBN:
(纸本)9781509061204
Nowadays, we're all familiar withthe speed of e-commerce development, but we have to admit that logistics industry in rural areas is still in its infancy. As deficient rural logistics network has restricted the rural development to a certain extent, this research field becomes a hot topic. However, most existing papers on forward and reverse logistics network design were primarily concerned with minimizing the total cost, neglecting the time sensitivity. In this paper, we propose a rural forward and reverse logistics network mode of e-commerce platform and a multiobjective mixed-integer linear programming model for logistics network design. To solve the NP-hard problem of the model, the nondominated sorting genetic algorithm II (NSGA-II) has been used. At last, the model has been used to design forward and reverse rural logistics network in Pinggu district of Beijing as an example, and the result show that the model is efficient for establishing virtuous rural logistics network.
the paper suggests several ways how to combine a genetic algorithm withintegerprogramming to improve the quality of the problem solution. the motivation is that today's integerprogramming solvers are very sophi...
详细信息
ISBN:
(纸本)9789616165457
the paper suggests several ways how to combine a genetic algorithm withintegerprogramming to improve the quality of the problem solution. the motivation is that today's integerprogramming solvers are very sophisticated and efficient and they are worth utilizing in combination with metaheuristics to solve hard combinatorialoptimization problems. the capacitated p-median problem is chosen as an example of such a problem that is intractable for an exact method and needs a heuristic or metaheuristic method, e.g. a genetic algorithm to get a near-optimal solution. A genetic algorithm can be combined withintegerprogramming in such a way that the metaheuristics acts at a higher level and controls the calls to the solver. the solver can be used for: (i) fitness calculation, (ii) improving the best solution, and (iii) generating elite solutions. Several variants of the hybrid genetic algorithm are proposed and tested using benchmark instances.
Distribution planning in closed-loop supply chains is concerned with determining transfer and repair operations based on demand forecasts and subject to backordering, inventory, transfer and repair constraints. We pre...
详细信息
ISBN:
(纸本)9781509044603
Distribution planning in closed-loop supply chains is concerned with determining transfer and repair operations based on demand forecasts and subject to backordering, inventory, transfer and repair constraints. We present a mixed-integerprogramming model and a dedicated metaheuristics for this problem and show it is is NP-hard. the model is applicable to a wide range of closed-loop supply chains with different network topologies and site functions and it can also support different planning strategies by means of a weighted objective function. Comparative experiments on pseudo-random instances built on a case study in telecommunication service operations demonstrate the effectiveness and scalability of the metaheuristics. Lastly, we discuss possible extensions to address common supply chain requirements, including the ability to produce robust plans in uncertain environments.
Large collections of digital knowledge have become valuable assets for search and recommendation applications. the taxonomic type systems of such knowledge bases are often highly heterogeneous, as they reflect differe...
详细信息
ISBN:
(纸本)9781450334730
Large collections of digital knowledge have become valuable assets for search and recommendation applications. the taxonomic type systems of such knowledge bases are often highly heterogeneous, as they reflect different cultures, languages, and intentions of usage. We present a novel method to the problem of multi-cultural knowledge alignment, which maps each node of a source taxonomy onto a ranked list of most suitable nodes in the target taxonomy. We model this task as combinatorialoptimization problems, using integer linear programming and quadratic programming. the quality of the computed alignments is evaluated, using large heterogeneous taxonomies about book categories.
Difficult combinatorialoptimization problems coming from practice are nowadays often approached by hybrid metaheuristics that combine principles of classical metaheuristic techniques with advanced methods from fields...
详细信息
Difficult combinatorialoptimization problems coming from practice are nowadays often approached by hybrid metaheuristics that combine principles of classical metaheuristic techniques with advanced methods from fields like mathematical programming, dynamic programming, and constraint programming. If designed appropriately, such hybrids frequently outperform simpler "pure" approaches as they are able to exploit the underlying methods' individual advantages and benefit from synergy. this article starts with a general review of design patterns for hybrid approaches that have been successful on many occasions. More complex practical problems frequently have some special structure that might be exploited. In the field of mixed integer linear programming, three decomposition techniques are particularly well known for taking advantage of special structures: Lagrangian decomposition, Dantzig-Wolfe decomposition (column generation), and Benders' decomposition. It has been recognized that these concepts may also provide a very fruitful basis for effective hybrid metaheuristics. We review the basic principles of these decomposition techniques and discuss for each promising possibilities for combinations with metaheuristics. the approaches are illustrated with successful examples from literature. (C) 2014 Elsevier B.V. All rights reserved.
We address a spatial conservation planning problem in which the planner purchases a budget-constrained set of land parcels in order to maximize the expected spread of a population of an endangered species. Existing te...
详细信息
ISBN:
(纸本)9781577357384
We address a spatial conservation planning problem in which the planner purchases a budget-constrained set of land parcels in order to maximize the expected spread of a population of an endangered species. Existing techniques based on the sample average approximation scheme and standard integerprogramming methods have high complexity and limited scalability. We propose a fast combinatorialoptimization algorithm using Lagrangian relaxation and primal-dual techniques to solve the problem approximately. the algorithm provides a new way to address a range of conservation planning and scheduling problems. On the Red-cockaded Woodpecker data, our algorithm produces near optimal solutions and runs significantly faster than a standard mixed integer program solver. Compared with a greedy baseline, the solution quality is comparable or better, but our algorithm is 10-30 times faster. On synthetic problems that do not exhibit submodularity, our algorithm significantly outperforms the greedy baseline.
暂无评论