A decomposition based estimation of distribution algorithm for multiobjective traveling salesman problems

DOI10.1016/j.camwa.2013.05.031zbMath1376.90056OpenAlexW2045077061MaRDI QIDQ316285

Mohammad Hasan, M. Dambrine

Publication date: 27 September 2016

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2013.05.031

zbMATH Keywords

multiobjective optimizationtraveling salesman problemMOEA/D

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (1)

Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem

Uses Software

• TSPLIB
• PAES
• MOEA/D
• RM-MEDA
• HypE

Cites Work

• Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection
• Nonlinear multiobjective optimization
• Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
• Multiobjective evolutionary algorithms and applications.
• Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem
• TSPLIB—A Traveling Salesman Problem Library
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A decomposition based estimation of distribution algorithm for multiobjective traveling salesman problems