9 research outputs found
Competitive Decision Algorithm for the Rooted Delay-constrained Minimum Spanning Tree
Abstract-In this paper, we investigate a rooted delayconstrained minimum spanning tree (RDCMST) problem. RDCMST seeks to find a minimum spanning tree in which no path from a specified root node to any other nodes may exceed a given delay bound. RDCMST is a NP-hard combinatorial optimization problem arising both in scientific research and practical engineering. Competitive decision algorithm (CDA) is a newly proposed meta-heuristic algorithm for solving complex combinatorial optimization problems. A new CDA algorithm for RDCMST problem is proposed in this paper. Restricted candidate list (RCL) and randomly choosing resource are introduced in CDA for the first time. We reduce the search space based on the mathematical properties of RDCMST. To evaluate the algorithm, numerical computational experiments are performed
New formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller–Tucker–Zemlin constraints
Cataloged from PDF version of article.Given an undirected network with positive edge costs and a natural number p, the Hop-Constrained Minimum
Spanning Tree problem (HMST) is the problem of finding a spanning tree with minimum total cost
such that each path starting from a specified root node has no more than p hops (edges). In this paper, we
develop new formulations for HMST. The formulations are based on Miller–Tucker–Zemlin (MTZ) subtour
elimination constraints, MTZ-based liftings in the literature offered for HMST, and a new set of topologyenforcing
constraints. We also compare the proposed models with the MTZ-based models in the literature
with respect to linear programming relaxation bounds and solution times. The results indicate that
the new models give considerably better bounds and solution times than their counterparts in the literature
and that the new set of constraints is competitive with liftings to MTZ constraints, some of which
are based on well-known, strong liftings of Desrochers and Laporte (1991).
2011 Elsevier B.V. All rights reserved
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures
This paper investigates the Steiner Tree Problem with Delays (STPD), a variation of the classical Steiner Tree problem that arises in multicast routing. We propose an exact solution approach that is based on a polynomial-size formulation for this challenging NP-hard problem. The LP relaxation of this formulation is enhanced through the derivation of new lifted Miller-Tucker-Zemlin subtour elimination constraints. Furthermore, we present several preprocessing techniques for both reducing the problem size and tightening the LP relaxation. Finally, we report the results of extensive computational experiments on instances with up to 1000 nodes. These results attest to the efficacy of the combination of the enhanced formulation and reduction techniques
New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
Given an undirected network with positive edge costs and a natural number p, the hop-constrained minimum spanning tree problem (HMST) is the problem of finding a spanning tree with minimum total cost such that each path starting from a specified root node has no more than p hops (edges). In this paper, the new models based on the Miller-Tucker-Zemlin (MTZ) subtour elimination constraints are developed and computational results together with comparisons against MTZ-based, flow-based, and hop-indexed formulations are reported. The first model is obtained by adapting the MTZ-based Asymmetric Traveling Salesman Problem formulation of Sherali and Driscoll [18] and the other two models are obtained by combining topology-enforcing and MTZ-related constraints offered by Akgün and Tansel (submitted for publication) [20] for HMST with the first model appropriately. Computational studies show that the best LP bounds of the MTZ-based models in the literature are improved by the proposed models. The best solution times of the MTZ-based models are not improved for optimally solved instances. However, the results for the harder, large-size instances imply that the proposed models are likely to produce better solution times. The proposed models do not dominate the flow-based and hop-indexed formulations with respect to LP bounds. However, good feasible solutions can be obtained in a reasonable amount of time for problems for which even the LP relaxations of the flow-based and hop-indexed formulations can be solved in about 2 days. © 2010 Elsevier Ltd. All rights reserved
Layered graph approaches for combinatorial optimization problems
Extending the concept of time-space networks, layered graphs associate information about one or multiple resource state values with nodes and arcs. While integer programming formulations based on them allow to model complex problems comparably easy, their large size makes them hard to solve for non-trivial instances. We detail and classify layered graph modeling techniques that have been used in the (recent) scientific literature and review methods to successfully solve the resulting large-scale, extended formulations. Modeling guidelines and important observations concerning the solution of layered graph formulations by decomposition methods are given together with several future research directions
New formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller-Tucker-Zemlin constraints
Given an undirected network with positive edge costs and a natural number p, the Hop-Constrained Minimum Spanning Tree problem (HMST) is the problem of finding a spanning tree with minimum total cost such that each path starting from a specified root node has no more than p hops (edges). In this paper, we develop new formulations for HMST. The formulations are based on Miller-Tucker-Zemlin (MTZ) subtour elimination constraints, MTZ-based liftings in the literature offered for HMST, and a new set of topology-enforcing constraints. We also compare the proposed models with the MTZ-based models in the literature with respect to linear programming relaxation bounds and solution times. The results indicate that the new models give considerably better bounds and solution times than their counterparts in the literature and that the new set of constraints is competitive with liftings to MTZ constraints, some of which are based on well-known, strong liftings of Desrochers and Laporte (1991). © 2011 Elsevier B.V. All rights reserved