Multi-start and path relinking methods to deal with multiobjective Knapsack problems

DOI10.1007/s10479-007-0199-8zbMath1163.90019OpenAlexW2059207180MaRDI QIDQ940855

Ricardo P. Beausoleil, Gulnara Baldoquin, Rodolfo A. Montejo

Publication date: 3 September 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0199-8

zbMATH Keywords

path relinkingKnapsack problemsmulti-start methodsmultiple objective metaheuristics

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (4)

Multi- and many-objective path-relinking: a taxonomy and decomposition approach ⋮ Multi‐objective optimization using metaheuristics: non‐standard algorithms ⋮ What foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods? ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach

Uses Software

• SPEA2
• Tabu search

Cites Work

• Unnamed Item
• Optimization by ghost image processes in neural networks
• Performance of the MOSA method for the bicriteria assignment problem
• ``MOSS multiobjective scatter search applied to nonlinear multiple criteria optimization
• Genetic local search for multi-objective combinatorial optimization

This page was built for publication: Multi-start and path relinking methods to deal with multiobjective Knapsack problems