首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 93 毫秒
1.
夏良杰  柳慧  黄迎  李友东  孙莹 《运筹与管理》2021,30(10):199-205
研究碳交易规制下制造商减排服务外包时供应链各成员的最优决策和绩效问题,对比分析了定制和订购两种减排模式下的供应链博弈均衡和供应链成员绩效。研究发现,在碳交易规制下,定制和订购两种减排合作模式下供应链成员均存在最优决策。在定制模式下,单位产品的初始排放量和制造商的减排成本系数提高一定会降低最优产量、单位产品减排量和减排服务价格,减排服务商的减排成本系数提高会降低最优产量和单位产品减排量,但不一定会降低减排服务价格;在订购模式下单位产品初始排放量、制造商和减排服务商的成本系数对企业决策的影响不一定如此。当需求函数满足均匀分布时,无论制造商和减排服务商的减排效率如何,订购模式对减排服务商更有利,定制模式对制造商更有利,但供应链系统总利润的高低与制造商的减排成本系数有关。  相似文献   

2.
在对我国物流业碳排放特征进行分析的基础上,运用LMDI分解技术,建立中国物流业人均碳排放的因素分解模型,定量分析了1991-2010年能源结构、能源效率、运输方式、物流发展、经济增长以及人口等6种因素对物流业人均碳排放的影响.分析表明:经济增长是拉动物流业碳排放增长最主要的动力,在研究期间呈指数增长的趋势.运输方式对碳排放增长也表现出明显的促进作用,能源结构和能源效率虽然表现出拉动作用,但效果微弱.而物流发展因素则对物流业人均碳排放量表现出明显的抑制作用.因此,应大力推进物流业科技水平的提高,进一步发挥物流发展因素对碳排放的抑制作用,同时,优化物流运输体系,形成以铁路为主体,水运和管道为支撑,公路和航空运输为辅的低碳化的综合运输体系.  相似文献   

3.
The classical economic lot-sizing problem assumes that a single supplier and a single transportation mode are used to replenish the inventory. This paper studies an extension of this problem where several suppliers and transportation modes are available. The decision-making process in this case involves identifying (i) the timing for an order; (ii) the choice of shipment modes; and (iii) the order size for each mode. The problem is defined as a network flow problem with multiple setups cost function and additional side constraints. This study provides an MIP formulation for the problem. We also provide an additional formulation of the problem by redefining its decision variables and show that the dual of the corresponding LP-relaxation has a special structure. We take advantage of the structure of the dual problem to develop a primal–dual algorithm that generates tight lower and upper bounds. Computational results demonstrate the effectiveness of the algorithm.  相似文献   

4.
For the uncapacitated two-level production-in-series T period lot-sizing model, a dynamic program with running time O(T2logT) and a compact and tight extended formulation with O(T3) variables and O(T2) equality constraints are presented. Limited computational comparisons of various formulations of two-level production/transportation problems with multiple clients are reported.  相似文献   

5.
In this paper we generalize the classical dynamic lot-sizing problem by considering production capacity constraints as well as delivery and/or production time windows. Utilizing an untraditional decomposition principle, we develop a polynomial-time algorithm for computing an optimal solution for the problem under the assumption of non-speculative costs. The proposed solution methodology is based on a dynamic programming algorithm that runs in O(nT4) time, where n is the number of demands and T is the length of the planning horizon.  相似文献   

6.
For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a scenario tree, we present various reformulations based on mixing sets. We also show how earlier results for uncapacitated problems involving (Q,SQ) inequalities can be simplified and extended. Finally some limited computational results are presented.  相似文献   

7.
8.
We consider a multi-item lot-sizing problem with joint set-up costs and constant capacities. Apart from the usual per unit production and storage costs for each item, a set-up cost is incurred for each batch of production, where a batch consists of up to C units of any mix of the items. In addition, an upper bound on the number of batches may be imposed. Under widely applicable conditions on the storage costs, namely that the production and storage costs are nonspeculative, and for any two items the one that has a higher storage cost in one period has a higher storage cost in every period, we show that there is a tight linear program with O(mT 2) constraints and variables that solves the joint set-up multi-item lot-sizing problem, where m is the number of items and T is the number of time periods. This establishes that under the above storage cost conditions this problem is polynomially solvable. For the problem with backlogging, a similar linear programming result is described for the uncapacitated case under very restrictive conditions on the storage and backlogging costs. Computational results are presented to test the effectiveness of using these tight linear programs in strengthening the basic mixed integer programming formulations of the joint set-up problem both when the storage cost conditions are satisfied, and also when they are violated.  相似文献   

9.
We study valid inequalities for optimization models that contain both binary indicator variables and separable concave constraints. These models reduce to a mixed-integer linear program (MILP) when the concave constraints are ignored, or to a nonconvex global optimization problem when the binary restrictions are ignored. In algorithms designed to solve these problems to global optimality, cutting planes to strengthen the relaxation are traditionally obtained using valid inequalities for the MILP only. We propose a technique to obtain valid inequalities that are based on both the MILP constraints and the concave constraints. We begin by characterizing the convex hull of a four-dimensional set consisting of a single binary indicator variable, a single concave constraint, and two linear inequalities. Using this analysis, we demonstrate how valid inequalities for the single node flow set and for the lot-sizing polyhedron can be “tilted” to give valid inequalities that also account for separable concave functions of the arc flows. We present computational results demonstrating the utility of the new inequalities for nonlinear transportation problems and for lot-sizing problems with concave costs. To our knowledge, this is one of the first works that simultaneously convexifies both nonconvex functions and binary variables to strengthen the relaxations of practical mixed-integer nonlinear programs.  相似文献   

10.
物流是社会生产活动中的耗能大户。近年来,电子商务行业的快速发展促使电子商务物流成为社会物流活动中重要的一部分,因而有效降低电子商务物流活动中每个环节的碳排放量对于改善社会环境、提高人类生活水平有巨大的作用。本文基于车辆载重会对耗油量产生影响的前提,采用了VRP(Vehicle Routing Problem)以及聚类分析等多种模型分别优化计算现有的各种配送模式下的车辆能耗,以解决电商物流中最后一公里的配送问题。然后,利用公式计算各种模式的总能耗和碳排放量,进而对比分析不同配送模式下的碳排放量和主要影响因素。研究表明,不同配送模式的碳排放量及关键影响因素各不相同。不仅如此,本文还基于环保视角对最后一公里的配送问题提供了重要参考意见。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号