A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
Authors
Abstract:
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start algorithm that in each iteration constructs a randomized greedy solution and applies local search to it. Path-relinking stores elite solutions and to find better solutions explores the paths between different solutions. Experimental results show the performance of our algorithm on many benchmark problems compared to the other algorithms.
similar resources
A hybrid metaheuristic algorithm for the robust pollution-routing problem
Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...
full textA Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
full textMetaheuristic Approaches for the Quadratic Minimum Spanning Tree Problem
Given an undirected graph with costs associated both with its edges and unordered pairs of edges, the quadratic minimum spanning tree problem asks to find a spanning tree that minimizes the sum of costs of all edges and pairs of edges in the tree. We present multistart simulated annealing, hybrid genetic and iterated tabu search algorithms for solving this problem. We report on computational ex...
full textThe Iterative Minimum Cost Spanning Tree Problem
The minimum cost spanning tree problem consists in constructing a network of minimum cost that connects all agents to the source and distributes the cost among the agents in a fair way. We develop a framework for the iterative minimum cost spanning tree problem. In the iterative setting, agents arrive over time and desire to be connected to a source in different rounds in order to receive a ser...
full textMinimum Cost Spanning Tree MCST problem
Originally studied for designing min cost connecting grid (in distribution, transportation, communication applications) to connect a set of cities. Under arc lengths > 0 min cost connecting network will bea spanning tree (ST). Earliest algo. (Boruvka's) dates back to 1926! Undirected, connected G = (N A c). To nd an uncon-strained MCST in G. c arbitrary. Constrained MCST problems (typical const...
full textMy Resources
Journal title
volume 6 issue None
pages 65- 78
publication date 2015-03
By following a journal you will be notified via email when a new issue of this journal is published.
No Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023