| 402 | 33 | 365 |
| 下载次数 | 被引频次 | 阅读次数 |
考虑配送具有多车型、同时取货和送货等情形,研究带同时取送货的选址-多车型路径问题,建立相应的数学模型,并设计了求解该模型的改进遗传算法。为了对所构建模型及算法进行验证,设计了相应的算例进行仿真分析。算例测试结果表明这是求解带同时取送货的选址-多车型路径优化问题的一种有效方法。
Abstract：Considering a distribution case with multi-kind vehicles and simultaneous pick up and delivery,a location-routing problem with simultaneous pickup and delivery was studied. A mathematical model was constructed, and a genetic algorithm to solve the model was designed for this problem. In order to verify the model and algorithm, a corresponding example was designed and simulated. The results of the numerical example show that this is an effective method to solve the location-routing problem with simultaneous pickup and delivery.
[1]汪寿阳,赵秋红,夏国平.集成物流管理系统中定位-运输路线安排问题的研究[J].管理科学学报,2000,(2):69-75.
[2]Averbakh I,Berman O.Routing and location-routing p-delivery men problems on a path[J].Transportation Science,1994,28(2):162~166.
[3]罗耀波,孙延明.基于模糊时间窗的带容积约束选址路径问题[J].系统工程,2014,(1):19-25.
[4]石兆,符卓.配送选址-多车型运输路径优化问题及求解算法[J].计算机科学,2015,(42):245-250.
[5]张晓楠,范厚明,李剑锋.同时配集货定位—路线问题的变邻域分散搜索算法[J].计算机集成制造系统,2015,(9):2535-2548.
[6]Salman,Ahmad,Al-Madani.Particle swarm optimization for task assignment problem[J].Microprocessors and Microsystems,2002,26(8):363-371.
基本信息:
中图分类号:U116.2
引用信息:
[1]孙青伟,张杨.带同时取送货的选址-多车型路径问题研究[J],2017,15(02):100-104+118.