Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in net...Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.展开更多
Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied af...Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied after random deployment.In this paper,we study how mobile sensors can be efficiently relocated to achieve k-barrier coverage.In particular,two problems are studied:relocation of sensors with minimum number of mobile sensors and formation of k-barrier coverage with minimum energy cost.These two problems were formulated as 0–1 integer linear programming(ILP).The formulation is computationally intractable because of integrality and complicated constraints.Therefore,we relax the integrality and complicated constraints of the formulation and construct a special model known as RELAX-RSMN with a totally unimodular constraint coefficient matrix to solve the relaxed 0–1 ILP rapidly through linear programming.Theoretical analysis and simulation were performed to verify the effectiveness of our approach.展开更多
A new heuristic algorithm is proposed for solving general integer linear programming problems. In the algorithm, the objective function hyperplane is used as a cutting plane, and then by introducing a special set of a...A new heuristic algorithm is proposed for solving general integer linear programming problems. In the algorithm, the objective function hyperplane is used as a cutting plane, and then by introducing a special set of assistant sets, an efficient heuristic search for the solution to the integer linear program is carried out in the sets on the objective function hyperplane. A simple numerical example shows that the algorithm is efficient for some problems, and therefore, of practical interest.展开更多
We establish polynomial complexity corrector algorithms for linear programming over bounds of the Mehrotra-type predictor- symmetric cones. We first slightly modify the maximum step size in the predictor step of the s...We establish polynomial complexity corrector algorithms for linear programming over bounds of the Mehrotra-type predictor- symmetric cones. We first slightly modify the maximum step size in the predictor step of the safeguard based Mehrotra-type algorithm for linear programming, that was proposed by Salahi et al. Then, using the machinery of Euclidean Jordan algebras, we extend the modified algorithm to symmetric cones. Based on the Nesterov-Todd direction, we obtain O（r log ε1） iteration complexity bound of this algorithm, where r is the rank of the Jordan algebras and ε is the required precision. We also present a new variant of Mehrotra-type algorithm using a new adaptive updating scheme of centering parameter and show that this algorithm enjoys the same order of complexity bound as the safeguard algorithm. We illustrate the numerical behaviour of the methods on some small examples.展开更多
In this paper,we study the minimax linear fractional programming problem on a non-empty bounded set,called problem(MLFP),and we design a branch and bound algorithm to find a globally optimal solution of(MLFP).Firstly,...In this paper,we study the minimax linear fractional programming problem on a non-empty bounded set,called problem(MLFP),and we design a branch and bound algorithm to find a globally optimal solution of(MLFP).Firstly,we convert the problem(MLFP)to a problem(EP2)that is equivalent to it.Secondly,by applying the convex relaxation technique to problem(EP2),a convex quadratic relaxation problem(CQRP)is obtained.Then,the overall framework of the algorithm is given and its convergence is proved,the worst-case iteration number is also estimated.Finally,experimental data are listed to illustrate the effectiveness of the algorithm.展开更多
In this article,the authors discuss the optimal conditions of the linear fractionalprogramming problem and prove that a locally optional solution is a globally optional solution and the locally optimal solution can be...In this article,the authors discuss the optimal conditions of the linear fractionalprogramming problem and prove that a locally optional solution is a globally optional solution and the locally optimal solution can be attained at a basic feasible solution withconstraint condition.展开更多
In this paper, we study linear static Stac kelberg problems with multiple leaders-followers in which each decision maker wi thin his group may or may not cooperate. An exact penalty function method is dev eloped. The ...In this paper, we study linear static Stac kelberg problems with multiple leaders-followers in which each decision maker wi thin his group may or may not cooperate. An exact penalty function method is dev eloped. The duality gaps of the followers’ problems are appended to the leaders’ objective function with a penalty. The structure leads to the decomposition of the composite problem into a series of linear programmings leading to an efficie nt algorithm. We prove that local optimality is reached for an exact penalty fun ction and illustrate the method with three examples. The model in this paper ext ends the stackelberg leader-follower model.展开更多
A new prioritization method in the analytic hierarchy process （AHP）, which improves the group fuzzy preference programming （GFPP） method, is proposed. The fuzzy random theory is applied in the new prioritization m...A new prioritization method in the analytic hierarchy process （AHP）, which improves the group fuzzy preference programming （GFPP） method, is proposed. The fuzzy random theory is applied in the new prioritization method. By modifying the principle of decision making implied in the GFPP method, the improved group fuzzy preference programming （IGFPP） method is formulated as a fuzzy linear programming problem to maximize the average degree of the group satisfaction with all possible group priority vectors. The IGFPP method inherits the advantages of the GFPP method, and solves the weighting trouble existed in the GFPP method. Numerical tests indicate that the IGFPP method performs more effectively than the GFPP method in the case of very contradictive comparison judgments from decision makers.展开更多
In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above...In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above quadratic0-1 programming and its relaxed problem, k-coloring problem is converted intoa class of (continuous) nonconvex quadratic programs, and several theoreticresults are also introduced. Thirdly, linear programming approximate algorithmis quoted and verified for this class of nonconvex quadratic programs. Finally,examining problems which are used to test the algorithm are constructed andsufficient computation experiments are reported.展开更多
A localization algorithm using distance and angle information is proposed in wireless sensor networks. Assuming that node axial orientations are unknown, all angles are measured to calculate the angle differences betw...A localization algorithm using distance and angle information is proposed in wireless sensor networks. Assuming that node axial orientations are unknown, all angles are measured to calculate the angle differences between two nodes viewed by the third one. Then, localization problems are formulated as convex optimization ones and all geometric relationships among different nodes in the communication range are transformed into linear or quadratic constraints. If all measurements are accurate, the localization problem can be formulated as linear programming （LP）. Otherwise, by incorporating auxiliary variables, it can be regarded as quadratic programming （QP）. Simulations show the effectiveness of the proposed algorithm.展开更多
Transportation problem has many real world applications, it can be solved by linear programming model, but in most time the model exists more for less paradox, this paper considers the reasons for the paradox and s...Transportation problem has many real world applications, it can be solved by linear programming model, but in most time the model exists more for less paradox, this paper considers the reasons for the paradox and search the way to eliminate the phenomenon. First this paper formulates a loose constrained linear programming model for the transportation problem, and gives the definition of the paradox which exists in it, some preliminary notions and one example is also given. Then it gives a table based algorithm for the loose constrained model, the steps of the algorithm and example will follow. The examples show that: (1) It is not a contradictory that transportation problem exists more for less paradox. (2) The loose constrained model is better used in practice for its less total cost. (3) The algorithm is easy to calculate, to study and highly speed to convergence. Finally, comparied with other ways it shows that the loose constrained model can thoroughly eliminate the paradox.展开更多
This paper reviews alternative market equilibrium models for policy analysis. The origin of spatial equilibrium models and their application to wood and wood-processing industries are described. Three mathematical pro...This paper reviews alternative market equilibrium models for policy analysis. The origin of spatial equilibrium models and their application to wood and wood-processing industries are described. Three mathematical programming models commonly applied to solve spatial problems - namely linear programming, non-linear programming and mixed complementary programming - are reviewed in terms of forms of objective functions and constraint equalities and inequalities. These programming are illustrated with numerical examples. Linear programming is only applied in transportation problems to solve quantities trans, ported between regions when quantities supplied and demanded in each region are already known. It is argued that linear programming can be applied in broader context to transportation problems where supply and demand quantities are unknown and are linear. In this context, linear programming is seen as a more convenient method for modelers because it has a simpler objective function and does not require as strict conditions, for instance the equal numbers of variables and equations required in mixed complementary programming. Finally, some critical insights are provided on the interpretation of optimal solutions generated by solving spatial equilibrium models.展开更多
Using GIS, GPS and GPRS, a dynamic management system of ore blending in an open pit mine has been designed and developed. A linear program was established in a practical application. The system is very good at automat...Using GIS, GPS and GPRS, a dynamic management system of ore blending in an open pit mine has been designed and developed. A linear program was established in a practical application. The system is very good at automatically drawing up a daily production plan of ore blending and monitors and controls the process of mining production in real time. Experiments under real conditions show that the performance of this system is stable and can satisfy production standards of ore blending in open pit mines.展开更多
Oil product pipelines have features such as transporting multiple materials, ever-changing operating conditions, and synchronism between the oil input plan and the oil offloading plan. In this paper, an optimal model ...Oil product pipelines have features such as transporting multiple materials, ever-changing operating conditions, and synchronism between the oil input plan and the oil offloading plan. In this paper, an optimal model was established for a single-source multi-distribution oil pro- duct pipeline, and scheduling plans were made based on supply. In the model, time node constraints, oil offloading plan constraints, and migration of batch constraints were taken into consideration. The minimum deviation between the demanded oil volumes and the actual offloading volumes was chosen as the objective function, and a linear programming model was established on the basis of known time nodes＇ sequence. The ant colony optimization algo- rithm and simplex method were used to solve the model. The model was applied to a real pipeline and it performed well.展开更多
The renewable portfolio standard has been promoted in parallel with the reform of the electricity market,and the flexibility requirement of the power system has rapidly increased.To promote renewable energy consumptio...The renewable portfolio standard has been promoted in parallel with the reform of the electricity market,and the flexibility requirement of the power system has rapidly increased.To promote renewable energy consumption and improve power system flexibility,a bi-level optimal operation model of the electricity market is proposed.A probabilistic model of the flexibility requirement is established,considering the correlation between wind power,photovoltaic power,and load.A bi-level optimization model is established for the multi-markets;the upper and lower models represent the intra-provincial market and inter-provincial market models,respectively.To efficiently solve the model,it is transformed into a mixed-integer linear programming model using the Karush–Kuhn–Tucker condition and Lagrangian duality theory.The economy and flexibility of the model are verified using a provincial power grid as an example.展开更多
Oil depots along products pipelines are important components of the pipeline transportation system and down-stream markets.The operating costs of oil depots account for a large proportion of the total system’s operat...Oil depots along products pipelines are important components of the pipeline transportation system and down-stream markets.The operating costs of oil depots account for a large proportion of the total system’s operating costs.Meanwhile,oil depots and pipelines form an entire system,and each operation in a single oil depot may have influence on others.It is a tough job to make a scheduling plan when considering the factors of delivering contaminated oil and batches migration.So far,studies simultaneously considering operating constraints and contaminated oil issues are rare.Aiming at making a scheduling plan with the lowest operating costs,the paper establishes a mixed-integer linear programming model,considering a sequence of operations,such as delivery, export, blending,fractionating and exchanging operations,and batch property differences of the same oil as well as influence of batch migration on contaminated volume.Moreover,the paper verifies the linear relationship between oil concentration and blending capability by mathematical deduction.Finally,the model is successfully applied to one of the product pipelines in China and proved to be practical.展开更多
Aiming to efficiently support theLocator/Identifier Separation Protocol(LISP),in this paper,we present an enhanced pointerbased DHT mapping system:LISP-PCHORD.The system creates a pointer space to build ontop of stand...Aiming to efficiently support theLocator/Identifier Separation Protocol(LISP),in this paper,we present an enhanced pointerbased DHT mapping system:LISP-PCHORD.The system creates a pointer space to build ontop of standard DHTs.Mappings within thepointer space are(Endpoint Identifiers(EID),pointers) where the pointer is the address ofthe root node(the physical node that stores themappings) of the corresponding(EID,RoutingLocators(RLOCs)) mappings.In addition toenabling architectural qualities such as scalability and reliability,the proposed LISP-PCHORDcan copy with flat EIDs such as self-certifyingEIDs.The performance of the mapping systemplays a key role in LISP;however,DHT-basedapproaches for LISP seldom consider the mismatch problem that heavily damages the system performance in terms of lookup latency.In order to mitigate the mismatch problem andachieve optimal performance,we propose anoptimization design method that seeks an optimal matching relationship between P-nodes(nodes within the pointer space) and the physical nodes on the basis of the given lookuptraffic matrix.In order to find the optimal matching relationship,we provide two solutions:a linear programming method and a geneticalgorithm.Finally,we evaluate the performance of the proposed scheme and compare itwith that of LISP-DHT.展开更多
A wood logistics system was combined with a linear programming (LP) method utilizing GIS-based techniques on the platform of GIS software-ARC/INFO. The combined costs of road and off-road transport were taken as the o...A wood logistics system was combined with a linear programming (LP) method utilizing GIS-based techniques on the platform of GIS software-ARC/INFO. The combined costs of road and off-road transport were taken as the objective function to find the least cost route and the optimal landing locations of wood transportation. Then transport costs and allowable wood volume of stands were calculated. An LP model was developed to allocate timber resources among mills in order to minimize the wood logistics costs from harvesting sites to mills. The parameters of the LP model, including the transport costs, allowable wood volume and wood orders, were written into a text file in MPS format which were then accessed by LINDO to solve the LP problem. The system is an effective tool to manage logistics, information and funds together in order to increase the speed of wood logistics and reduce the cost. The benefits and efficiency of mill cluster can be improved. The focal firm in the cluster can be competitive.展开更多
In contrast to most existing works on robust unit commitment(UC),this study proposes a novel big-M-based mixed-integer linear programming(MILP)method to solve security-constrained UC problems considering the allowable...In contrast to most existing works on robust unit commitment(UC),this study proposes a novel big-M-based mixed-integer linear programming(MILP)method to solve security-constrained UC problems considering the allowable wind power output interval and its adjustable conservativeness.The wind power accommodation capability is usually limited by spinning reserve requirements and transmission line capacity in power systems with large-scale wind power integration.Therefore,by employing the big-M method and adding auxiliary 0-1 binary variables to describe the allowable wind power output interval,a bilinear programming problem meeting the security constraints of system operation is presented.Furthermore,an adjustable confidence level was introduced into the proposed robust optimization model to decrease the level of conservatism of the robust solutions.This can establish a trade-off between economy and security.To develop an MILP problem that can be solved by commercial solvers such as CPLEX,the big-M method is utilized again to represent the bilinear formulation as a series of linear inequality constraints and approximately address the nonlinear formulation caused by the adjustable conservativeness.Simulation studies on a modified IEEE 26-generator reliability test system connected to wind farms were performed to confirm the effectiveness and advantages of the proposed method.展开更多
Near-surface deposits that extend to considerable depths are often amenable to both open pit mining and/or underground mining. This paper investigates the strategy of mining options for an orebody using a Mixed Intege...Near-surface deposits that extend to considerable depths are often amenable to both open pit mining and/or underground mining. This paper investigates the strategy of mining options for an orebody using a Mixed Integer Linear Programming(MILP) optimization framework. The MILP formulation maximizes the Net Present Value(NPV) of the reserve when extracted with(i) open pit mining,(ii) underground mining, and(iii) concurrent open pit and underground mining. Comparatively, implementing open pit mining generates a higher NPV than underground mining. However considering the investment required for these mining options, underground mining generates a better return on investment than open pit mining. Also, in the concurrent open pit and underground mining scenario, the optimizer prefers extracting blocks using open pit mining. Although the underground mine could access ore sooner, the mining cost differential for open pit mining is more than compensated for by the discounting benefits associated with earlier underground mining.展开更多
基金supported by the National Basic Research Program of China(973 Program)under Grant 2013CB329005
文摘Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.
基金supported by the NSFC(U1536206,61232016,U1405254,61373133,61502242,71401176)BK20150925the PAPD fund
文摘Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied after random deployment.In this paper,we study how mobile sensors can be efficiently relocated to achieve k-barrier coverage.In particular,two problems are studied:relocation of sensors with minimum number of mobile sensors and formation of k-barrier coverage with minimum energy cost.These two problems were formulated as 0–1 integer linear programming(ILP).The formulation is computationally intractable because of integrality and complicated constraints.Therefore,we relax the integrality and complicated constraints of the formulation and construct a special model known as RELAX-RSMN with a totally unimodular constraint coefficient matrix to solve the relaxed 0–1 ILP rapidly through linear programming.Theoretical analysis and simulation were performed to verify the effectiveness of our approach.
文摘A new heuristic algorithm is proposed for solving general integer linear programming problems. In the algorithm, the objective function hyperplane is used as a cutting plane, and then by introducing a special set of assistant sets, an efficient heuristic search for the solution to the integer linear program is carried out in the sets on the objective function hyperplane. A simple numerical example shows that the algorithm is efficient for some problems, and therefore, of practical interest.
基金Supported by the National Natural Science Foundation of China(11471102,61301229)Supported by the Natural Science Foundation of Henan University of Science and Technology(2014QN039)
文摘We establish polynomial complexity corrector algorithms for linear programming over bounds of the Mehrotra-type predictor- symmetric cones. We first slightly modify the maximum step size in the predictor step of the safeguard based Mehrotra-type algorithm for linear programming, that was proposed by Salahi et al. Then, using the machinery of Euclidean Jordan algebras, we extend the modified algorithm to symmetric cones. Based on the Nesterov-Todd direction, we obtain O（r log ε1） iteration complexity bound of this algorithm, where r is the rank of the Jordan algebras and ε is the required precision. We also present a new variant of Mehrotra-type algorithm using a new adaptive updating scheme of centering parameter and show that this algorithm enjoys the same order of complexity bound as the safeguard algorithm. We illustrate the numerical behaviour of the methods on some small examples.
基金Supported by the National Natural Science Foundation of China(Grant Nos.12071133 and 11871196).
文摘In this paper,we study the minimax linear fractional programming problem on a non-empty bounded set,called problem(MLFP),and we design a branch and bound algorithm to find a globally optimal solution of(MLFP).Firstly,we convert the problem(MLFP)to a problem(EP2)that is equivalent to it.Secondly,by applying the convex relaxation technique to problem(EP2),a convex quadratic relaxation problem(CQRP)is obtained.Then,the overall framework of the algorithm is given and its convergence is proved,the worst-case iteration number is also estimated.Finally,experimental data are listed to illustrate the effectiveness of the algorithm.
基金Supported by the Natural Science Foundation of Henan Province（0511012000 0511013600） Supported by the Science Foundation for Pure Research of Natural Science of the Education Department of Henan Province（200512950001）
文摘In this article,the authors discuss the optimal conditions of the linear fractionalprogramming problem and prove that a locally optional solution is a globally optional solution and the locally optimal solution can be attained at a basic feasible solution withconstraint condition.
文摘In this paper, we study linear static Stac kelberg problems with multiple leaders-followers in which each decision maker wi thin his group may or may not cooperate. An exact penalty function method is dev eloped. The duality gaps of the followers’ problems are appended to the leaders’ objective function with a penalty. The structure leads to the decomposition of the composite problem into a series of linear programmings leading to an efficie nt algorithm. We prove that local optimality is reached for an exact penalty fun ction and illustrate the method with three examples. The model in this paper ext ends the stackelberg leader-follower model.
基金Sponsored by the National Natural Science Foundation of China (70471063)
文摘A new prioritization method in the analytic hierarchy process （AHP）, which improves the group fuzzy preference programming （GFPP） method, is proposed. The fuzzy random theory is applied in the new prioritization method. By modifying the principle of decision making implied in the GFPP method, the improved group fuzzy preference programming （IGFPP） method is formulated as a fuzzy linear programming problem to maximize the average degree of the group satisfaction with all possible group priority vectors. The IGFPP method inherits the advantages of the GFPP method, and solves the weighting trouble existed in the GFPP method. Numerical tests indicate that the IGFPP method performs more effectively than the GFPP method in the case of very contradictive comparison judgments from decision makers.
文摘In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above quadratic0-1 programming and its relaxed problem, k-coloring problem is converted intoa class of (continuous) nonconvex quadratic programs, and several theoreticresults are also introduced. Thirdly, linear programming approximate algorithmis quoted and verified for this class of nonconvex quadratic programs. Finally,examining problems which are used to test the algorithm are constructed andsufficient computation experiments are reported.
文摘A localization algorithm using distance and angle information is proposed in wireless sensor networks. Assuming that node axial orientations are unknown, all angles are measured to calculate the angle differences between two nodes viewed by the third one. Then, localization problems are formulated as convex optimization ones and all geometric relationships among different nodes in the communication range are transformed into linear or quadratic constraints. If all measurements are accurate, the localization problem can be formulated as linear programming （LP）. Otherwise, by incorporating auxiliary variables, it can be regarded as quadratic programming （QP）. Simulations show the effectiveness of the proposed algorithm.
文摘Transportation problem has many real world applications, it can be solved by linear programming model, but in most time the model exists more for less paradox, this paper considers the reasons for the paradox and search the way to eliminate the phenomenon. First this paper formulates a loose constrained linear programming model for the transportation problem, and gives the definition of the paradox which exists in it, some preliminary notions and one example is also given. Then it gives a table based algorithm for the loose constrained model, the steps of the algorithm and example will follow. The examples show that: (1) It is not a contradictory that transportation problem exists more for less paradox. (2) The loose constrained model is better used in practice for its less total cost. (3) The algorithm is easy to calculate, to study and highly speed to convergence. Finally, comparied with other ways it shows that the loose constrained model can thoroughly eliminate the paradox.
文摘This paper reviews alternative market equilibrium models for policy analysis. The origin of spatial equilibrium models and their application to wood and wood-processing industries are described. Three mathematical programming models commonly applied to solve spatial problems - namely linear programming, non-linear programming and mixed complementary programming - are reviewed in terms of forms of objective functions and constraint equalities and inequalities. These programming are illustrated with numerical examples. Linear programming is only applied in transportation problems to solve quantities trans, ported between regions when quantities supplied and demanded in each region are already known. It is argued that linear programming can be applied in broader context to transportation problems where supply and demand quantities are unknown and are linear. In this context, linear programming is seen as a more convenient method for modelers because it has a simpler objective function and does not require as strict conditions, for instance the equal numbers of variables and equations required in mixed complementary programming. Finally, some critical insights are provided on the interpretation of optimal solutions generated by solving spatial equilibrium models.
文摘Using GIS, GPS and GPRS, a dynamic management system of ore blending in an open pit mine has been designed and developed. A linear program was established in a practical application. The system is very good at automatically drawing up a daily production plan of ore blending and monitors and controls the process of mining production in real time. Experiments under real conditions show that the performance of this system is stable and can satisfy production standards of ore blending in open pit mines.
基金part of the Program of"Study on the mechanism of complex heat and mass transfer during batch transport process in products pipelines"funded under the National Natural Science Foundation of China(grant number 51474228)
文摘Oil product pipelines have features such as transporting multiple materials, ever-changing operating conditions, and synchronism between the oil input plan and the oil offloading plan. In this paper, an optimal model was established for a single-source multi-distribution oil pro- duct pipeline, and scheduling plans were made based on supply. In the model, time node constraints, oil offloading plan constraints, and migration of batch constraints were taken into consideration. The minimum deviation between the demanded oil volumes and the actual offloading volumes was chosen as the objective function, and a linear programming model was established on the basis of known time nodes＇ sequence. The ant colony optimization algo- rithm and simplex method were used to solve the model. The model was applied to a real pipeline and it performed well.
基金supported by the National Key R&D Program of China(2018YFA0702200)Science and Technology Project of State Grid Shandong Electric Power Corporation(52062518000Q)。
文摘The renewable portfolio standard has been promoted in parallel with the reform of the electricity market,and the flexibility requirement of the power system has rapidly increased.To promote renewable energy consumption and improve power system flexibility,a bi-level optimal operation model of the electricity market is proposed.A probabilistic model of the flexibility requirement is established,considering the correlation between wind power,photovoltaic power,and load.A bi-level optimization model is established for the multi-markets;the upper and lower models represent the intra-provincial market and inter-provincial market models,respectively.To efficiently solve the model,it is transformed into a mixed-integer linear programming model using the Karush–Kuhn–Tucker condition and Lagrangian duality theory.The economy and flexibility of the model are verified using a provincial power grid as an example.
基金part of the Program of ‘‘Study of the mechanism of complex heat and mass transfer during batch transport process in product pipelines’’ funded under the National Natural Science Foundation of China, Grant Number 51474228
文摘Oil depots along products pipelines are important components of the pipeline transportation system and down-stream markets.The operating costs of oil depots account for a large proportion of the total system’s operating costs.Meanwhile,oil depots and pipelines form an entire system,and each operation in a single oil depot may have influence on others.It is a tough job to make a scheduling plan when considering the factors of delivering contaminated oil and batches migration.So far,studies simultaneously considering operating constraints and contaminated oil issues are rare.Aiming at making a scheduling plan with the lowest operating costs,the paper establishes a mixed-integer linear programming model,considering a sequence of operations,such as delivery, export, blending,fractionating and exchanging operations,and batch property differences of the same oil as well as influence of batch migration on contaminated volume.Moreover,the paper verifies the linear relationship between oil concentration and blending capability by mathematical deduction.Finally,the model is successfully applied to one of the product pipelines in China and proved to be practical.
基金supported by the National Key Basic Research Program of China(973Program) under Grant No.2007CB307100the National Natural Science Foundation of China under Grant No.61001084
文摘Aiming to efficiently support theLocator/Identifier Separation Protocol(LISP),in this paper,we present an enhanced pointerbased DHT mapping system:LISP-PCHORD.The system creates a pointer space to build ontop of standard DHTs.Mappings within thepointer space are(Endpoint Identifiers(EID),pointers) where the pointer is the address ofthe root node(the physical node that stores themappings) of the corresponding(EID,RoutingLocators(RLOCs)) mappings.In addition toenabling architectural qualities such as scalability and reliability,the proposed LISP-PCHORDcan copy with flat EIDs such as self-certifyingEIDs.The performance of the mapping systemplays a key role in LISP;however,DHT-basedapproaches for LISP seldom consider the mismatch problem that heavily damages the system performance in terms of lookup latency.In order to mitigate the mismatch problem andachieve optimal performance,we propose anoptimization design method that seeks an optimal matching relationship between P-nodes(nodes within the pointer space) and the physical nodes on the basis of the given lookuptraffic matrix.In order to find the optimal matching relationship,we provide two solutions:a linear programming method and a geneticalgorithm.Finally,we evaluate the performance of the proposed scheme and compare itwith that of LISP-DHT.
文摘A wood logistics system was combined with a linear programming (LP) method utilizing GIS-based techniques on the platform of GIS software-ARC/INFO. The combined costs of road and off-road transport were taken as the objective function to find the least cost route and the optimal landing locations of wood transportation. Then transport costs and allowable wood volume of stands were calculated. An LP model was developed to allocate timber resources among mills in order to minimize the wood logistics costs from harvesting sites to mills. The parameters of the LP model, including the transport costs, allowable wood volume and wood orders, were written into a text file in MPS format which were then accessed by LINDO to solve the LP problem. The system is an effective tool to manage logistics, information and funds together in order to increase the speed of wood logistics and reduce the cost. The benefits and efficiency of mill cluster can be improved. The focal firm in the cluster can be competitive.
基金State Grid Jiangsu Electric Power Co.,Ltd(JF2020001)National Key Technology R&D Program of China(2017YFB0903300)State Grid Corporation of China(521OEF17001C).
文摘In contrast to most existing works on robust unit commitment(UC),this study proposes a novel big-M-based mixed-integer linear programming(MILP)method to solve security-constrained UC problems considering the allowable wind power output interval and its adjustable conservativeness.The wind power accommodation capability is usually limited by spinning reserve requirements and transmission line capacity in power systems with large-scale wind power integration.Therefore,by employing the big-M method and adding auxiliary 0-1 binary variables to describe the allowable wind power output interval,a bilinear programming problem meeting the security constraints of system operation is presented.Furthermore,an adjustable confidence level was introduced into the proposed robust optimization model to decrease the level of conservatism of the robust solutions.This can establish a trade-off between economy and security.To develop an MILP problem that can be solved by commercial solvers such as CPLEX,the big-M method is utilized again to represent the bilinear formulation as a series of linear inequality constraints and approximately address the nonlinear formulation caused by the adjustable conservativeness.Simulation studies on a modified IEEE 26-generator reliability test system connected to wind farms were performed to confirm the effectiveness and advantages of the proposed method.
基金funding support provided by the Laurentian University Research Fund for the compilation of this report
文摘Near-surface deposits that extend to considerable depths are often amenable to both open pit mining and/or underground mining. This paper investigates the strategy of mining options for an orebody using a Mixed Integer Linear Programming(MILP) optimization framework. The MILP formulation maximizes the Net Present Value(NPV) of the reserve when extracted with(i) open pit mining,(ii) underground mining, and(iii) concurrent open pit and underground mining. Comparatively, implementing open pit mining generates a higher NPV than underground mining. However considering the investment required for these mining options, underground mining generates a better return on investment than open pit mining. Also, in the concurrent open pit and underground mining scenario, the optimizer prefers extracting blocks using open pit mining. Although the underground mine could access ore sooner, the mining cost differential for open pit mining is more than compensated for by the discounting benefits associated with earlier underground mining.
