Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
نویسندگان
چکیده
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy 2 the Pareto curve of a multiobjective optimization problem. We show that for a broad class of bi-objective problems (containing many important widely studied problems such as shortest paths, spanning tree, matching and many others), we can compute in polynomial time an 2-Pareto set that contains at most twice as many solutions as the minimum such set. Furthermore we show that the factor of 2 is tight for these problems, i.e., it is NP-hard to do better. We present upper and lower bounds for three or more objectives, as well as for the dual problem of computing a specified number k of solutions which provide a good approximation to the Pareto curve.
منابع مشابه
Parametric search and problem decomposition for approximating Pareto-optimal paths
The multiobjective shortest path problem arises in many transportation and logistics applications, either as a stand-alone network routing problem or a subroutine of a more complex multiobjective network optimization problem. It has been addressed by different solution strategies, including labeling methods, ranking methods, constraint methods, and parametric methods. Increasing attention has b...
متن کاملA bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics
This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...
متن کاملImproved Fptas for Multiobjective Shortest Paths with Applications
We consider multiobjective shortest paths, a fundamental (NP-hard) problem in multiobjective optimization, where we are interested not in optimizing a single objective, but in finding a set of paths that captures the trade-off (the so-called Pareto curve) among several objectives in a digraph whose edges are associated with multidimensional cost vectors. We provide a new FPTAS for computing an ...
متن کاملDecision Making Based on Approximate and Smoothed Pareto Curves
We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the so-called decision maker’s approach in which both criteria are combined into a single (usually non-linear) objective function. Previous work by Papadimitriou and Yannakakis showed how to efficiently approximate the Pareto curv...
متن کاملAn effective method based on the angular constraint to detect Pareto points in bi-criteria optimization problems
The most important issue in multi-objective optimization problems is to determine the Pareto points along the Pareto frontier. If the optimization problem involves multiple conflicting objectives, the results obtained from the Pareto-optimality will have the trade-off solutions that shaping the Pareto frontier. Each of these solutions lies at the boundary of the Pareto frontier, such that the i...
متن کامل