Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems

DOI10.1007/s00500-011-0759-3zbMath1255.90105OpenAlexW2002489537MaRDI QIDQ1933783

Jixang Cheng, Gexiang Zhang, Yuquan Li, Zhidan Li

Publication date: 25 January 2013

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-011-0759-3

zbMATH Keywords

decompositionant colony optimizationmulti-objectivebi-objective traveling salesman problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem ⋮ A decomposition-based many-objective ant colony optimization algorithm with adaptive reference points

Uses Software

• MACS-VRPTW
• MOEA/D
• SPEA2

Cites Work

• Unnamed Item
• Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
• A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
• Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
• Nonlinear multiobjective optimization
• An improved ant system algorithm for the vehicle routing problem
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
• Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem

This page was built for publication: Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems