Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP
From MaRDI portal
Publication:2567892
Recommendations
- The multiobjective traveling salesman problem: A survey and a new approach
- Augmented Lagrangian and Tchebycheff approaches in multiple objective programming
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- CHESS -- changing horizon efficient set search: a simple principle for multiobjective optimization
- On scalarizing functions in multiobjective optimization
Cited in
(9)- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- A hybrid approach for biobjective optimization
- Multi-objective vehicle routing problems
- Multi-objectives tabu search based algorithm for progressive resource allocation
- Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm
- An interactive approach for biobjective integer programs under quasiconvex preference functions
- Design of a heuristic algorithm for the generalized multi-objective set covering problem
- Genetic local search for multi-objective combinatorial optimization
This page was built for publication: Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567892)