Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem

2008 ◽  
pp. 309-324 ◽  
Author(s):  
Wei Peng ◽  
Qingfu Zhang ◽  
Hui Li
Keyword(s):  
Travelling Salesman Problem ◽  
Travelling Salesman ◽  
Nsga Ii ◽  
Multi Objective

scholarly journals A Compromise Decision Support Multi Objective Travelling Salesman Problem

2019 ◽  
Vol 8 (4) ◽  
pp. 10259-10262
Keyword(s):  
Dynamic Programming ◽  
Decision Support ◽  
State Space ◽  
Travelling Salesman Problem ◽  
Optimal Path ◽  
Programming Approach ◽  
Travelling Salesman ◽  
Multi Objective ◽  
Dynamic Programming Approach ◽  
Shortest Route

The multi objective travelling salesman problem simultaneously optimizes several objectives. It is also called as shortest cyclic route model with multiple objectives provides the shortest route. In this article, the compromised decision support solutions are processed for a multi objective travelling salesman problem. The dynamic programming approach for optimal path with state space tree is used to get the shortest route for the objectives. Based on decision maker's preference, the compromised solution for the multi objective travelling salesman problem is obtained. The proposed methodology is very simple and easy way to get the shortest route which is illustrated with an example.

Evolutionary algorithms for solving multi-objective travelling salesman problem

2011 ◽  
Vol 23 (2) ◽  
pp. 207-241 ◽  
Author(s):  
Vui Ann Shim ◽  
Kay Chen Tan ◽  
Jun Yong Chia ◽  
Jin Kiat Chong
Keyword(s):  
Evolutionary Algorithms ◽  
Travelling Salesman Problem ◽  
Travelling Salesman ◽  
Multi Objective
Sign in / Sign up

Export Citation Format

Share Document