A hybrid distribution algorithm based on membrane computing for solving the multiobjective multiple traveling salesman problem
DOI10.3233/FI-2015-1151zbMATH Open1345.90075OpenAlexW1555003269MaRDI QIDQ2806147FDOQ2806147
Authors: Juanjuan He, Kai Zhang 
Publication date: 13 May 2016
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2015-1151
Recommendations
- A hybrid evolutionary algorithm for multiobjective traveling salesman problem
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem
membrane computingevolutionary multiobjective optimizationmultiobjective multiple traveling salesman problem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cited In (4)
- Travelling salesman problem in tissue P systems with costs
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
- Research on multi-objective simulated annealing algorithm for multi-traveling salesman problem
- An adaptive membrane algorithm for solving combinatorial optimization problems
This page was built for publication: A hybrid distribution algorithm based on membrane computing for solving the multiobjective multiple traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806147)
