期刊文献+

预制混凝土构件生产物料重调配路径规划方法 被引量:7

Vehicle Routing Method for Redispatching Parts of Precast Components During Precast Production
下载PDF
导出
摘要 分析预制混凝土构件生产中物料重调配路径规划问题的优化目标和限制条件,建立载具路径规划模型(vehicle routing model for redispatching parts of precast components,VRM-RPP)及其求解方法.该方法通过优化分配和利用载具资源,合理规划行进路径,以提高重调配工作效率,确保车间尽早开工.算例验证结果表明,该方法可用于优化预制生产中物料重调配路径. A vehicle routing model for redispatching parts of precast components (VRM-RPP) was established based of the analysis on the optimization constraints and objectives of the rescheduling problem. Then, the solving method for the model was proposed based on the VRM-RPP and the genetic algorithm. The method improves the redispatching efficiency and thus shortens the preparation time for production restarting by optimizing the allocation and routes of vehicles for redispatching. A case study demonstrates that the algorithm is effective for optimizing the redispatching vehicle routes during precast production.
作者 马智亮 杨之恬 MA Zhiliang YANG Zhitian(Department of Civil Engineering, Tsinghua University, Beijing 100084, China)
出处 《同济大学学报(自然科学版)》 EI CAS CSCD 北大核心 2017年第10期1446-1453,共8页 Journal of Tongji University:Natural Science
基金 国家"八六三"高技术研究发展计划(2013AA041307)
关键词 遗传算法 优化 预制生产 物料重调配 路径规划 genetic algorithm optimization precast production material redispatching vehicle routing
  • 相关文献

参考文献3

二级参考文献31

  • 1王晓博,李一军.电子商务下基于改进两阶段算法的有时间窗车辆调度优化[J].中国管理科学,2007,15(6):52-59. 被引量:9
  • 2胡大伟,陈诚,郭晓汾.带集货和配送的多站点VRP优化算法研究[J].数学的实践与认识,2007,37(2):98-104. 被引量:12
  • 3Hipolito, Hernandez Perez. A branch and-cut algorithm for a traveling salesman problem with pickup and delivery[J]. Discrete Applied Mathematics, 2004, 145 (1): 126-139.
  • 4Deif L, Bodin L. Extension of the clarke and wright algorithm for solving the vehicle routing problem with backhauling[C]. Proc of the Babson Conf on Software Uses in Transportation and Logistics Management. Babson Park, 1984: 75-96.
  • 5Casco Do, Golden B L, Wasil E A. Vehicle routing with backhauls: Models algorithms and case studies [M]. Amsterdam: Elsevier Science, 1988: 127-147.
  • 6Goetschalckx M, Jacobs-Blecha C. The vehicle routing problem with backhauls[J]. European J of Operational Research, 1989, 42(1) : 39-51.
  • 7Duhamel C, Jean-Yves P, Jean-Mare R. A tabu search heuristic for the vehicle routing problem with backhauls and time windows[J]. Transportation Science, 1997, 31 (1) : 49-60.
  • 8Hasama T, Kokubugata H, Kawashima H. A heuristic approach based on the string model to solve vehicle routing problem with backhauls[C]. The 5th World Congress on Intelligent Transport Systems. Seoul: The Korea Highway Corporation, 1998: 25-32.
  • 9Potvin J Y, Duhaumel C, Guerin F. A genetic algorithm for vehicle routing with backhauling [J]. Applied Intelligence, 1996, 6(4): 345-355.
  • 10Salhi S, Nagy G. A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling[J]. J of the Operational Research Society, 1999, 50(10): 1034-1042.

共引文献71

同被引文献55

引证文献7

二级引证文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部