نتایج جستجو برای: adaptive large neighborhood search
تعداد نتایج: 1476857 فیلتر نتایج به سال:
in this study, an optimization model is proposed to design a global supply chain (gsc) for a medical device manufacturer under disruption in the presence of pre-existing competitors and price inelasticity of demand. therefore, static competition between the distributors’ facilities to more efficiently gain a further share in market of economic cooperation organization trade agreement (ecota) is...
Abstract Large Neighborhood Search (LNS) heuristics are among the most powerful but also expensive for mixed integer programs (MIP). Ideally, a solver adaptively concentrates its limited computational budget by learning which LNS work best MIP problem at hand. To this end, introduces Adaptive (ALNS) MIP, primal heuristic that acts as framework eight popular such Local Branching and Relaxation I...
The Large Neighborhood Search metaheuristic for solving Constrained Optimization Problems has been proved to be effective on a wide range of problems. This Local Search heuristic has the particularity of using a complete search (such as Constraint Programming) to explore the large neighborhoods obtained by relaxing a fragment of the variables of the current solution. Large Neighborhood Search h...
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better candidate solutions in each iteration and hence traverse a more promising search path. Starting from the l...
The Large Neighborhood Search (LNS) approach for solving Constrained Optimization Problems has been proved to be effective on a wide range of problems. LNS is a local search metaheuristic that uses a complete search method (such as CP) to explore a large neighborhood. At each step, the neighborhood is defined by relaxing a subset, called fragment, of the variables in the current solution. Despi...
Traditional permutation flowshop scheduling problem (PFSP), which has unlimited buffer space, been interested over the fifty years by several authors to account for many industrial applications. However, some industries, such as aerospace industry and other sectors processing waste, have different blocking conditions due limited or lack of area between their machines. In this study, a mixture t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید