期刊论文

Fresh food vehicle routing problem with split deliveries and customer classification

中文

计算机集成制造系统

1006-5911

2021

27

4

1238-1248

10.13196/j.cims.2021.04.027

15BGL083:国家社会科学基金 19B610:湖南省教育厅优秀青年项目 2019YJ005:***科研启动基金 2019-65:中南林业科技大学教学改革资助项目 2019TP1015:湖南省重点实验室项目 2020CSLKT3-089:中国物流学会项目 2020-124:中南林业科技大学大学生创新创业训练计划项目 2020-175:国家级大学生科技创新项目 2020-176:国家级大学生科技创新项目

本校为第一机构

为促进生鲜农产品流通、降低生鲜物流配送成本,结合生鲜农产品的生鲜损耗,研究了一种带客户分级和需求可拆分的生鲜车辆路径问题。此文的需求可拆分为需求依背包拆分,是一种需求离散拆分的新类型,即每个客户的生鲜需求量可由多个背包离散组合而成。依据客户的重要性来实施分级处理,将软时间窗和需求依背包拆分纳入约束,并将生鲜损耗费用纳入目标,构建了相应的多目标数学模型。为了提升禁忌搜索算法（TSA）的寻优性能,设计了动态禁忌表,并将自适应惩罚机制、多邻域结构体、禁忌表重新初始化等策略纳入TSA中,设计了一种带动态禁忌表的自适应TSA进行求解。通过对比分析验证了算法的有效性。

To promote the circulation of fresh agricultural products and reduce the cost of fresh logistics distribution,a fresh food vehicle routing problem with split deliveries and customer classification was studied based on the fresh loss of fresh agricultural products.The type of split deliveries by backpack was a new form of discrete split.It was stipulated that the fresh demand of each customer could be discretely combined by multiple backpacks.According to the importance,the customer was classified.The soft time windows and the type of split deliveries by backpack were used as constraints,and th...