A study with neighborhood searches to deal with multiobjectiveunconstrained permutation problems
Ricardo P. Beausoleil, Rodolfo A. Montejo · Journal of Industrial and Management Optimization · 2009
This paper introduces a study with neighborhood search algorithms todeal with unconstrained multiobjective permutation problems.Filter-and-fan/path relinking approach designed by us, and thestochastic local search (SLS) developed by Paquete and Stutzle[22], implemented by us, are compared using as study casesthe bi-objective quadratic assignment problem, and the bi-objectivetravelling salesman problem. Our approach is also compared withresults published for bi-objective quadratic assignment problem,bi-objective flow shop problem, bi-objective and tri-objectivetravelling salesman problems. The results obtained show that thefilter-and-fan/path relinking approach seems to be promising totackle multiobjective permutation problems, achieving good and widedistributed approximations to the Pareto-optimal front.