A three-phase search approach for the quadratic minimum spanning tree problem

Abstract

Given an undirected graph with costs associated with each edge as well as each pair of edges, the quadratic minimum spanning tree problem (QMSTP) consists of determining a spanning tree of minimum total cost. This problem can be used to model many real-life network design applications, in which both routing and interference costs should be considered. For this problem, we propose a three-phase search approach named TPS, which integrates 1) a descent-based neighborhood search phase using two different move operators to reach a local optimum from a given starting solution, 2) a local optima exploring phase to discover nearby local optima within a given regional search area, and 3) a perturbation-based diversification phase to jump out of the current regional search area. Additionally, we introduce dedicated techniques to reduce the neighborhood to explore and streamline the neighborhood evaluations. Computational experiments based on hundreds of representative benchmarks show that TPS produces highly competitive results with respect to the best performing approaches in the literature by improving the best known results for 31 instances and matching the best known results for the remaining instances only except two cases. Critical elements of the proposed algorithms are analyzed.

Regionalization of Transportation Energy Consumption in China Based on Agglomerative Clustering Technology

“…The partitioning algorithm must iterate the segmentation of the tree and then select the best subtree scheme [6]. In this work, the homogeneity of the partition results is defined to represent the difference between the heterogeneity of the originally adjacent tree of the province and the sum of the heterogeneity of all subtrees.…”

An Iterated Three-Phase Search Approach for Solving the Cyclic Bandwidth Problem

“…The proposed ITPS algorithm was inspired by the threephase approach presented in [21]. Even if the work of [21] concerns a particular optimization problem (i.e., the quadratic minimum spanning tree problem), the approach is of general interest and has been applied to other problems such as clique partitioning [22].…”

“…The proposed ITPS algorithm was inspired by the threephase approach presented in [21]. Even if the work of [21] concerns a particular optimization problem (i.e., the quadratic minimum spanning tree problem), the approach is of general interest and has been applied to other problems such as clique partitioning [22]. In this work, we adapted this threephase approach to the CBP by reusing its general framework and making dedicated adaptations to deal with the particular features of our considered problem.…”

An iterated local search algorithm for the minimum differential dispersion problem

“…Three-phase search minimum sum coloring problem [1] quadratic minimum spanning tree problem [15] quadratic assignment problem [2] maximally diverse grouping problem [23] maximum clique problem [3] capacitated clustering problem [24] max-cut problem [4] max-k-cut problem [26] vertex separator problem [5] clique partitioning problem [36] Steiner tree problem [14] minimum differential dispersion problem assembly sequence planning problem [16] single-machine total weighted tardiness problem [11] Breakout local search introduced in [1,5] combines local search with a dedicated and adaptive perturbation mechanism. Its basic idea is to use a descent-based local search procedure to intensify the search in a given search region, and to perform dedicated perturbations to jump into a new promising search region once a local optimum is encountered.…”