A New Evolutionary Multiobjective Model for Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most classical NP-hard problems in the combinatorial optimization, as many practical problems, such as scheduling problems and vehicle-routing cost allocation problems can be abstracted. The introduction of multiobjective in the TSP is a very import...

Full description

Bibliographic Details
Main Authors: Xuejiao Chen, Yuxin Liu, Xianghua Li, Zhen Wang, Songxin Wang, Chao Gao
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8718296/

Similar Items