Probabilistic based evolutionary optimizers in bi-objective travelling salesman problem

7Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper studies the probabilistic based evolutionary algorithms in dealing with bi-objective travelling salesman problem. Multi-objective restricted Boltzmann machine and univariate marginal distribution algorithm in binary representation are modified into permutation based representation. Each city is represented by an integer number and the probability distributions of the cities are constructed by running the modeling approach. A refinement operator and a local exploitation operator are proposed in this work. The probabilistic based evolutionary optimizers are subsequently combined with genetic based evolutionary optimizer to complement the limitations of both algorithms. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Shim, V. A., Tan, K. C., & Chia, J. Y. (2010). Probabilistic based evolutionary optimizers in bi-objective travelling salesman problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6457 LNCS, pp. 588–592). https://doi.org/10.1007/978-3-642-17298-4_66

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free