3 edition of **A probabilistic tabu search algorithm for the generalized minimum spanning tree problem** found in the catalog.

A probabilistic tabu search algorithm for the generalized minimum spanning tree problem

Diptesh Ghosh

- 142 Want to read
- 29 Currently reading

Published
**2003**
by Indian Institute of Management in Ahmedabad
.

Written in

- Algorithms.,
- Trees (Graph theory)

**Edition Notes**

Statement | Diptesh Ghosh. |

Series | Working paper ;, W.P. no. 2003-07-02, Working paper (Indian Institute of Management, Ahmedabad) ;, W.P. no. 2003-07-02. |

Contributions | Indian Institute of Management, Ahemdabad. |

Classifications | |
---|---|

LC Classifications | Microfiche 2004/60558 (Q) |

The Physical Object | |

Format | Microform |

Pagination | 8 leaves |

ID Numbers | |

Open Library | OL3336732M |

LC Control Number | 2004327293 |

Nov 11, · A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data. J. Heuristics 18(4), – () Algorithm Engineering in Robust Optimization. In: Kliemann L., Sanders P. (eds) Algorithm Engineering. Lecture Cited by: Zhanghua Fu and Jin-Kao Hao. A three-phase search approach for the quadratic minimum spanning tree problem. Engineering Applications of Artificial Intelligence 4 6: , (pdf, doi) Elsevier©. Ines Sghir, Jin-Kao Hao, Ines Ben Jaafar, Khaled Ghédira. A multi-agent based optimization method applied to the quadratic assignment problem.

Travelling salesman problem explained. The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?"It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. The criss-cross algorithm does not have polynomial time-complexity, however. Researchers have extended the criss-cross algorithm for many optimization-problems, including linear-fractional programming. The criss-cross algorithm can solve quadratic programming problems and linear complementarity problems, even in the setting of oriented matroids.

Jul 31, · () Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem. European Journal of Operational Research , () A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas festivous-ilonse.com by: Abstract. In this paper we present the SteinLib, a library of data sets for the Steiner tree problem in festivous-ilonse.com library extends former libraries on Steiner tree problems by many new interesting and difficult instances, most of them arising from real-world festivous-ilonse.com by:

You might also like

Downloadable. In this paper we present a probabilistic tabu search algorithm for the generalized minimum spanning tree problem. The basic idea behind the algorithm is to use preprocessing operations to arrive at a probability value for each vertex which roughly corresponds to its probability of being included in an optimal solution, and to use such probability values to shrink the size of the Cited by: 3.

This paper describes an attribute based tabu search heuristic for the generalized minimum spanning tree problem (GMSTP) known to be NP-hard. Given a graph whose vertex set is partitioned into clusters, the GMSTP consists of designing a minimum cost tree spanning all festivous-ilonse.com by: This paper describes an attribute based tabu search heuristic for the generalized minimum spanning tree problem (GMSTP) known to be NP-hard.

Given a graph whose vertex set is partitioned into. Upper and lower bounding strategies for the generalized minimum spanning tree problem Article in European Journal of Operational Research (2) · February with 28 Reads.

By the Riesz Representation Theorem for locally compact Hausdorff spaces, for every positive linear functional I on K(X) there is a measure µ such that I(f)= R fd µ,w hereK(X) is the set of. Minimum spanning tree (MST) problem is of high importance in network optimization and can be solved efficiently.

The multi-criteria MST (mc-MST) is a more realistic representation of the practical. This NP-hard problem is known in the literature as the symmetric Generalized Traveling Salesman Problem (GTSP), and finds practical applications in routing, scheduling and location-routing.

In a companion paper (Fischetti et al. [Fischetti, M., J. Salazar, P. Toth. The generalized minimum spanning tree problem: An overview of Cited by: The problem of flnding a Capacitated Minimum Spanning Tree asks for connecting a set of client nodes to a root node through a minimum cost tree network, subject to capacity constraints on all links.

The purpose of this paper is to describe TABUROUTE, a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions. The algorithm considers a sequence of adjacent solutions obtained by repeatedly removing a vertex from its Cited by: Edmonds' algorithm (also known as Chu–Liu/Edmonds' algorithm): find maximum or minimum branchings; Euclidean minimum spanning tree: algorithms for computing the minimum spanning tree of a set of points in the plane; Euclidean shortest path problem: find the shortest path between two points that does not intersect any obstacle.

We consider a variant of the classical symmetric Traveling Salesman Problem in which the nodes are partitioned into clusters and the salesman has to visit at least one node for each cluster. Tabu Search for Generalized Minimum Spanning Tree Problem.

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. Journal of Cited by: The travelling salesman problem was mathematically formulated in the s by the Irish mathematician W.R. Hamilton and by the British mathematician Thomas festivous-ilonse.comon’s Icosian Game was a recreational puzzle based on finding a Hamiltonian cycle.

The general form of the TSP appears to have been first studied by mathematicians during the s in Vienna and at Harvard, notably by Karl.

A hybrid algorithm based on simulated annealing and tabu search for k-minimum spanning tree problems. A New GFDM Receiver with Tabu Search. A tabu search heuristic for a generalized quadratic assignment problem. A tabu search algorithm for the job Cited by: de Souza M, Duhamel C and Ribeiro C A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy Metaheuristics, () Souza M, Maculan N and Ochi L A GRASP-tabu search algorithm for solving school timetabling problems Metaheuristics, ().

Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem inRd. Networks, Vol. 24, No. 3 Rate of convergence for the Euclidean minimum spanning tree limit law. Operations Research Letters, Vol.

14, No. 2 Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane Cited by: "An Adaptive Tabu Search Algorithm for Market Clearing Problem in Turkish Day-Ahead Market," Papersfestivous-ilonse.com Ghosh, Diptesh, "Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems," IIMA Working Papers WP, Indian Institute of Management Ahmedabad, Research and Publication Department.

Contreras-Bolton C, Gatica G, Barra C and Parada V () A multi-operator genetic algorithm for the generalized minimum spanning tree problem, Expert Systems with Applications: An International Journal, C, (), Online publication date: May Abstract.

It is the purpose of this paper to investigate effects of adding randomization to a memory-based heuristic. The algorithms we propose are applied to the Capacitated Minimum Spanning Tree problem (CMST), and we study the combined effects of simultaneously applying a memory-based and a randombased heuristic to the festivous-ilonse.com by: 9.

Operations Research: An Introduction. The new Section provides a comprehensive (math-free) framework of how the different LP algorithms (simplex, dual simplex, revised simplex, and interior point) are implemented in commercial codes (e.g., CPLEX and XPRESS) to provide the computational speed and accuracy needed to solve very large festivous-ilonse.combility: This item has been replaced by.

The minimum k-cardinality tree problem on graph G consists in finding a subtree of G with exactly k edges whose sum of weights is minimum. A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy: Mauricio C A GRASP-tabu search algorithm for solving school timetabling problems Cited by:.

Approximation Algorithms for the Generalized Stacker Crane Problem. Combinatorial Optimization and Applications, A biased random-key genetic algorithm for the capacitated minimum spanning tree problem. Computers & Operations Research 57, A tabu search algorithm for the min–max k-Chinese postman festivous-ilonse.com by: Artificial bee colony algorithm.

Artificial bee colony (ABC) algorithm is an optimization technique that simulates the foraging behavior of honey bees, and has been successfully applied to various practical problems [citation needed].

ABC belongs to the group of swarm intelligence algorithms and was proposed by Karaboga in The second method, on the other hand, constructs a spanning tree once and for all — employing problem-specific heuristics in every step of the tree-construction.

As case studies, we consider two sample problems (Degree-Constrained MST and Minimun-Length Fundamental-Cycle-Set) — one for each of the two festivous-ilonse.com by: