|
|
|
|
Search published articles |
|
|
Showing 2 results for Combinatorial Optimization
Sheibani, Volume 2, Issue 2 (6-2011)
Abstract
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of standard benchmark problems indicate that the proposed hybrid meta-heuristic approach is very efficient.
M Aman, J Tayyebi, Volume 5, Issue 2 (10-2014)
Abstract
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capacity inverse problem under the bottleneck-type and the sum-type weighted Hamming distances. In the bottleneck-type case, the binary search technique is applied to present an algorithm for solving the problem in O(nm log n) time. In the sum-type case, it is shown that the inverse problem is strongly NP-hard even on bipartite networks
|
|
|
|
|
|