Multi-directional local search (Q339654)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Multi-directional local search	scientific article

Statements

scholarly article

0 references

Multi-directional local search (English)

0 references

Fabien Tricoire

0 references

Computers \& Operations Research

0 references

publication date

11 November 2016

0 references

zbMATH Keywords

multi-objective optimization

0 references

metaheuristics

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2012.03.010

0 references

MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem

0 references

An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search

0 references

Solving efficiently the 0-1 multi-objective knapsack problem

0 references

An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits

0 references

Interactive evolutionary multiobjective optimization driven by robust ordinal regression

0 references

A fast and effective heuristic for the orienteering problem

0 references

0 references

Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization

0 references

Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem

0 references

Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection

0 references

0 references

Building a set of additive value functions representing a reference preorder and intensities of preference: GRIP method

0 references

Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms

0 references

A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria

0 references

Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case

0 references

0 references

Pareto simulated annealing for fuzzy multi-objective combinatorial optimization

0 references

0 references

Solving multiple criteria choice problems by interactive trichotomy segmentation

0 references

0 references

An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method

0 references

A branch and bound algorithm for mixed zero-one multiple objective linear programming

0 references

0 references

0 references

On local optima in multiobjective combinatorial optimization problems

0 references

A heuristic two-phase solution approach for the multi-objective dial-a-ride problem

0 references

A general heuristic for vehicle routing problems

0 references

0 references

Record breaking optimization results using the ruin and recreate principle

0 references

Heuristics for the multi-period orienteering problem with multiple time windows

0 references

MOSA method: a tool for solving multiobjective combinatorial optimization problems

0 references

A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.cor.2012.03.010

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:339654

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q339654&oldid=36287595"