Multicriteria optimization of simulation models
WSC '91 Proceedings of the 23rd conference on Winter simulation
Proceedings of the 32nd conference on Winter simulation
Healthcare II: multi-objective simulation optimization for a cancer treatment center
Proceedings of the 33nd conference on Winter simulation
Feature Article: Optimization for simulation: Theory vs. Practice
INFORMS Journal on Computing
Ant Colony Optimization
Two metaheuristics for multiobjective stochastic combinatorial optimization
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
Evolutionary optimization in uncertain environments-a survey
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
The bi-objective stochastic covering tour problem
Computers and Operations Research
A math-heuristic for the warehouse location-routing problem in disaster relief
Computers and Operations Research
| Hi-index | 0.00 |
We propose a general-purpose algorithm APS (Adaptive Pareto-Sampling) for determining the set of Pareto-optimal solutions of bicriteria combinatorial optimization (CO) problems under uncertainty, where the objective functions are expectations of random variables depending on a decision from a finite feasible set. APS is iterative and population-based and combines random sampling with the solution of corresponding deterministic bicriteria CO problem instances. Special attention is given to the case where the corresponding deterministic bicriteria CO problem can be formulated as a bicriteria integer linear program (ILP). In this case, well-known solution techniques such as the algorithm by Chalmet et al. can be applied for solving the deterministic subproblem. If the execution of APS is terminated after a given number of iterations, only an approximate solution is obtained in general, such that APS must be considered a metaheuristic. Nevertheless, a strict mathematical result is shown that ensures, under rather mild conditions, convergence of the current solution set to the set of Pareto-optimal solutions. A modification replacing or supporting the bicriteria ILP solver by some metaheuristic for multicriteria CO problems is discussed. As an illustration, we outline the application of the method to stochastic bicriteria knapsack problems by specializing the general framework to this particular case and by providing computational examples.