Ara
Toplam kayıt 6, listelenen: 1-6
A new heuristic algorithm for multiple traveling salesman problem
(Işık University Press, 2017)
The Multiple Traveling Salesman Problem (mTSP) is a combinatorial optimization problem in NP-hard class. The mTSP aims to acquire the minimum cost for traveling a given set of cities by assigning each of them to a different ...
Searching for the optimal ordering of classes in rule induction
(IEEE, 2012-11-15)
Rule induction algorithms such as Ripper, solve a K > 2 class problem by converting it into a sequence of K - 1 two-class problems. As a usual heuristic, the classes are fed into the algorithm in the order of increasing ...
Minimization of rest mismatches in round robin tournaments
(Pergamon-Elsevier Science Ltd, 2018-11-01)
In sports tournaments, an occurrence of a difference in the rest periods of opponent teams in a game, which we refer to as a rest mismatch, will disadvantage the less rested team. Thus, it is only fair to expect opposing ...
Optimal and near-optimal partner selection algorithms in cooperative OFDMA
(IEEE, 2012)
We obtain the jointly optimal power allocation and partner selection policies, that maximize the sum rate of a cooperative OFDMA system with mutually cooperating pairs of users. We show that the power allocation and partner ...
Optimal project duration for resource leveling
(Elsevier Science BV, 2018-04-16)
Resource leveling is important in project management as resource fluctuations are costly and undesired. Typically, schedules with better resource profiles are obtained by shifting the activities within their float times ...
Energy load balancing for fixed clustering in wireless sensor networks
(IEEE, 2012-05-07)
Clustering can be used as an effective technique to achieve both energy load balancing and an extended lifetime for a wireless sensor network (WSN). This paper presents a novel approach that first creates energy balanced ...