首页> 外文期刊>International Journal of Production Research >A probability guided evolutionary algorithm for multi-objective green express cabinet assignment in urban last-mile logistics
【24h】

A probability guided evolutionary algorithm for multi-objective green express cabinet assignment in urban last-mile logistics

机译:城市最后一公里物流中多目标绿色快递柜分配的概率指导进化算法

获取原文
获取原文并翻译 | 示例
       

摘要

In the past decade, urban last-mile logistics (ULML) has attracted increasing attention with the growth of e-commerce. Under this background, express cabinet has been gradually advocated to improve the efficiency of ULML. This paper focuses on the multi-objective green express cabinet assignment problem (MGECAP) in ULML, where the objectives to be minimised are the total cost and the energy consumption. MGECAP is concerned with optimising the purchase and assignment decision of express cabinets, which is different from conventional assignment problems. To solve MGECAP, firstly, the integer programming model and the corresponding surrogate model are established. Secondly, problem-dependent heuristics, including the solution representation, genetic operators, and repair strategy of infeasible solutions, are proposed. Thirdly, a probability guided multi-objective evolutionary algorithm based on decomposition (PG-MOEA/D) is proposed, which can balance the limited computation resource among sub-problems during the iterative process. Meanwhile, a feedback strategy is put forward to alternatively generate new solutions when the probability condition is not satisfied. Finally, numerical results and a real-life case study demonstrate the effectiveness and the practical values of the PG-MOEA/D.
机译:在过去的十年中,随着电子商务的发展,城市最后一英里物流(ULML)引起了越来越多的关注。在这种背景下,快递柜逐渐被提倡提高ULML的效率。本文关注ULML中的多目标绿色快递柜分配问题(MGECAP),其中要最小化的目标是总成本和能耗。 MGECAP关注优化快递柜的购买和分配决策,这与常规分配问题不同。为了解决MGECAP,首先建立了整数规划模型和相应的代理模型。其次,提出了基于问题的启发式方法,包括解决方案表示,遗传算子和不可行解决方案的修复策略。第三,提出了一种基于概率的基于分解的多目标进化算法(PG-MOEA / D),该算法可以在迭代过程中平衡子问题之间有限的计算资源。同时提出了一种反馈策略,在不满足概率条件的情况下交替产生新的解。最后,数值结果和实际案例研究证明了PG-MOEA / D的有效性和实用价值。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号