The recent evolution of computers and mathematical programming techniques has provide the development of a new class of algorithms called matheuristics. Associated with an improvement of MIP solvers, many of these methods have been successful applied to solve combinatorial problems. This work presents an approach that hybridizes metaheuristics based on local search and exact algorithms to solve...

In this paper we present two new approaches for finding good starting solutions to the planar p-median problem. Both methods rely on a discrete approximation of continuous model that restricts facility locations given set demand points. The first method adapts phase greedy random construction algorithm proposed minimum sum squares clustering second one implements simple descent procedure based ...

In this paper, a new ranking method known as median is used to convert fuzzy transportation problems crisp valued and then solve them by using the Max-Min technique. We can apply both types of numbers such odd even numbers. Using method, we reach an optimal solution balanced well unbalanced FTP.

In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of the other vertices in G. The subgraph induced by the vertices of minimum (maximum) status in G is called the median (anti-median) of G. The median problem of graphs is closely related to the optimization problems involving the placement of network servers, the core of the entire networks. Bipart...