Probabilistic based evolutionary optimizers in bi-objective travelling salesman problem

Authors:
Vui Ann Shim;Kay Chen Tan;Jun Yong Chia
Affiliations:
Department of Electrical and Computer Engineering, National University of Singapore, Singapore;Department of Electrical and Computer Engineering, National University of Singapore, Singapore;Department of Electrical and Computer Engineering, National University of Singapore, Singapore
Venue:
SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Year:
2010

Citing 5
Cited 0

Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation

Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Evolutionary algorithms and multi-objectivization for the travelling salesman problem

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
An evolutionary algorithm for dynamic multi-objective TSP

ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.