计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (2): 246-248.DOI: 10.3778/j.issn.1002-8331.2009.02.071

• 工程与应用 • 上一篇    

一类特殊的集送一体化TSP问题及其遗传算法求解

赵方庚1,2,李苏剑1,刘伟民1,孙江生1   

  1. 1.北京科技大学 物流工程系,北京 100083
    2.汽车管理学院,安徽 蚌埠 233011
  • 收稿日期:2007-12-29 修回日期:2008-03-28 出版日期:2009-01-11 发布日期:2009-01-11
  • 通讯作者: 赵方庚

Genetic algorithm for a special pickup and delivery traveling salesman problem

ZHAO Fang-geng1,2,LI Su-jian1,LIU Wei-min1,SUN Jiang-sheng1   

  1. 1.Department of Logistics Engineering,University of Science and Technology Beijing,Beijing 100083,China
    2.Vehicle Management Institute,Bengbu,Anhui 233011,China
  • Received:2007-12-29 Revised:2008-03-28 Online:2009-01-11 Published:2009-01-11
  • Contact: ZHAO Fang-geng

摘要: 同类商品集送一体化的旅行商问题是经典TSP问题的一种新变体,建立了该问题的数学模型,根据该问题的特征,结合局域搜索优化算法,改进了遗传算法的交叉、变异算子。对算例的求解证明了遗传算法在解决1-PDTSP问题上优越性。

关键词: 旅行商问题, 集送一体化, 数学模型, 遗传算法

Abstract: The mathematical model of one-commodity Pickup and Delivery Traveling Salesman Problem(1-PDTSP),which is a new variant of the classical TSP,is established.According to the characteristic of this problem,and combining the local search optimize algorithm,the crossover and mutation operations of genetic algorithm are improved.The computational results of instances prove the superiority of the improved genetic algorithm in solving 1-PDTSP.

Key words: Traveling Salesman Problem(TSP), pickup and delivery, mathematical model, genetic algorithm