MOSA method: a tool for solving multiobjective combinatorial optimization problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2156685
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- An interactive heuristic method for multi-objective combinatorial optimization
- scientific article; zbMATH DE number 2159075
Cited in
(74)- Ant algorithms and simulated annealing for multicriteria dynamic programming
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Hybrid methods in multi-criteria dynamic programming
- A tool for multiobjective evolutionary algorithms
- Efficiency of interactive multi-objective simulated annealing through a case study
- A hybrid meta-heuristic for multi-objective optimization: MOSATS
- Variable and large neighborhood search to solve the multiobjective set covering problem
- Parallelization of population-based multi-objective meta-heuristics: an empirical study
- Multiobjective interacting particle algorithm for global optimization
- Pareto simulated annealing for fuzzy multi-objective combinatorial optimization
- Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs
- An introduction to multiobjective simulation optimization
- On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
- Asymptotic convergence of a simulated annealing algorithm for multiobjective optimization problems
- Maxima units search (MUS) algorithm: methodology and applications
- Scheduling technicians and tasks through an adaptive multi-objective biased random-key genetic algorithm
- Genetic local search for multi-objective combinatorial optimization
- Negotiation mechanisms for the multi-agent multi-mode resource investment problem
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Speed-up techniques for solving large-scale biobjective TSP
- Finding all nondominated points of multi-objective integer programs
- An interactive heuristic method for multi-objective combinatorial optimization
- Multi-criteria location planning for public facilities in tsunami-prone coastal areas
- Solving multi-objective production scheduling problems using metaheuristics
- A population-based algorithm for solving linear assignment problems with two objectives
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Solving a Multiobjective Truck and Trailer Routing Problem with Fuzzy Constraints
- Multi-directional local search
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- A multiobjective metaheuristic for a mean-risk multistage capacity investment problem
- Labeling algorithms for multiple objective integer knapsack problems
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
- Bi-objective resource-constrained project scheduling with robustness and makespan criteria
- Multi-objective optimization using metaheuristics: non-standard algorithms
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- A biobjective and trilevel programming model for hub location problem in design of a resilient power projection network
- Evaluation of an MSO-Solver
- A bicriteria knapsack program for planning remediation of contaminated lightstation sites
- Robust university course timetabling problem subject to single and multiple disruptions
- MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization
- A multi-objective production scheduling case study solved by simulated annealing
- On operators and search space topology in multi-objective flow shop scheduling
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
- FEMOEA: a fast and efficient multi-objective evolutionary algorithm
- Proper balance between search towards and along Pareto front: biobjective TSP case study
- A tool to convert continuous multiobjective optimisation test problems into combinatorial ones
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- Multiobjective combinatorial optimization: some approaches
- Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
- Pareto uncertainty index for evaluating and comparing solutions for stochastic multiple objective problems
- An exact approach for the minimum-cost bounded-error calibration tree problem
- Multiobjective optimization for complex flexible job-shop scheduling problems
- A genetic-based framework for solving (multi-criteria) weighted matching problems.
- Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics
- Parallel implementation of an exact two-phase method for the biobjective knapsack problem
- A hybrid method for solving the multi-objective assignment problem
- K-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- scientific article; zbMATH DE number 2156685 (Why is no real title available?)
- Norm-based approximation in multicriteria programming.
- Multi-objective retrospective optimization using stochastic zigzag search
- Multi-objective vehicle routing problems
- Risk-pooling strategy, lead time, delivery reliability and inventory control decisions in a stochastic multi-objective supply chain network design
- Multiobjective vehicle routing problem with fixed delivery and optional collections
- GISMOO: A new hybrid genetic/immune strategy for multiple-objective optimization
- A survey of multidisciplinary design optimization methods in launch vehicle design
- Planning efficient 4D trajectories in air traffic flow management.
- Service allocation equity in location coverage analytics
- New core-guided and hitting set algorithms for multi-objective combinatorial optimization
- A bi-objective approach to reschedule new jobs in a one machine model
- A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times
- A new multiobjective simulated annealing algorithm
- Performance of the MOSA method for the bicriteria assignment problem
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- The influence of the fitness evaluation method on the performance of multiobjective search algorithms
This page was built for publication: MOSA method: a tool for solving multiobjective combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934175)
