A study with neighborhood searches to deal with multiobjective unconstrained permutation problems

DOI10.3934/JIMO.2009.5.193MaRDI QIDQ2379758zbMATH OpenOpenAlexFDO

Authors Ricardo P. Beausoleil, Rodolfo A. Montejo

Publication date 22 March 2010

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2009.5.193

zbMATH Keywords

filter-and-fanlocal searchmultiple objectivespath relinkingpermutation problems

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29)

Recommendations

• On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
• On operators and search space topology in multi-objective flow shop scheduling
• An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem
• A comparison of neighborhood search techniques for multi-objective combinatorial problems
• On the performance of local search for the biobjective traveling salesman problem

This page was built for publication: A study with neighborhood searches to deal with multiobjective unconstrained permutation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379758)