Search
Now showing items 1-10 of 7769
An Observational Study of Co Rumination in Adolescent Friendships.
معرفی روش جدید الگوریتم مورچه برای مساله تخصیص درجه ۲ ساخت یافته
New Ant algorithm for QAP problem...
New Evolutionary Algorithm for Examination Timetabling Problem
In this approach we modify Scatter Search with our new methods and
solve the Examination Timetabling Problem. Also we solve this problem
with existing methods such as SA and TS and compare results of
them with each other...
The Generalized Noxious Facility Location Problem
This paper deals with the problem of determining the location of noxious facilities, which are undesirable to be near the customers living neighborhood. Here, we propose a new problem which is more applicable in the real world. In the proposed...
Generalized Covering Salesman Problem
Given n cities, the Covering Salesman Problem (CSP) is to identify the minimum length tour “covering” all the nodes, i.e. the minimum length tour visiting a subset of the n cities and such that each city not on the tour is within a predetermined...
Generalized Covering Salesman Problem
The Covering Salesman Problem (CSP) is to identify the minimum length tour of a subset of n given cities such that each city not on the tour is within a predetermined distance from the nodes on the tour. In this paper we define and develop a...