Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
From MaRDI portal
Publication:4395807
DOI<34::AID-MCDA161>3.0.CO;2-6 10.1002/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6zbMath0904.90146OpenAlexW2085830763MaRDI QIDQ4395807
Andrzej Jaszkiewicz, Piotr Czyżak
Publication date: 12 August 1998
Full work available at URL: https://doi.org/10.1002/(sici)1099-1360(199801)7:1<34::aid-mcda161>3.0.co;2-6
Related Items (97)
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection ⋮ Variable and large neighborhood search to solve the multiobjective set covering problem ⋮ An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling ⋮ Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ Trade-off balancing in scheduling for flow shop production and perioperative processes ⋮ Portfolio decision analysis with a generalized balance approach ⋮ The multi-objective generalized consistent vehicle routing problem ⋮ Carbon-efficient scheduling of flow shops by multi-objective optimization ⋮ Hybrid methods in multi-criteria dynamic programming ⋮ Optimizing of bullwhip effect and net stock amplification in three-echelon supply chains using evolutionary multi-objective metaheuristics ⋮ Design of a heuristic algorithm for the generalized multi-objective set covering problem ⋮ A hybrid meta-heuristic for multi-objective optimization: MOSATS ⋮ Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems ⋮ An exact solution approach for multi-objective location-transportation problem for disaster response ⋮ Multimode time-cost-robustness trade-off project scheduling problem under uncertainty ⋮ Multi-directional local search ⋮ Multi-objective optimization of mobile phone keymaps for typing messages using a word list ⋮ Proper balance between search towards and along Pareto front: biobjective TSP case study ⋮ Using genetic algorithm to improve consistency and retain authenticity in the analytic hierarchy process ⋮ A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems ⋮ A triobjective model for locating a public semiobnoxious facility in the plane ⋮ On operators and search space topology in multi-objective flow shop scheduling ⋮ On the quality of discrete representations in multiple objective programming ⋮ Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem ⋮ Multiobjective Interacting Particle Algorithm for Global Optimization ⋮ A new trisection method for solving Lipschitz bi-objective optimization problems ⋮ Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems ⋮ An exact approach for the minimum-cost bounded-error calibration tree problem ⋮ A local multiobjective optimization algorithm using neighborhood field ⋮ A hybrid multi-objective approach for real-time flexible production scheduling and rescheduling under dynamic environment in Industry 4.0 context ⋮ MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem ⋮ A fitness assignment strategy based on the grey and entropy parallel analysis and its application to MOEA ⋮ Approximating the Pareto optimal set using a reduced set of objective functions ⋮ Multi-objective variable neighborhood search: an application to combinatorial optimization problems ⋮ A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time ⋮ A bilevel flight collaborative scheduling model with traffic scenario adaptation: an arrival prior perspective ⋮ Controller placement problem in software‐defined networking: A survey ⋮ Efficient multi-objective tabu search for emergency equipment maintenance scheduling in disaster rescue ⋮ An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain ⋮ An Extension of the MOON2/MOON2R Approach to Many-Objective Optimization Problems ⋮ A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times ⋮ Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data ⋮ Norm-based approximation in multicriteria programming. ⋮ Meta-optimization of multi-objective population-based algorithms using multi-objective performance metrics ⋮ Pareto simulated annealing for the design of experiments: illustrated by a gene expression study ⋮ Design of experiments: useful orthogonal arrays for number of experiments from 4 to 16 ⋮ A hybrid method for solving the multi-objective assignment problem ⋮ Using metaheuristics in multiobjective resource constrained project scheduling ⋮ Tour recommendation for groups ⋮ Pareto memetic algorithm for multiple objective optimization with an industrial application ⋮ A new multiobjective simulated annealing algorithm ⋮ Multiobjective optimization for complex flexible job-shop scheduling problems ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem ⋮ An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization ⋮ A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems ⋮ Ant algorithms and simulated annealing for multicriteria dynamic programming ⋮ FEMOEA: a fast and efficient multi-objective evolutionary algorithm ⋮ Obtaining transparent models of chaotic systems with multi-objective simulated annealing algorithms ⋮ Multi‐objective optimization using metaheuristics: non‐standard algorithms ⋮ Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations ⋮ Two-phase Pareto local search for the biobjective traveling salesman problem ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ A multiobjective metaheuristic for a mean-risk multistage capacity investment problem ⋮ Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems ⋮ Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations ⋮ Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models ⋮ A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem ⋮ Parallelization of population-based multi-objective meta-heuristics: an empirical study ⋮ A local genetic approach to multi-objective, facility layout problems with fixed aisles ⋮ A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria ⋮ Genetic local search for multi-objective combinatorial optimization ⋮ Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years ⋮ Performance indicators in multiobjective optimization ⋮ Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system ⋮ Robust university course timetabling problem subject to single and multiple disruptions ⋮ Objective reduction for many-objective optimization problems using objective subspace extraction ⋮ MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem ⋮ A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems ⋮ Solving multiple criteria choice problems by interactive trichotomy segmentation ⋮ An interactive heuristic method for multi-objective combinatorial optimization ⋮ Speed-up techniques for solving large-scale biobjective TSP ⋮ Labeling algorithms for multiple objective integer knapsack problems ⋮ Scheduling interfering job sets on parallel machines ⋮ A multiobjective evolutionary algorithm for scheduling and inspection planning in software development projects ⋮ Genetic local search for multi-objective flowshop scheduling problems ⋮ A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems ⋮ The influence of the fitness evaluation method on the performance of multiobjective search algorithms ⋮ Multi-objective tabu search using a multinomial probability mass function ⋮ MOAQ and ant-Q algorithm for multiple objective optimization problems ⋮ A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach ⋮ Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities ⋮ Performance evaluation of acceptance probability functions for multi-objective SA ⋮ Mathematical analysis and solutions for multi-objective line-cell conversion problem
This page was built for publication: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
