基于改进HBA算法的生鲜闭环供应链网络鲁棒优化设计

针对生鲜闭环供应链网络设计问题,建立了一种基于生鲜闭环供应链网络的鲁棒优化模型,以解决供应链网络中的不确定性问题。首先,针对涵盖五个节点的生鲜供应链网络结构建立了多周期、多产品,以最小化成本、最小环境影响为目标的混合整数规划模型,采用模糊折中规划与区间数据鲁棒优化方法进行处理;其次,在原有蜜獾算法的基础上引入差分进化原则,增强算法的全局搜索能力与收敛速度;最后,通过MATLAB数值分析与仿真实例表明,所提鲁棒优化模型与蜜獾算法在求解生鲜闭环供应链网络设计问题中具有明显优势。     

基于改进鲸鱼优化算法的血液供应链网络多目标鲁棒优化设计

为解决血液供应链网络设计中的不确定性问题,建立了一种血液供应链网络多目标鲁棒优化设计模型。首先,针对带有5个节点的血液供应链网络,建立考虑安全库存的、目标为成本最小、存储时间最短的优化函数,并采用ε约束、Pareto最优和鲁棒优化方法对已建模型进行处理,将多目标问题转化为单目标鲁棒问题;其次,对原有鲸鱼优化算法（WOA）进行改进,引入差分算法的交叉和变异理念,增强了搜索能力并改善了局限性,从而得到差分鲸鱼优化算法（DWOA）,并采用此算法对处理后的模型求解。通过数值实例,验证当测试问题相同时,优化模型在需求短缺方面比确定模型的短缺量平均少76%。因此,所提优化模型在应对需求短缺时更具优势;通过仿真对比分析图像,得出DWOA相比WOA、粒子群优化（PSO）算法和遗传算法（GA）中断时间更短并且成本更低。     

不确定旅行商问题的鲁棒模型与算法

考虑到不确定参数在旅行商问题(TSP)中广泛存在,在Bertsimas鲁棒离散优化理论的框架下,建立了不确定旅行商问题的鲁棒优化模型,并按转换规则将鲁棒模型转换为鲁棒对等模型。给出了一种求解旅行商问题的基于Prufer数编码的单亲遗传算法,与求解该类问题的传统遗传算法相比,该算法缩减了染色体长度,避免了传统交叉和变异操作破坏染色体可行解的缺陷。通过算例验证,表明该算法有较高的求解效率,所建立的鲁棒模型在不确定环境下能得到较好的鲁棒解。     

可持续闭环供应链网络的多目标优化研究

针对可持续的闭环5供应链网络优化问题,考虑柔性供应策略、设施改造对网络优化的影响,并以经济成本最小、碳排放量最低、社会效益最大为优化目标,构建了多目标的多情景-模糊优化模型。针对模型中的不确定参数,用三角模糊数与多情景优化的方法处理其模糊性和随机性,然后根据不同的分析角度,分别用线性加权法和NSGA-[Ⅱ]算法对模型进行求解,基于算例的求解结果,对目标权重的灵敏度、模型的稳健性以及目标间的冲突性进行了分析。证明了考虑柔性供应策略和设施改造问题的必要性;给出了闭环供应链网络设计的决策建议。     

低碳环境下闭环供应链网络设计多目标鲁棒模糊优化问题

针对低碳环境下多级闭环供应链网络设计的战略定位和配置问题,综合考虑网络参数的模糊性以及多产品流,以供应链网络的总成本和总碳排放最小为目标,建立多目标鲁棒模糊优化模型.该模型将机会约束的最低置信水平作为决策变量,实现目标函数期望值、最优鲁棒性和可行鲁棒性之间的有效平衡.最后,设计一种基于必要性测度的交互式$\varepsilon$约束模糊求解方法,并通过算例验证所提模型和算法的有效性和可行性.     

应急物流车辆调度多目标鲁棒优化研究

针对应急物流车辆调度问题中对于经济性、时效性、可靠性和鲁棒性的多种要求，考虑了含有时间窗、不确定需求、不确定行驶时间，以及路段含有失效风险的多目标鲁棒车辆路径优化问题，通过定义新的成本函数、满意度函数、风险度函数和鲁棒度函数作为四个优化目标来构建模型，并基于鲁棒优化理论将不确定模型转化为确定性鲁棒对应模型求解，为解决不确定环境下优化问题提供了新的思路。算法方面，主要基于SPEA2算法框架求解该多目标模型，针对算法缺陷提出多种改进策略，并通过对比实验证明了改进策略的有效性。     

考虑多重覆盖的应急设施多级协同布局鲁棒优化

应急设施的合理布局是灾后实现物资高效、公平和稳定供应的重要保障.针对突发自然灾害的不确定性,研究基于多重覆盖的应急设施多级协同布局鲁棒优化问题.首先,提出多级设施选址下的多重覆盖水平函数,以最小覆盖水平和期望总成本最优为目标,建立应急设施多级协同选址双目标优化模型;其次,应用基数不确定集和p-鲁棒方法构建两类鲁棒优化模型,分别研究场景内不确定需求和随机场景对设施布局的影响;最后,以湖南省救灾备荒种子储备库选址为例进行实证分析,验证所提出优化模型的有效性.研究结果表明:多级协同布局相比传统布局方案更具优势;鲁棒优化模型能够有效应对不确定情形和随机场景下的物资需求;决策者的风险偏好程度和预算水平对设施协同布局有重要影响,需对二者进行综合权衡.     

可持续闭环供应链网络设计的多目标模糊规划问题

为解决不确定条件下可持续闭环供应链网络设计的问题,以成本和环境影响最小、社会影响最大为目标,建立带有模糊参数的多目标闭环供应链网络规划模型.首先采用Me测度处理相关模糊目标和参数,并运用加权增广Epsilon-约束方法解决多目标问题,在此基础上设计一种基于[0, 1]随机数的双层编码遗传鲸鱼(GA–WOA)混合算法进行求解,然后构造多个不同规模算例,将混合算法求解结果与CPLEX、遗传算法的求解结果进行对比,结果证明该编码方式和混合算法具有合理性.最后针对模型的多个参数变化进行分析,以验证所建模型的可行性.     

碳税影响下再制造物流网络鲁棒优化模型

为了解决不确定环境下低碳再制造物流网络设计的问题,在政府征收企业碳税的情况下,综合考虑网络中再制造产品需求量和废旧产品质量的不确定性以及设施选址和节点间运输路线的决策问题,采用鲁棒优化方法,以碳税成本和物流成本之和最小化为目标,建立了再制造物流网络鲁棒混合线性规划模型。通过案例验证了鲁棒模型的可行性,就税率和不确定参数的变化进行分析,表明鲁棒模型的决策具有实用性和有效性。     

易腐品多周期闭环物流网络鲁棒优化模型

针对不同周期的易腐品需求与退货不确定性问题,构建了易腐品多周期闭环物流网络,并设计了对应的混合整数线性规划（MILP）模型,以实现最低系统总成本、最佳设施选址以及最优配送车辆运输路径的决策。为有效规避不确定参数的影响,采用基约束鲁棒方法,将模型中的部分清晰约束转换为鲁棒对应式。以上海市果蔬农产品企业为实例,通过遗传算法对模型进行求解。结果表明,相对单周期而言,多周期系统具有动态性、系统成本更低的优点,同时通过不确定预算参数的变化分析,验证了鲁棒模型的可行性与有效性,进而为不确定环境下构建多周期闭环物流网络及降低系统成本提供了借鉴。     

A genetic algorithm for the vendor-managed inventory routing problem with lost sales

This paper proposes a genetic algorithm (GA) for the inventory routing problem with lost sales under a vendor-managed inventory strategy in a two-echelon supply chain comprised of a single manufacturer and multiple retailers. The proposed GA is inspired by the solving mechanism of CPLEX for the optimization model of the problem. The proposed GA determines replenishment times and quantities and vehicle routes in a decoupled manner, while maximizing supply chain profits. The proposed GA is compared with the optimization model with respect to the effectiveness and efficiency in various test problems. The proposed GA finds solutions in a short computational time that are very close to those obtained with the optimization model for small problems and solutions that are within 3.2% of those for large problems. Furthermore, sensitivity analysis is conducted to investigate the effects of several problem parameters on the performance of the proposed GA and total profits.     

Multiobjective fuzzy mathematical model for a financially constrained closed-loop supply chain with labor employment

This paper addresses the multiobjective, multiproducts and multiperiod closed-loop supply chain network design with uncertain parameters, whose aim is to incorporate the financial flow as the cash flow and debts' constraints and labor employment under fuzzy uncertainty. The objectives of the proposed mathematical model are to maximize the increase in cash flow, maximize the total created jobs in the supply chain, and maximize the reliability of consumed raw materials. To encounter the fuzzy uncertainty in this model, a possibilistic programming approach is used. To solve large-sized problems, the multiobjective simulated annealing algorithm, multiobjective gray wolf optimization, and multiobjective invasive weed optimization are proposed and developed. The numerical results demonstrate that these algorithms solve the problems within about 1% of the required solving time for the augmented ε-constraint and have similar performance and even better in some cases. The multiobjective simulated annealing algorithm with a weak performance takes less time than the other two algorithms. The multiobjective gray wolf optimization and multiobjective invasive weed optimization algorithms are superior based on the multiobjective performance indices.     

An interactive possibilistic programming approach for a multi-objective closed-loop supply chain network under uncertainty

In this article, we first propose a closed-loop supply chain network design that integrates network design decisions in both forward and reverse supply chain networks into a unified structure as well as incorporates the tactical decisions with strategic ones (e.g., facility location and supplier selection) at each period. To do so, various conflicting objectives and constraints are simultaneously taken into account in the presence of some uncertain parameters, such as cost coefficients and customer demands. Then, we propose a novel interactive possibilistic approach based on the well-known STEP method to solve the multi-objective mixed-integer linear programming model. To validate the presented model and solution method, a numerical test is accomplished through the application of the proposed possibilistic-STEM algorithm. The computational results demonstrate suitability of the presented model and solution method.     

A particle swarm approach for optimizing a multi-stage closed loop supply chain for the solar cell industry

In order to implement sustainable strategies in a supply chain, enterprises should provide highly favorable and effective solutions for reducing carbon dioxide emissions, which brings out the issues of designing and managing a closed-loop supply chain (CLSC). This paper studies an integrated CLSC network design problem with cost and environmental concerns in the solar energy industry from sustainability perspectives. A multi-objective closed-loop supply chain design (MCSCD) model has been proposed, in consideration of many practical characteristics including flow conservation at each production/recycling unit of forward/reverse logistics (FL/RL), capacity expansion, and recycled components. A deterministic multi-objective mixed integer linear programming (MILP) model capturing the tradeoffs between the total cost and total CO₂ emissions was developed to address the multistage CSLC design problem. Subsequently, a multi-objective PSO (MOPSO) algorithm with crowding distance-based nondominated sorting approach is developed to search the near-optimal solution of the MCSCD model. The computational study shows that the proposed MOPSO algorithm is suitable and effective for solving large-scale complicated CLSC structure than the conventional branch-and-bound optimization approach. Analysis results show that an enterprise needs to apply an adequate recycling strategy or energy saving technology to achieve a better economic effectiveness if the carbon emission regulation is applied. Consequently, the Pareto optimal solution obtained from MOPSO algorithm may give the superior suggestions of CLSC design, such as factory location options, capacity expansion, technology selection, purchasing, and order fulfillment decisions in practice.     

Simulation-based heuristic method for container supply chain network optimization

With the emerging of free trade zones (FTZs) in the world, the service level of container supply chain plays an important role in the efficiency, quality and cost of the world trade. The performance of container supply chain network directly impacts its service level. Therefore, it is imperative to seek an appropriate method to optimize the container supply chain network architecture. This paper deals with the modeling and optimization problem of multi-echelon container supply chain network (MCSCN). The problem is formulated as a mixed integer programming model (MIP), where the objective is subject to the minimization of the total supply chain service cost. Since the problem is well known to be NP-hard, a novel simulation-based heuristic method is proposed to solving it, where the heuristic is used for searching near-optimal solutions, and the simulation is used for evaluating solutions and repairing unfeasible solutions. The heuristic algorithm integrates genetic algorithm (GA) and particle swarm optimization (PSO) algorithm, where the GA is used for global search and the PSO is used for local search. Finally, computational experiments are conducted to validate the performance of the proposed method and give some managerial implications.     

电网中断下基于DWOA的生鲜产品闭环供应链网络多目标模糊优化设计

针对生鲜产品供应链网络设计问题,建立了一种电网中断下的闭环生鲜供应链网络多目标模糊优化设计模型,以此解决供应链网络设计中的不确定性问题.首先,针对电网中断下生鲜产品闭环供应链网络结构设计,建立目标为成本最小、碳排放最少、中断时间最短的优化函数,采用Me测度和三角模糊数对该模型进行处理,将多目标问题转换为单目标问题;其次,在原有鲸鱼算法的基础上,引入差分算法的交叉和变异理念,增强其搜索能力,改善其局限性,得到改进差分鲸鱼优化算法(DWOA),并采用此方法对处理后的模型求解;最后,通过数值实例和敏感性分析表明,提出的算法和模型在处理生鲜产品供应链网络优化设计方面具有较强的求解能力,且计算时间较短.     

逆向物流供应链最佳供应商选择及订单量分配*

为解决逆向物流供应链中,供应商选择、订单量分配和提货点位置等不确定问题,建立了一个新的模糊多目标数学模型来确定最佳供应商选择、供应量及提货点位置,为避免在解决多目标模型时人为主观赋权,运用基于模糊目标规划的蒙特卡罗仿真模型来求解帕累托(pareto)理想解,采用遗传算法进行求解,并给出了相应优化方案,在此基础上研究讨论了不同权重分配下结果的优劣性及供应商选择风险,最后,针对不同权重分配,比较了遗传算法和Gurobi求解,实验表明,对于该问题模型遗传算法在解的优劣性上优于Gurobi。     

Two hybrid meta-heuristic algorithms for a dual-channel closed-loop supply chain network design problem in the tire industry under uncertainty

There is so much interest in online purchasing within supply chain networks nowadays. After expanding the internet access and services, customers’ behavior has changed. Today, a customer’s shopping manner usually begins with the internet search. With this approach, we face some new trends in this field, such as online-to-offline (O2O) commerce that aims to balance online and offline sales. Regarding the supply chain management, the O2O commerce can help the managers to conduct both online and offline businesses. The tire industry is one of the applications of the O2O approach, which also directly affects the supply chain network design (SCND). Therefore, this work for the first time proposes a dual-channel, multi-product, multi-period, multi-echelon closed-loop SCND under uncertainty for the tire industry. To tackle the uncertain parameters of the problem (e.g., prices and demand), a fuzzy approach, so-called the Jimenez’s method, is applied. Another main innovation of this work is two new hybrid meta-heuristic algorithms with new procedures. Two recent nature-inspired algorithms (i.e., red deer algorithm (RDA) and whale optimization algorithm (WOA)) are hybridized with the genetic algorithm (GA) and simulated annealing (SA) to strengthen the diversification and intensification phases, respectively. The numerical experiments demonstrate that the hybrid version of WOA and SA returns high-quality solutions and requires an acceptable amount of computational time. The conducted sensitivity analyses underline the importance of tire remanufacturing. Furthermore, setting the appropriate prices in different channels for the available tire types is critical for sustainable tire supply chain management.     

求解供应链优化问题的广义遗传算法

供应链优化研究是供应链管理中的一个重要问题,也是一个难题,针对该问题,提出了一个新型供应链优化模型,并且构造了广义遗传算法对其求解,该算法融入了特殊的演化规则,克服了遗传算法局部收敛的缺陷,提高了全局收敛的能力,实验表明对供应链优化问题的求解,广义遗传算法优于传统的遗传算法和分枝界定法。