共查询到20条相似文献,搜索用时 156 毫秒
1.
面向客户定制模式的供应链管理系统优化模型 总被引:1,自引:0,他引:1
建立供应链管理系统优化模型是构建高效率供应链以及发挥供应链优势的前提和基础 .本文建立了面向客户定制模式的集成的供应链管理系统优化模型 ,即一个多目标、具有约束的非线性混合规划模型 ,并提出了针对这种模型的求解思路 .通过对模型的仿真求解既可以优化选择供应链系统中涉及的相关协作企业 ,同时优化系统的订货、生产、库存策略 ,对构建高效率供应链管理系统具有重要意义 . 相似文献
2.
白雪洁 《数学的实践与认识》2017,(14):267-276
基于可信性理论,研究了多受灾点、多出救点、多物资的应急设备选址和物资预置问题.考虑到运输费用、出救点的供应量、受灾点的需求量和道路容量的不确定性,用模糊变量来刻画,建立了模糊环境下应急物资预置的可信性优化模型以最小化期望总费用.当模型中的模糊变量相互独立且服从三角分布时,推导了总费用目标及服务质量和弧容量约束的解析表达式,从而将原模型转化为等价的确定模型.鉴于等价模型是一个混合整数规划,可采用Lingo软件编程求解.最后,数值算例演示所提建模思想.实验结果说明了所建模型的有效性. 相似文献
3.
4.
针对“仓店一体化”模式下提供限时送达服务的新零售仓店,研究多拣货员、多客户、配送方式为带限时送达约束的路径优化分批配送情形下的订单拣选与配送集成调度问题。以最小化订单最大履行时间和配送成本为目标,构建了混合整数非线性规划模型,并设计两阶段启发式算法(H-2)进行求解,最后通过数值实验对算法进行验证与分析。数值实验结果表明,H-2具有较高的求解质量;相较于传统调度算法(TS)在效率提升、资源节约以及客户满意度提高方面具有更优的表现,进而为新零售仓店管理者提供决策支持。 相似文献
5.
6.
本文以多周期多设备冰蓄冷系统运行的动态过程为主要约束,以设备运行状态等为离散优化变量,以设备流体流速等为连续优化变量,以系统运行总费用为目标函数,建立了非线性非光滑的混合整数规划,并论述了该规划问题最优解的存在性。依离散优化变量的有限性,把这个优化问题等价地分解成有限多个关于连续优化变量的线性规划,构造具体的优化算法。最后应用于一个实际冰蓄冷系统,表明了本文的数学模型及优化算法等的正确与有效性,达到缓解用电高峰的用电量,并降低了用户的运行费用。 相似文献
7.
交通网络建设序列优化是交通规划中一个重要问题。文章对交通网络设计及其建设序列问题的研究现状进行了分析。按照网络建设中规划者和用户间的关系,以交通网络建设序列下的各阶段系统总费用作为上层规划,以各阶段的交通流用户平衡模型作为下层规划,建立了双层规划模型。并依照问题的特点,采用动态规划的求解方法进行探讨,而下层模型则采用了基于路径搜索的GP算法进行求解。并针对网络规划算例进行了计算,针对固定和变动客流OD两种情况下的结果进行了分析。计算的结果表明,问题的双层规划模型和动态规划求解算法能够为路网规划决策提供支持。 相似文献
8.
9.
基于应急物资配送过程中时间因素的重要性,将时间满意度引人应急物资储备库选址问题中.针对时间满意度为线性分段函数,建立了以时间满意度最小的需求点的时间满意度尽量大以及系统总费用最小为目标的双目标混合整数规划模型,对目标函数的最小最大值问题进行转化,在此基础上构造新的优化模型,并设计了相应的启发式算法求解.最后通过算例说明算法的可行性和有效性. 相似文献
10.
11.
Ludwig Kuznia Bo Zeng Grisselle Centeno Zhixin Miao 《Annals of Operations Research》2013,210(1):411-432
This paper presents a stochastic mixed integer programming model for a comprehensive hybrid power system design problem, including renewable energy generation, storage device, transmission network, and thermal generators, for remote areas. Given the complexity of the model, we developed a Benders’ decomposition algorithm with two additional types of cutting planes: Pareto-optimal cuts generated using a modified Magnanti-Wong method and cuts generated from a maximum feasible subsystem. Computational results show significant improvement in our ability to solve this type of problem in comparison to a state-of-the-art professional solver. This model and the solution algorithm provide an analytical decision support tool for the hybrid power system design problem. 相似文献
12.
Qipeng P. Zheng Jianhui Wang Panos M. Pardalos Yongpei Guan 《Annals of Operations Research》2013,210(1):387-410
The unit commitment problem has been a very important problem in the power system operations, because it is aimed at reducing the power production cost by optimally scheduling the commitments of generation units. Meanwhile, it is a challenging problem because it involves a large amount of integer variables. With the increasing penetration of renewable energy sources in power systems, power system operations and control have been more affected by uncertainties than before. This paper discusses a stochastic unit commitment model which takes into account various uncertainties affecting thermal energy demand and two types of power generators, i.e., quick-start and non-quick-start generators. This problem is a stochastic mixed integer program with discrete decision variables in both first and second stages. In order to solve this difficult problem, a method based on Benders decomposition is applied. Numerical experiments show that the proposed algorithm can solve the stochastic unit commitment problem efficiently, especially those with large numbers of scenarios. 相似文献
13.
This paper proposes an accelerated solution method to solve two-stage stochastic programming problems with binary variables in the first stage and continuous variables in the second stage. To develop the solution method, an accelerated sample average approximation approach is combined with an accelerated Benders’ decomposition algorithm. The accelerated sample average approximation approach improves the main structure of the original technique through the reduction in the number of mixed integer programming problems that need to be solved. Furthermore, the recently accelerated Benders’ decomposition approach is utilized to expedite the solution time of the mixed integer programming problems. In order to examine the performance of the proposed solution method, the computational experiments are performed on developed stochastic supply chain network design problems. The computational results show that the accelerated solution method solves these problems efficiently. The synergy of the two accelerated approaches improves the computational procedure by an average factor of over 42%, and over 12% in comparison with the original and the recently modified methods, respectively. Moreover, the betterment of the computational process increases substantially with the size of the problem. 相似文献
14.
We consider the problem of optimal management of energy contracts, with bounds on the local (time step) amounts and global (whole period) amounts to be traded, integer constraint on the decision variables and uncertainty on prices only. After building a finite state Markov chain by using vectorial quantization tree method, we rely on the stochastic dual dynamic programming (SDDP) method to solve the continuous relaxation of this stochastic optimization problem. An heuristic for computing sub optimal solutions to the integer optimization problem, based on the Bellman values of the continuous relaxation, is provided. Combining the previous techniques, we are able to deal with high-dimensional state variables problems. Numerical tests applied to realistic energy markets problems have been performed. 相似文献
15.
We investigate a logistics facility location problem to determine whether the existing facilities remain open or not, what the expansion size of the open facilities should be and which potential facilities should be selected. The problem is formulated as a mixed integer linear programming model (MILP) with the objective to minimize the sum of the savings from closing the existing facilities, the expansion costs, the fixed setup costs, the facility operating costs and the transportation costs. The structure of the model motivates us to solve the problem using Benders decomposition algorithm. Three groups of valid inequalities are derived to improve the lower bounds obtained by the Benders master problem. By separating the primal Benders subproblem, different types of disaggregated cuts of the primal Benders cut are constructed in each iteration. A high density Pareto cut generation method is proposed to accelerate the convergence by lifting Pareto-optimal cuts. Computational experiments show that the combination of all the valid inequalities can improve the lower bounds significantly. By alternately applying the high density Pareto cut generation method based on the best disaggregated cuts, the improved Benders decomposition algorithm is advantageous in decreasing the total number of iterations and CPU time when compared to the standard Benders algorithm and optimization solver CPLEX, especially for large-scale instances. 相似文献
16.
Energy management in buildings is addressed in this paper. The energetic impact of buildings in the current energetic context
is first depicted. Then the studied optimization problem is defined as the optimal management of production and consumption
activities in houses. A scheduling problem is identified to adjust the energy consumption to both the energy cost and the
inhabitant’s comfort. The available flexibilities of the services provided by domestic appliances are used to compute optimal
energy plans. These flexibilities are associated to time windows or heating storage abilities. A constraints formulation of
the energy allocation problem is given. A derived mixed linear program is used to solve this problem. The energy consumption
in houses is very dependent to uncertain data such as weather forecasts and inhabitants’ activities. Parametric uncertainties
are introduced in the home energy management problem in order to provide robust energy allocation. Robust linear programming
is implemented. Event related uncertainties are also addressed through stochastic programming in order to take into account
the inhabitant’s activities. A scenario based approach is implemented to face this robust optimization problem. 相似文献
17.
18.
Nezih Altay Powell E. Robinson Jr. Kurt M. Bretthauer 《European Journal of Operational Research》2008,190(3):598-609
We consider a class of knapsack problems that include setup costs for families of items. An individual item can be loaded into the knapsack only if a setup cost is incurred for the family to which it belongs. A mixed integer programming formulation for the problem is provided along with exact and heuristic solution methods. The exact algorithm uses cross decomposition. The proposed heuristic gives fast and tight bounds. In addition, a Benders decomposition algorithm is presented to solve the continuous relaxation of the problem. This method for solving the continuous relaxation can be used to improve the performance of a branch and bound algorithm for solving the integer problem. Computational performance of the algorithms are reported and compared to CPLEX. 相似文献
19.
Cristina M. A. Leopoldino Mário V. F. Pereira Leontina M. V. Pinto Celso C. Ribeiro 《Annals of Operations Research》1994,50(1):367-385
In this paper, we first describe a constraint generation scheme for probabilistic mixed integer programming problems. Next, we present a decomposition approach to the peak capacity expansion planning of interconnected hydrothermal generating systems, with bounds on the transmission capacity between the regions. The objective is to minimize investments in generating units and interconnection links, subject to constraints on supply reliability. The problem is formulated as a stochastic integer program. The constraint generation scheme, which is similar to Benders decomposition, is applied in the solution of the peak capacity expansion problem. The master problem in this decomposition scheme is an integer program, solved by implicit enumeration. The operating subproblem corresponds to a stochastic network flow problem, and is solved by a maximum flow algorithm and Monte Carlo simulation. The approach is illustrated through a case study involving the expansion of the system of the Brazilian Southeastern region. 相似文献
20.
This paper considers a new class of stochastic resource allocation problems that requires simultaneously determining the customers that a capacitated resource must serve and the stock levels of multiple items that may be used in meeting these customers’ demands. Our model considers a reward (revenue) for serving each assigned customer, a variable cost for allocating each item to the resource, and a shortage cost for each unit of unsatisfied customer demand in a single-period context. The model maximizes the expected profit resulting from the assignment of customers and items to the resource while obeying the resource capacity constraint. We provide an exact solution method for this mixed integer nonlinear optimization problem using a Generalized Benders Decomposition approach. This decomposition approach uses Lagrangian relaxation to solve a constrained multi-item newsvendor subproblem and uses CPLEX to solve a mixed-integer linear master problem. We generate Benders cuts for the master problem by obtaining a series of subgradients of the subproblem’s convex objective function. In addition, we present a family of heuristic solution approaches and compare our methods with several MINLP (Mixed-Integer Nonlinear Programming) commercial solvers in order to benchmark their efficiency and quality. 相似文献