Multi-objective variable neighborhood search: an application to combinatorial optimization problems
From MaRDI portal
Publication:887201
DOI10.1007/S10898-014-0213-ZzbMATH Open1334.90142OpenAlexW2054195159WikidataQ57856044 ScholiaQ57856044MaRDI QIDQ887201FDOQ887201
Authors: Abraham Duarte, Eduardo G. Pardo, Nenad Mladenović, Juan J. Pantrigo 
Publication date: 28 October 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0213-z
Recommendations
- Variable Neighborhood Search
- A generalized variable neighborhood search for combinatorial optimization problems
- Variable neighborhood search: Principles and applications
- Enhanced meta-heuristics with variable neighborhood search strategy for combinatorial optimization problems
- Multi-directional local search
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search
- Title not available (Why is that?)
- Variable neighbourhood search: methods and applications
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- Title not available (Why is that?)
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- GRASP and path relinking for the max-min diversity problem
- Variable neighbourhood search for bandwidth reduction
- GRASP with path relinking heuristics for the antibandwidth problem
- Scatter search for the cutwidth minimization problem
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- Variable neighborhood search for the vertex separation problem
- Metaheuristics for multiobjective optimisation
- Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm
Cited In (28)
- A generalized variable neighborhood search for combinatorial optimization problems
- General variable neighborhood search for the optimization of software quality
- Multi-objective vehicle routing and loading with time window constraints: a real-life application
- Lexicographic goal programming approach for a short-term mining planning problem
- Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration
- In memory of Professor Nenad Mladenović (1951--2022)
- Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time
- Multi-directional local search
- Portfolio decision analysis with a generalized balance approach
- A two-phase multi-objective metaheuristic for a green UAV grid routing problem
- Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
- General variable neighborhood search for the order batching and sequencing problem
- An adaptive variable neighborhood search for solving the multi-objective node placement problem
- Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm
- Multi-objective home health care routing: a variable neighborhood search method
- GRASP with variable neighborhood descent for the online order batching problem
- On solving the order processing in picking workstations
- Title not available (Why is that?)
- A multiobjective hub-airport location problem for an airline network design
- Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem
- A method for selecting Pareto optimal solutions in multiobjective optimization
- Variable neighbourhood search for financial derivative problem
- An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem
- A hybrid variable neighborhood search algorithm for targeted offers in direct marketing
- A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
- A covering traveling salesman problem with profit in the last mile delivery
- Variable neighborhood search strategies for the order batching problem
Uses Software
This page was built for publication: Multi-objective variable neighborhood search: an application to combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q887201)
