首页> 外文期刊>Knowledge-Based Systems >Fourth party logistics routing problem model with fuzzy duration time and cost discount
【24h】

Fourth party logistics routing problem model with fuzzy duration time and cost discount

机译:持续时间模糊和成本折扣的第四方物流路径问题模型

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

摘要

In this paper, from the viewpoint of a fourth party logistics (4PL) provider, a multi-source single-destination 4PL routing problem with fuzzy duration time and cost discount (M-S 4PLRPFC) is described considering the comprehensive ability of 3PL suppliers and nodes. A chance-constrained programming model is established for the M-S 4PLRPFC. Next, a memetic algorithm (MA) with a fuzzy simulation method is designed to solve the problem. Based on a set of problem instances as the test bed, experiments are performed to compare the performance of the proposed MA with those of the enumeration method and a standard genetic algorithm (SGA). The experimental results show that the proposed MA obtains the same results as the enumeration method and that it is than the SGA.
机译:本文从第四方物流(4PL)提供商的角度出发,考虑了3PL供应商和节点的综合能力,描述了具有模糊持续时间和成本折扣的多源单目的地4PL路由问题(M-S 4PLRPFC)。为M-S 4PLRPFC建立了机会受限的编程模型。接下来,设计了具有模糊仿真方法的模因算法(MA)来解决该问题。基于一组问题实例作为测试平台,进行实验以比较建议的MA与枚举方法和标准遗传算法(SGA)的性能。实验结果表明,提出的MA获得了与枚举方法相同的结果,并且比SGA要好。

著录项

  • 来源
    《Knowledge-Based Systems》 |2013年第9期|14-24|共11页
  • 作者单位

    College of Information Science and Engineering, Northeastern University, Shenyang, Liaoning 110819, China,State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, Liaoning 110819, China;

    College of Information Science and Engineering, Northeastern University, Shenyang, Liaoning 110819, China,State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, Liaoning 110819, China;

    School of Computer Science and Informatics, De Montfort University, Leicester LE1 9BH, UK,State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, Liaoning 110819, China;

    Department of Industrial and Systems Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260, Singapore,Logistics Engineering College, Shanghai Maritime University, Shanghai 201306, China;

    College of Information Science and Engineering, Northeastern University, Shenyang, Liaoning 110819, China,State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, Liaoning 110819, China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Fourth party logistics; Routing problem; Chance constrained programming; Memetic algorithm; Local search;

    机译:第四方物流;路由问题;机会约束编程;模因算法;本地搜寻;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号