Abstract:We consider problems on networks that are captured by two performance measures. One performance measure is any general cost function of a solution; the other is a bottleneck measure that describes the worst (maximum cost) component of the solution. The paper contains algorithms to solve three problems. In one problem, we minimize the bottleneck subject to a constraint on the generalized cost. In the second problem, we minimize the generalized cost subject to a constraint on the bottleneck. In the third problem… Show more
“…We observe that a heuristic solution to CBSTP can be obtained by a simple modification of our BST-heuristic, taking insights from [23]. Again, note that the possible objective function values of CBTSP are the distinct edge costs of E and wez perform binary search over this set.…”
Section: Variations Of the Btspmentioning
confidence: 97%
“…Subject to H ∈ F, ∑ e∈H W e ≤B CBSTP can be solved using the general purpose algorithm of Berman et al [23], designed for general constrained bottleneck problems. We observe that a heuristic solution to CBSTP can be obtained by a simple modification of our BST-heuristic, taking insights from [23].…”
This paper describes a new heuristic algorithm for the bottleneck traveling salesman problem (BTSP), which exploits the formulation of BTSP as a traveling salesman problem (TSP). Computational tests show that our algorithm is quite effective. It found optimal solutions for many problems from the standard traveling salesman problem library (TSPLIB) problems. We also consider BTSP with an additional constraint and show that our BTSP heuristic can be modified to obtain a heuristic to solve this problem. Relationships between symmetric and asymmetric versions of BTSP are also discussed.
“…We observe that a heuristic solution to CBSTP can be obtained by a simple modification of our BST-heuristic, taking insights from [23]. Again, note that the possible objective function values of CBTSP are the distinct edge costs of E and wez perform binary search over this set.…”
Section: Variations Of the Btspmentioning
confidence: 97%
“…Subject to H ∈ F, ∑ e∈H W e ≤B CBSTP can be solved using the general purpose algorithm of Berman et al [23], designed for general constrained bottleneck problems. We observe that a heuristic solution to CBSTP can be obtained by a simple modification of our BST-heuristic, taking insights from [23].…”
This paper describes a new heuristic algorithm for the bottleneck traveling salesman problem (BTSP), which exploits the formulation of BTSP as a traveling salesman problem (TSP). Computational tests show that our algorithm is quite effective. It found optimal solutions for many problems from the standard traveling salesman problem library (TSPLIB) problems. We also consider BTSP with an additional constraint and show that our BTSP heuristic can be modified to obtain a heuristic to solve this problem. Relationships between symmetric and asymmetric versions of BTSP are also discussed.
“…Polynomial algorithms considering a sum and a bottleneck objective are presented in [11][12][13][14]. More recently, shortest path problems involving two bottleneck and a sum objective were analyzed in [15] and [16].…”
We consider multiple objective combinatorial optimization problems in which the first objective is of arbitrary type and the remaining objectives are either bottleneck or k-max objective functions. While the objective value of a bottleneck objective is determined by the largest cost value of any element in a feasible solution, the k th -largest element defines the objective value of the k-max objective. An efficient solution approach for the generation of the complete nondominated set is developed which is independent of the specific combinatorial problem at hand. This implies a polynomial time algorithm for several important problem classes like shortest paths, spanning tree, and assignment problems with bottleneck objectives which are known to be N P-hard in the general multiple objective case.
“…In location theory, center and median are two measures that reflect two different interests. Various ways of combining two objectives have been studied (see Berman, Einav and Handler 1990;Hansen 1979; and for a comprehensive text on multiple criteria decision making, Zeleny, 1982).…”
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.