Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 640231, 13 pages
http://dx.doi.org/10.1155/2015/640231
Research Article

Minimization of the Total Traveling Distance and Maximum Distance by Using a Transformed-Based Encoding EDA to Solve the Multiple Traveling Salesmen Problem

Department of Information Management, Cheng Shiu University, No. 840, Chengcing Road, Niaosong District, Kaohsiung 83347, Taiwan

Received 15 May 2015; Revised 7 August 2015; Accepted 18 August 2015

Academic Editor: Jason Gu

Copyright © 2015 S. H. Chen. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to Cite this Article

S. H. Chen, “Minimization of the Total Traveling Distance and Maximum Distance by Using a Transformed-Based Encoding EDA to Solve the Multiple Traveling Salesmen Problem,” Mathematical Problems in Engineering, vol. 2015, Article ID 640231, 13 pages, 2015. https://doi.org/10.1155/2015/640231.