Genetic local search for multi-objective combinatorial optimization
From MaRDI portal
Publication:5956204
DOI10.1016/S0377-2217(01)00104-7zbMath1002.90051WikidataQ126636126 ScholiaQ126636126MaRDI QIDQ5956204
Publication date: 20 January 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study, Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems, Advancing local search approximations for multiobjective combinatorial optimization problems, Guided moth-flame optimiser for multi-objective optimization problems, A genetic algorithm approach to multiobjective land use planning, Binary Optimal Control of Single-Flux-Quantum Pulse Sequences, An optimization approach for ambulance location and the districting of the response segments on highways, Hybrid assembly line design and user's preferences, Preference-inspired co-evolutionary algorithms using weight vectors, MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem, A multilevel approach to single- and multiobjective aerodynamic optimization, Efficient meta-heuristics for the multi-objective time-dependent orienteering problem, Design of a heuristic algorithm for the generalized multi-objective set covering problem, Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem, Towards faster convergence of evolutionary multi-criterion optimization algorithms using Karush Kuhn Tucker optimality based local search, Many-objective Pareto local search, A multi-objective particle swarm for a flow shop scheduling problem, A hybrid approach for biobjective optimization, A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP, Parameter-less co-clustering for star-structured heterogeneous data, A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems, Local dominance and local recombination in MOEAs on \(0/1\) multiobjective knapsack problems, Multiobjective vehicle routing problem with fixed delivery and optional collections, Pareto uncertainty index for evaluating and comparing solutions for stochastic multiple objective problems, MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem, Application of a genetic algorithm to the fuel reload optimization for a research reactor, A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem, “MOSS-II” Tabu/Scatter Search for Nonlinear Multiobjective Optimization, A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times, Genetic local search with distance preserving recombination operator for a vehicle routing problem., Hierarchical co-clustering: off-line and incremental approaches, A multi-objective production smoothing model with compressible operating times, A hybrid multiobjective genetic algorithm for robust resource-constrained project scheduling with stochastic durations, Fuzzy rule selection by multi-objective genetic local search algorithms and rule evaluation measures in data mining., A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness, Multi-start and path relinking methods to deal with multiobjective Knapsack problems, A hypercube queueing model embedded into a genetic algorithm for ambulance deployment on highways, An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers, An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization, On Gradient-Based Local Search to Hybridize Multi-objective Evolutionary Algorithms, Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem, A multi-objective scatter search for a dynamic cell formation problem, On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems, Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem, Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm, City-courier routing and scheduling problems, Multi‐objective optimization using metaheuristics: non‐standard algorithms, Multi-objective vehicle routing problems, GISMOO: A new hybrid genetic/immune strategy for multiple-objective optimization, Multiobjective service restoration in electric distribution networks using a local search based heuristic, Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm, Two-phase Pareto local search for the biobjective traveling salesman problem, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, An effective hybrid genetic algorithm for flow shop scheduling with limited buffers, Unnamed Item, Solving the musical orchestration problem using multiobjective constrained optimization with a genetic local search approach, A genetic algorithm for a bi-objective capacitated arc routing problem, A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows, Hybrid population-based algorithms for the bi-objective quadratic assignment problem, Local models-an approach to distributed multi-objective optimization, MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization, Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems, Design and analysis of stochastic local search for the multiobjective traveling salesman problem, Implementation of Multiobjective Memetic Algorithms for Combinatorial Optimization Problems: A Knapsack Problem Case Study, Multiobjective Metamodel–Assisted Memetic Algorithms, A Memetic Coevolutionary Multi-Objective Differential Evolution Algorithm, Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems, Genetic local search for multi-objective flowshop scheduling problems, A multi-objective approach for robust airline scheduling, A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems, ``MOSS multiobjective scatter search applied to nonlinear multiple criteria optimization, The influence of the fitness evaluation method on the performance of multiobjective search algorithms, A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices, The multiobjective multidimensional knapsack problem: a survey and a new approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Industrial applications of combinatorial optimization
- Quad trees: A data structure for retrieval by composite keys
- Hybrid evolutionary algorithms for graph coloring
- Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP
- TSPLIB—A Traveling Salesman Problem Library
- Comparison of iterative searches for the quadratic assignment problem
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Multi‐objective combinatorial optimization problems: A survey
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
