pdf

Implementation of MTSP Problem Based on GA

  • 2013-09-19
  • 131.85KB
  • Points it Requires : 1

The Multiple Traveling Salesperson Problem (MTSP) is about how m traveling salesmen visit n cities, requiring each city to be visited only once, and finding the minimum path for all traveling salesmen. This paper analyzes the characteristics of MTSP and selects the encoding and genetic operators reasonably based on the basic idea of ​​genetic algorithm. The simulation shows that the optimization method can obtain a better solution.

unfold

You Might Like

Uploader
PKelect
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×