Multi-directional local search
From MaRDI portal
Publication:339654
DOI10.1016/J.COR.2012.03.010zbMATH Open1349.90751OpenAlexW2041384511WikidataQ42790744 ScholiaQ42790744MaRDI QIDQ339654FDOQ339654
Authors: F. Tricoire 
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.03.010
Recommendations
- scientific article; zbMATH DE number 1784661
- Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems
- A tutorial on multi-objective optimization using metaheuristics
- The directed search method for multi-objective memetic algorithms
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
Cites Work
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- Title not available (Why is that?)
- A general heuristic for vehicle routing problems
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Heuristics for the multi-period orienteering problem with multiple time windows
- GRASP: An annoted bibliography
- Stochastic local search. Foundations and applications.
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- A fast and effective heuristic for the orienteering problem
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- Record breaking optimization results using the ruin and recreate principle
- Building a set of additive value functions representing a reference preorder and intensities of preference: GRIP method
- Interactive evolutionary multiobjective optimization driven by robust ordinal regression
- Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection
- Solving efficiently the 0-1 multi-objective knapsack problem
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- On local optima in multiobjective combinatorial optimization problems
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- Title not available (Why is that?)
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
- Solving multiple criteria choice problems by interactive trichotomy segmentation
- Pareto simulated annealing for fuzzy multi-objective combinatorial optimization
- An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
Cited In (46)
- Loser-out multi metaheuristic framework for multi-objective optimization
- A tutorial on multi-objective optimization using metaheuristics
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- Title not available (Why is that?)
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Bridging game theory and the knapsack problem: a theoretical formulation
- Addendum to: ``FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges
- Title not available (Why is that?)
- Resource constrained routing and scheduling: review and research prospects
- A multi-local optimization algorithm
- Local Search for Max-Sum Diversification
- Multi agent collaborative search
- Genetic local search for multi-objective combinatorial optimization
- Linear programming-based directed local search for expensive multi-objective optimization problems: application to drinking water production plants
- Multi-objective optimisation models for the travelling salesman problem with horizontal cooperation
- Title not available (Why is that?)
- The directed multi-objective estimation distribution algorithm (D-MOEDA)
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- The multi-objective generalized consistent vehicle routing problem
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- Bi-objective orienteering for personal activity scheduling
- A multi-objective approach for intermodal train load planning
- A lexicographic minimax approach to the vehicle routing problem with route balancing
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Efficient computation of the search region in multi-objective optimization
- Enhanced directed search: a continuation method for mixed-integer multi-objective optimization problems
- Evolutionary Multi-Criterion Optimization
- A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
- Title not available (Why is that?)
- An iterated local search algorithm for a place scheduling problem
- Generalized multiobjective evolutionary algorithm guided by descent directions
- The directed search method for multi-objective memetic algorithms
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
- Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
- Advancing local search approximations for multiobjective combinatorial optimization problems
- Title not available (Why is that?)
- A lexicographic maximin approach to the selective assessment routing problem
- CHESS -- changing horizon efficient set search: a simple principle for multiobjective optimization
- A local multiobjective optimization algorithm using neighborhood field
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
- A multi-objective coordinate-exchange two-phase local search algorithm for multi-stratum experiments
- A Broyden-based algorithm for multi-objective local-search optimization
- On local optima in multiobjective combinatorial optimization problems
Uses Software
This page was built for publication: Multi-directional local search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339654)
