Abstract
The multi-objective traveling salesman problem (MOTSP) involves one salesman to visit a set of locations (n > 1) so that each location is visited exactly once while satisfying multiple targets of distance, time, cost, etc. To solve problem like this, two different algorithms are introduced and their optimization performances are presented in details by comparisons. On one hand, the genetic algorithm (GA) implemented on Matlab was improved in this paper, which performs well in combination with rotating-disk selection with ranking, one-point crossover and mutation after similarity contrast. On the other hand, the optimization also benefits from application of 0-1 integer programming algorithm with linear and non-linear constraints where Lingo is used. Experimental results reveal both advantages and disadvantages of these two algorithms, and it is concludes that characteristics of the problem itself will decide which algorithm is more suitable when it comes to a special case.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
