A survey and annotated bibliography of multiobjective combinatorial optimization
From MaRDI portal
The paper gives a structured overview of the field of MultiObjective Combinatorial Optimization (MOCO) with a focus on recent developments (since 1994) while referring to earlier survey articles for most of the previous work. After an introduction and formulation of the problem, including an outline of different notions of optimality, theoretical properties of MOCO problems are discussed. Solution methods applied to MOCO problems are reviewed, covering exact methods as well as approximation methods such as simulated annealing, tabu search, genetic algorithms and other recent developments. The subsequent annotated literature review is organized according to the combinatorial structure of MOCO problems and using a classification scheme based on four categories, namely the combinatorial structure, the type of objective function, the problem type and the suggested solution method. Problems included are shortest path problems, assignment problems, transportation and transshipment problems, network flow problems, spanning tree problems, matroids and matroid intersections, the travelling salesman problem, knapsack problems, location problems, set covering problems, and others.
Recommendations
- scientific article; zbMATH DE number 2160609
- scientific article; zbMATH DE number 2159075
- Multi‐objective combinatorial optimization problems: A survey
- A survey of recent developments in multiobjective optimization
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
Cited in
(only showing first 100 items - show all)- g-dominance: Reference point based dominance for multiobjective metaheuristics
- The tricriterion shortest path problem with at least two bottleneck objective functions
- Solving a comprehensive model for multiobjective project portfolio selection
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Multi-objective optimization with diversity preserving mixture-based iterated density estimation evolutionary algorithms.
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Designing communication networks for distributed control agents.
- The multiscenario lot size problem with concave costs.
- A new approach for the multiobjective minimum spanning tree
- A graph-based algorithm for the multi-objective optimization of gene regulatory networks
- A population-based algorithm for solving linear assignment problems with two objectives
- An interactive approximation algorithm for multi-objective integer programs
- Cost-efficient allocation of additional resources for the service placement problem in next-generation internet
- A tolerance function for the multiobjective set covering problem
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
- Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores
- Multi-objective branch and bound
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- Non-additive shortest path in the context of traffic assignment
- Preprocessing and cut generation techniques for multi-objective binary programming
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- A genetic-based framework for solving (multi-criteria) weighted matching problems.
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Multiobjective solution of the uncapacitated plant location problem
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- The biobjective travelling purchaser problem
- Solving multi-objective production scheduling problems using metaheuristics
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
- Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
- Quantitative stability analysis for vector problems of 0-1 programming
- Optimising a nonlinear utility function in multi-objective integer programming
- On a measure of quasistability of a certain vector linearly combinatorial Boolean problem
- Finding a representative nondominated set for multi-objective mixed integer programs
- A multi-objective approach for unmanned aerial vehicle routing problem with soft time windows constraints
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Advancing local search approximations for multiobjective combinatorial optimization problems
- A multi-agent transgenetic algorithm for the bi-objective spanning tree problem
- Design of a heuristic algorithm for the generalized multi-objective set covering problem
- Solution approaches for equitable multiobjective integer programming problems
- Distribution based representative sets for multi-objective integer programs
- Multicriteria saliency detection: a (exact) robust network design approach
- Speed optimizations for liner networks with business constraints
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion
- On preprocessing for weighted MaxSAT
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A multiobjective metaheuristic for a mean-risk multistage capacity investment problem
- An approximation scheme for the bi-scenario sum of completion times trade-off problem
- Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution
- Empirical study of exact algorithms for the multi-objective spanning tree
- A quantum adiabatic algorithm for multiobjective combinatorial optimization
- A bicriteria approach identifying nondominated portfolios
- Exact approaches for solving robust prize-collecting Steiner tree problems
- Cone contraction and reference point methods for multi-criteria mixed integer optimization
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- On combinatorial optimization motivated by biology
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
- An improved algorithm for solving biobjective integer programs
- Algorithm robust for the bicriteria discrete optimization problem
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
- A bi-criteria approach for the data association problem
- Stability and accuracy functions in multicriteria linear combinatorial optimization problems
- On the cardinality of the Pareto set in bicriteria shortest path problems
- A discussion of scalarization techniques for multiple objective integer programming
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
- Speeding up Martins' algorithm for multiple objective shortest path problems
- Multiobjective blockmodeling for social network analysis
- Inverse multi-objective combinatorial optimization
- Expert judgments in the cost-effectiveness analysis of resource allocations: a case study in military planning
- Propagation algorithms for lexicographic ordering constraints
- A survey of recent developments in multiobjective optimization
- Genetic local search for multi-objective flowshop scheduling 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
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- MOAQ and ant-Q algorithm for multiple objective optimization problems
- Stability radius of a lexicographic optimum of a vector problem of Boolean programming
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- Multi- and many-objective path-relinking: a taxonomy and decomposition approach
- An improved multiobjective shortest path algorithm
- An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems
- Taby search for multiobjective combinatorial optimization: TAMOCO
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- A hybrid particle swarm approach based on tribes and tabu search for multi-objective optimization
- How good is the Chord algorithm?
- Resource-constrained project scheduling through the goal programming model: integration of the manager's preferences
- A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
- The smoothed number of Pareto-optimal solutions in non-integer bicriteria optimization
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Project portfolio selection model, a realistic approach
- Multiobjective combinatorial optimization: some approaches
- Multiple objective optimization and implications for single objective optimization.
- Finding integer efficient solutions for multiple objective network programming problems
- A lower bound of the Choquet integral integrated within martins' algorithm
- Postoptimal analysis of the multicriteria combinatorial median location problem
- A Logic-Based Framework for Reasoning about Composite Data Structures
- A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives
- Multicriteria optimization in humanitarian aid
- Smart Production by Integrating Product-Mix Planning and Revenue Management for Semiconductor Manufacturing
This page was built for publication: A survey and annotated bibliography of multiobjective combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1841810)
