无中心多点到多点配送问题建模与求解  

Modeling and Solution of Multiple-start/end Acentric Distribution Problem

作　　者：卢炜达 罗世平[2] LU Weida;LUO Shiping(School of Business,Macao University of Science&Technology,Macao 999078;School of Mathematical Sciences,South China Normal University,Guangzhou 510631,China)

机构地区：[1]澳门科技大学商学院,澳门999078 [2]华南师范大学数学科学学院,广东广州510631

出　　处：《物流技术》2021年第12期90-95,共6页Logistics Technology

摘　　要：针对外卖配送客户与订单随机产生,外卖骑手劳动强度极大但服务效率不够高等问题,提出无配送中心的多点到多点配送问题建模思路,并基于启发式算法求解。算例选用常见的10个订单业务,在一个社区内随机选择10个取货点和10个送货点,求解证明骑手一个小时内可以完成任务,方案可行有效。Due to the randomness of takeout delivery orders as well as their destinations,deliverers often have to work intensively at low service efficiency.In light of this,we proposed the line of thinking for the multi-point to multi-point distribution model without a distribution center,and solved it using the heuristic algorithm.Next through a numerical example involving ten common orders,we randomly selected 10 pickup points and 10 delivery points in a community,and applied the model to prove that a deliverer could complete its task within an hour,concluding that the model was feasible and effective.

关 键 词：外卖配送 无中心 多点到多点 遗传算法 

分 类 号：F224.0[经济管理—国民经济] F252.14