نتایج جستجو برای: search problem
تعداد نتایج: 1119304 فیلتر نتایج به سال:
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
in this paper the conditional location problem is discussed. conditional location problems have a wide range of applications in location science. a new meta-heuristic algorithm for solving conditional p-median problems is proposed and results are compared to those of the previous studies. this algorithm produces much better results than the previous formulations.
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...
the inventory routing problem (irp) arises in the context of vendor-managed systems. this problem addresses jointly solving an inventory management problem and a vehicle routing problem. in this paper, we consider a multi-depot multi-vehicle inventory routing problem in which suppliers produce one type of product to be delivered to customers during a finite time horizon. we propose a two-phase ...
the capacitated clustering problem (ccp) is one of the most importantcombinational optimization problems that nowadays has many real applications inindustrial and service problems. in the ccp, a given n nodes with known demandsmust be partitioned into k distinct clusters in which each cluster is detailed by anode acting as a cluster center of this cluster. the objective is to minimize the sumof...
the recent years have witnessed an increasing attention to the methods of multiple attribute decision making in solving the problems of the real world due to their shorter time of calculation and easy application. one of these methods is the ‘permutation method’ which has a strong logic in connection with ranking issues, but when the number of alternatives increases, solving problems through th...
one of methods of improvement of the material flow is cross docking that in is considered as a good method to reduce inventory and improve customer satisfaction. too, the vehicle routing problem is one of the important problems in distribution management and its goal is to find paths for delivering various cargos. therefore, this study was conducted in order to vehicle routing problem with cros...
this paper considers the search problem, introduced by srivastava cite{sr}. this is a model discrimination problem. in the context of search linear models, discrimination ability of search designs has been studied by several researchers. some criteria have been developed to measure this capability, however, they are restricted in a sense of being able to work for searching only one possible non...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید