Multi-objective variable neighborhood search: an application to combinatorial optimization problems
From MaRDI portal
Publication:887201
DOI10.1007/s10898-014-0213-zzbMath1334.90142OpenAlexW2054195159WikidataQ57856044 ScholiaQ57856044MaRDI QIDQ887201
Nenad Mladenović, Eduardo G. Pardo, Abraham Duarte, Juan José 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
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Portfolio decision analysis with a generalized balance approach ⋮ Variable neighborhood search strategies for the order batching 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 ⋮ Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem ⋮ Lexicographic goal programming approach for a short-term mining planning problem ⋮ In memory of Professor Nenad Mladenović (1951--2022) ⋮ A two-phase multi-objective metaheuristic for a green UAV grid routing problem ⋮ Multi-objective home health care routing: a variable neighborhood search method ⋮ An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem ⋮ Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time ⋮ General variable neighborhood search for the order batching and sequencing problem ⋮ Multi-objective vehicle routing and loading with time window constraints: a real-life application ⋮ A multiobjective hub-airport location problem for an airline network design ⋮ Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration ⋮ GRASP with variable neighborhood descent for the online order batching problem ⋮ Variable neighbourhood search for financial derivative problem ⋮ On solving the order processing in picking workstations ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Variable neighborhood search for the vertex separation problem
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Variable neighbourhood search: methods and applications
- Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm
- Variable neighbourhood search: Methods and applications
- GRASP and path relinking for the max-min diversity problem
- Variable neighborhood search
- Metaheuristics for multiobjective optimisation
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- Scatter search for the cutwidth minimization problem
- Variable neighbourhood search for bandwidth reduction
- Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- GRASP with path relinking heuristics for the antibandwidth problem
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
