The decision-making and optimization of two-echelon inventory coordination were analyzed with service level constraint and controllable lead time sensitive to order quantity.First,the basic model of this problem was e...The decision-making and optimization of two-echelon inventory coordination were analyzed with service level constraint and controllable lead time sensitive to order quantity.First,the basic model of this problem was established and based on relevant analysis,the original model could be transformed by minimax method.Then,the optimal order quantity and production quantity influenced by service level constraint were analyzed and the boundary of optimal order quantity and production quantity was given.According to this boundary,the effective method and tactics were put forward to solve the transformed model.In case analysis,the optimal expected total cost of two-echelon inventory can be obtained and it was analyzed how service level constraint and safety factor influence the optimal expected total cost of two-echelon inventory.The results show that the optimal expected total cost of two-echelon inventory is constrained by the higher constraint between service level constraint and safety factor.展开更多
针对模糊需求下的绿色两级车辆路径问题,以最小化车辆运营成本和油耗成本之和为优化目标,提出一种混合超启发式算法进行求解.首先,考虑两级问题解空间庞大且相互耦合,设计一种聚类分解策略将该问题分解为多个子问题,以合理缩小问题搜索...针对模糊需求下的绿色两级车辆路径问题,以最小化车辆运营成本和油耗成本之和为优化目标,提出一种混合超启发式算法进行求解.首先,考虑两级问题解空间庞大且相互耦合,设计一种聚类分解策略将该问题分解为多个子问题,以合理缩小问题搜索空间;然后,提出增强超启发式分布估计算法(enhanced hyperheuristic estimation of distribution algorithm,EHHEDA)对各个子问题进行求解,进而获得原问题的解.EHHEDA基于超启发式算法框架,在高层策略域设计一种基于三维概率模型的分布估计算法,动态确定由底层操作域中各搜索算子所组成的排列(即高层个体),可有效控制和引导整个算法的搜索行为;同时,在底层操作域设计10种有效邻域搜索算子,并加入重升温操作的模拟退火机制作为问题解(即底层个体)的接受准则,有利于在问题解空间中执行深入搜索.仿真实验结果表明,所提出的算法在大多数测试集上优于近年来用于求解类似问题的算法,验证了所提出算法的有效性.展开更多
Two-echelon routing problems,including variants such as the two-echelon vehicle routing problem(2E-VRP)and the two-echelon location routing problem(2E-LRP),involve assignment and location decisions.However,the two-ech...Two-echelon routing problems,including variants such as the two-echelon vehicle routing problem(2E-VRP)and the two-echelon location routing problem(2E-LRP),involve assignment and location decisions.However,the two-echelon time-constrained vehicle routing problem(2E-TVRP)that caters to from-linehaul-to-delivery practices does not involve assignment decisions.This routing problem variant for networks with two eche-lons has not yet attracted enough research interest.Localized or long-distance services suffer from the lack of the assignment decisions between satellites and customers.Therefore,the 2E-TVRP,rather than using assignment decisions,adopts time constraints to decide the routes on each of the two interacting echelons:large-capacity vehicles trans-port cargoes among satellites on the first echelon,and small-capacity vehicles deliver cargoes from satellites to customers on the second echelon.This study introduces a mixed integer linear programming model for the 2E-TVRP and proposes a heuristic algorithm that incorporates the savings algorithm followed by a variable neighborhood search phase.Illustrative examples are used to test the mathematical formulation and the heuristic and a case study is used to demonstrate that the heuristic can effectively solve realistic-size instances of the 2E-TVRP.展开更多
基金Project(71102174,71372019)supported by the National Natural Science Foundation of ChinaProject(9123028)supported by the Beijing Natural Science Foundation of China+3 种基金Project(20111101120019)supported by the Specialized Research Fund for Doctoral Program of Higher Education of ChinaProject(11JGC106)supported by the Beijing Philosophy&Social Science Foundation of ChinaProjects(NCET-10-0048,NCET-10-0043)supported by the Program for New Century Excellent Talents in University of ChinaProject(2010YC1307)supported by Excellent Young Teacher in Beijing Institute of Technology of China
文摘The decision-making and optimization of two-echelon inventory coordination were analyzed with service level constraint and controllable lead time sensitive to order quantity.First,the basic model of this problem was established and based on relevant analysis,the original model could be transformed by minimax method.Then,the optimal order quantity and production quantity influenced by service level constraint were analyzed and the boundary of optimal order quantity and production quantity was given.According to this boundary,the effective method and tactics were put forward to solve the transformed model.In case analysis,the optimal expected total cost of two-echelon inventory can be obtained and it was analyzed how service level constraint and safety factor influence the optimal expected total cost of two-echelon inventory.The results show that the optimal expected total cost of two-echelon inventory is constrained by the higher constraint between service level constraint and safety factor.
文摘针对模糊需求下的绿色两级车辆路径问题,以最小化车辆运营成本和油耗成本之和为优化目标,提出一种混合超启发式算法进行求解.首先,考虑两级问题解空间庞大且相互耦合,设计一种聚类分解策略将该问题分解为多个子问题,以合理缩小问题搜索空间;然后,提出增强超启发式分布估计算法(enhanced hyperheuristic estimation of distribution algorithm,EHHEDA)对各个子问题进行求解,进而获得原问题的解.EHHEDA基于超启发式算法框架,在高层策略域设计一种基于三维概率模型的分布估计算法,动态确定由底层操作域中各搜索算子所组成的排列(即高层个体),可有效控制和引导整个算法的搜索行为;同时,在底层操作域设计10种有效邻域搜索算子,并加入重升温操作的模拟退火机制作为问题解(即底层个体)的接受准则,有利于在问题解空间中执行深入搜索.仿真实验结果表明,所提出的算法在大多数测试集上优于近年来用于求解类似问题的算法,验证了所提出算法的有效性.
基金This research work was supported by the Research Grant from the National Natural Science Foundation of China(grant number 71672005).
文摘Two-echelon routing problems,including variants such as the two-echelon vehicle routing problem(2E-VRP)and the two-echelon location routing problem(2E-LRP),involve assignment and location decisions.However,the two-echelon time-constrained vehicle routing problem(2E-TVRP)that caters to from-linehaul-to-delivery practices does not involve assignment decisions.This routing problem variant for networks with two eche-lons has not yet attracted enough research interest.Localized or long-distance services suffer from the lack of the assignment decisions between satellites and customers.Therefore,the 2E-TVRP,rather than using assignment decisions,adopts time constraints to decide the routes on each of the two interacting echelons:large-capacity vehicles trans-port cargoes among satellites on the first echelon,and small-capacity vehicles deliver cargoes from satellites to customers on the second echelon.This study introduces a mixed integer linear programming model for the 2E-TVRP and proposes a heuristic algorithm that incorporates the savings algorithm followed by a variable neighborhood search phase.Illustrative examples are used to test the mathematical formulation and the heuristic and a case study is used to demonstrate that the heuristic can effectively solve realistic-size instances of the 2E-TVRP.