期刊文献+

客户订单合成配送问题建模与遗传算法研究 被引量:1

Mathematical Model and Genetic Algorithm of Customer Order Consolidation Delivery Problem
下载PDF
导出
摘要 为了降低成本,取得企业竞争优势,合理进行配送成为实现物流规模经济、降低物流成本的重要手段。在一些模型假设的基础上,建立了目标函数为最小化运距的客户订单合成配送问题的数学模型,提出并实现了解决该问题的遗传算法。大量仿真结果表明:该算法能够在较短的时间内有效求得问题的近优解,该算法的运行时间主要取决于订单数和交货组数,为实现物流配送提供了一个基本方法。 Modern flow material is the important source for corporation to reduce cost and obtain competitive advantage. A mathematical model of customer order consolidation delivery problem is introduced based on some model hypothesis,in which the objective is to minimize the transportation distance. A genetic algorithm is proposed to solve this problem. Experimental results show that this algorithm can obtain effectively nearly optimization solution to customer order consolidation delivery problem in short time. The running time is decided by order quantity and delivery groups, and it provides a basic method for realizing the automation of material flow delivery.
出处 《控制工程》 CSCD 2005年第3期281-284,共4页 Control Engineering of China
基金 国家自然科学基金资助项目(60274027)
  • 相关文献

参考文献6

二级参考文献19

  • 1McMahon G B, Lim C J. The two-meachine flow shop problem with arbitrary precedence relations[J].European Journal of Operational Research, 1993, 64(2) :249-257.
  • 2Lim C J, McMabon G B. The three-machine flow shop problem with arbitrary precedence relations[J].European Journal of Operational Research, 1994, 78(1) :216-223.
  • 3Taillard E. Some efficient heuristic methods for the flow shop sequencing problem [ J ]. European Journal of Operational Research, 1990, (47) :65-74.
  • 4Reeves C R. A genetic algorithm for flow shop se-quencing [ J ]. Computers & Operations Reseavch,1995, (22) :5-13.
  • 5Nawaz M, Emscore Jr E E, Ham I. A heuristic algorithm for the-job ,machine flow shop problem[J].OMEGA, 1983, 11(3) :91-98.
  • 6John S M. Optimal two-and three-stage production schedules with setup times[J]. Naval Research Logistics Quarterly, 1954, (1) :61-68.
  • 7Taillard E. Benchmark for basic scheduling problems[J ]. European Journal of Operationa Research,1993, (64) :278-285.
  • 8Davis L. Job shop scheduling with genetic algorithms[A]. Grefenstette J.J. Proe Int. Conf. Genetic Algorithms and Their Applications [ C ]. USA: Lawrence Erlbaum, 1985.
  • 9Whitley D, Starkweather T, Fuquary D. Scheduling problems and traveling salesman: the genetic edge recombination Operator [ A ]. Schaffer J. D. Proc 3rdInt. Conf. Genetic Algorithms[ C]. USA: Morgan Kauffmann, 1989.
  • 10Ragiuva M, Zbaraki T. The use of dynamic programming in genetic algorithms for permutation problems[J ]. European Journal of Operation Reasearch,1996, (92) :387-401.

共引文献15

同被引文献8

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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