نتایج جستجو برای: metaheuristic algorithm
تعداد نتایج: 755729 فیلتر نتایج به سال:
This paper presents an exact algorithm, a constructive heuristic algorithm, and a metaheuristic for the Hamiltonian p-Median Problem (HpMP). The exact algorithm is a branch-and-cut algorithm based on an enhanced p -median based formulation, which is proved to dominate an existing p -median based formulation. The constructive heuristic is a giant tour heuristic, based on a dynamic programming fo...
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
This paper presents a hybrid metaheuristic algorithm (HMA) for Multi-Mode Resource-Constrained Project Scheduling Problem (MRCPSP) in PERT networks. A PERT-type project, where activities require resources of various types with random duration, is considered. Each activity can be accomplished in one of several execution modes and each execution mode represents an alternative combination of resou...
one of the most important measures needed to be done in times of crisis is to optimize the allocation and distribution of resources among individuals. time is a critical factor effective to increase the number of people rescued by the relief activities.in this paper, we present a relief vehicle routing model in the affected area which uses covering tour approach to reduce total response time. a...
Nature computing has evolved with exciting performance to solve complex real-world combinatorial optimization problems. These problems span across engineering, medical sciences, and sciences generally. The Ebola virus a propagation strategy that allows individuals in population move among susceptible, infected, quarantined, hospitalized, recovered, dead sub-population groups. Motivated by the e...
Metaheuristic algorithms, as effective methods for solving optimization problems, have recently attracted considerable attention in science and engineering fields. They are popular broad applications owing to their high efficiency low complexity. These algorithms generally based on the behaviors observed nature, physical sciences, or humans. This study proposes a novel metaheuristic algorithm c...
the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید