MOSA method: a tool for solving multiobjective combinatorial optimization problems
From MaRDI portal
Publication:4934175
DOI<221::AID-MCDA247>3.0.CO;2-O 10.1002/(SICI)1099-1360(199907)8:4<221::AID-MCDA247>3.0.CO;2-OzbMath0935.90034OpenAlexW2003412293MaRDI QIDQ4934175
Philippe Fortemps, Daniel Tuyttens, E. L. Ulungu, Jacques jun. Teghem
Publication date: 20 February 2000
Full work available at URL: https://doi.org/10.1002/(sici)1099-1360(199907)8:4<221::aid-mcda247>3.0.co;2-o
simulated annealingknapsackcombinatorialmultiobjective combinatorial optimizationmultiobjectivemultiobjective simulated annealing
Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50) Combinatorial optimization (90C27)
Related Items (60)
Variable and large neighborhood search to solve the multiobjective set covering problem ⋮ A tool for multiobjective evolutionary algorithms ⋮ Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates ⋮ Solving multi-objective production scheduling problems using metaheuristics ⋮ Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling ⋮ Hybrid methods in multi-criteria dynamic programming ⋮ Bi-objective resource-constrained project scheduling with robustness and makespan criteria ⋮ A hybrid meta-heuristic for multi-objective optimization: MOSATS ⋮ Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems ⋮ Asymptotic convergence of a simulated annealing algorithm for multiobjective optimization problems ⋮ A population-based algorithm for solving linear assignment problems with two objectives ⋮ Multi-directional local search ⋮ A multi-objective production scheduling case study solved by simulated annealing ⋮ Proper balance between search towards and along Pareto front: biobjective TSP case study ⋮ On operators and search space topology in multi-objective flow shop scheduling ⋮ Multiobjective vehicle routing problem with fixed delivery and optional collections ⋮ Finding all nondominated points of multi-objective integer programs ⋮ Multiobjective Interacting Particle Algorithm for Global Optimization ⋮ 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 ⋮ A survey of multidisciplinary design optimization methods in launch vehicle design ⋮ MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem ⋮ A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times ⋮ Solving bicriteria 0--1 knapsack problems using a labeling algorithm. ⋮ Norm-based approximation in multicriteria programming. ⋮ A hybrid method for solving the multi-objective assignment problem ⋮ Planning efficient 4D trajectories in air traffic flow management. ⋮ A new multiobjective simulated annealing algorithm ⋮ Negotiation mechanisms for the multi-agent multi-mode resource investment problem ⋮ Multiobjective optimization for complex flexible job-shop scheduling problems ⋮ Risk-pooling strategy, lead time, delivery reliability and inventory control decisions in a stochastic multi-objective supply chain network design ⋮ Ant algorithms and simulated annealing for multicriteria dynamic programming ⋮ On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems ⋮ FEMOEA: a fast and efficient multi-objective evolutionary algorithm ⋮ Multi‐objective optimization using metaheuristics: non‐standard algorithms ⋮ Multi-objective vehicle routing problems ⋮ GISMOO: A new hybrid genetic/immune strategy for multiple-objective optimization ⋮ 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 ⋮ Parallelization of population-based multi-objective meta-heuristics: an empirical study ⋮ Genetic local search for multi-objective combinatorial optimization ⋮ A biobjective and trilevel programming model for hub location problem in design of a resilient power projection network ⋮ Robust university course timetabling problem subject to single and multiple disruptions ⋮ MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization ⋮ Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics ⋮ A genetic-based framework for solving (multi-criteria) weighted matching problems. ⋮ Multi-criteria location planning for public facilities in tsunami-prone coastal areas ⋮ An interactive heuristic method for multi-objective combinatorial optimization ⋮ Speed-up techniques for solving large-scale biobjective TSP ⋮ Solving a Multiobjective Truck and Trailer Routing Problem with Fuzzy Constraints ⋮ Labeling algorithms for multiple objective integer knapsack problems ⋮ Service allocation equity in location coverage analytics ⋮ Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs ⋮ A bi‐objective approach to reschedule new jobs in a one machine model ⋮ 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 ⋮ A bicriteria knapsack program for planning remediation of contaminated lightstation sites
This page was built for publication: MOSA method: a tool for solving multiobjective combinatorial optimization problems
