نتایج جستجو برای: adaptive large neighborhood search
تعداد نتایج: 1476857 فیلتر نتایج به سال:
The paper presents Greedy Randomized Adaptive Search Procedure with Path Relinking (GRASP with PR) for the Critical Node Detection Problem (CNDP). An evolutionary Path Relinking mechanism is added to GRASP with PR to intensify. Our computational experiments show that this algorithm is a competitive method compared with the previously proposed methods for solving CNDP such as Variable Neighborho...
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 ...
Medical data sets consist of a huge amount of data organized in instances, where each one contains several attributes. The quality of the models obtained from a database strongly depends on the information previously stored on it. For this reason, these data sets must be preprocessed in order to have fairly information about patients. Data sets are preprocessed reducing the amount of data. For ...
This paper proposes a way to combine the Mesh Adaptive Direct Search (MADS) algorithm, which extends the Generalized Pattern Search (GPS) algorithm, with the Variable Neighborhood Search (VNS) metaheuristic, for nonsmooth constrained optimization. The resulting algorithm retains the convergence properties of MADS, and allows the far reaching exploration features of VNS to move away from local s...
Multi-Agent Path Finding (MAPF) is the problem of finding a set collision-free paths for team agents in common environment. MAPF NP-hard to solve optimally and, some cases, also bounded-suboptimally. It thus time-consuming (bounded-sub)optimal solvers large instances. Anytime algorithms find solutions quickly instances and then improve them close-to-optimal ones over time. In this paper, we cur...
Virtual network mapping considers the problem of fitting multiple virtual networks into one physical network in a cost-optimal way. This problem arises in Future Internet research. One of the core ideas is to utilize different virtual networks to cater to different application classes, each with customized protocols that deliver the required Quality-ofService. In this work we introduce a Greedy...
Feeder services are public transit that transport people from a low demand, typically suburban, area to high demand area, such as transportation hub or city. Here, passengers continue their journey using traditional forms of transport. On the one hand, on-demand feeder have been topic discussion in number recent studies, since these can serve efficiently. other with predetermined routes and tim...
Many discrete optimization problems of practical interest cannot be solved to optimality in the available time. A practical approach to these problems is to use heuristic algorithms, which do not guarantee the optimality of the solution but which, for many problems, can find nearly optimal solutions within a reasonable amount of computational time. The literature on heuristic algorithms often d...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید