%0 Journal Article
%T A hybrid genetic algorithm for the traveling salesman problem with pickup and delivery<br>
%A Fang-Geng Zhao
%A Jiang-Sheng Sun
%A Su-Jian Li
%A Wei-Min Liu
%A <br>
%J 国际自动化与计算杂志
%D 2009
%I 
%X In this paper,a hybrid genetic algorithm (CA) is proposed for the traveling salesman problem (TSP) with pickup and delivery (TSPPD).In our algorithm,a novel pheromone-based crossover operator is advanced that utilizes both local and global information to construct offspring.In addition,a local search procedure is integrated into the GA to accelerate convergence.The proposed GA has been tested on benchmark instances,and the computational results show that it gives better convergence than existing heuristics.
%K Genetic algorithm (GA)
%K pheromone-based crossover
%K local search
%K pickup and delivery
%K traveling salesman problem (TSP)<br>
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7139AD613512F4F05F6D525B914296AA&aid=B16421404B72E8F8C64BE494413A3CE2&yid=DE12191FBD62783C&vid=B31275AF3241DB2D&iid=CA4FD0336C81A37A&sid=C3BF5C58156BEDF0&eid=331211A5F5616413&journal_id=1476-8186&journal_name=国际自动化与计算杂志&referenced_num=0&reference_num=24