计算机应用

• 人工智能 • 上一篇    下一篇

定位—路线问题的遗传禁忌混合优化算法

蒋泰 杨海珺   

  1. 广西桂林市金鸡路1号桂林电子科技大学
  • 收稿日期:2007-09-21 修回日期:1900-01-01 发布日期:2008-03-01 出版日期:2008-03-01
  • 通讯作者: 杨海珺

Genetic/Tabu hybrid optimization algorithm for location-routing problems

<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=(((Hai-Jun Yang[Author]) AND 1[Journal]) AND year[Order])" target="_blank">Hai-Jun Yang</a>   

  • Received:2007-09-21 Revised:1900-01-01 Online:2008-03-01 Published:2008-03-01
  • Contact: Hai-Jun Yang

摘要: 研究了带软时间窗的定位—路线问题的遗传禁忌混合优化算法,该算法同时兼顾了定位—路线问题中的定位—配给和车辆路线安排两个子问题。给出的遗传算法与禁忌搜索算法的混合策略、遗传编码和相应的遗传操作方式,有效地提高了算法的求解效率和求解质量。最后,通过实验证明了算法的可行性和有效性。

关键词: 物流配送, 定位-路线问题, 遗传算法, 混合优化, 禁忌搜索算法

Abstract: A Genetic/Tabu hybrid optimization algorithm for Location-Routing Problems (LRP) with the soft time windows was researched, which can tackle both location-allocation problem and vehicle-routing problem. Hybrid strategy for Genetic Algorithm (GA)and Tabu Search algorithm (TS), genetic coding and corresponding genetic operations were used in this proposed algorithm, so that the quality of the solution and the efficiency of the algorithm have been improved at the same time. And the results show the proposed algorithm is feasible and efficient.

Key words: logistics distribution, Genetic Algorithm (GA), hybrid optimization, Tabu Search algorithm (TS), Location-Routing Problem (LRP)