نتایج جستجو برای: variable neighbourhood search algorithm
تعداد نتایج: 1213473 فیلتر نتایج به سال:
Emergency incidents, including natural disasters, terrorist attacks, public health outbreaks, and industrial and mining accidents, and so forth, result in severe human casualties and property losses. Emergency facilities, which provide relief materials and services, play an important role in rescue management. The decision of where to locate the emergency rescue facilities is very important, as...
In the present paper the step fixed charge transportation problem under uncertainty, particularly when variable and fixed cost are given in fuzzy forms, is formulated. In order to solve the problem, two metaheuristic, simulated annealing algorithm (SA) and variable neighbourhood search (VNS), are developed for this NP-hard problem. Due to the significant role of parameters and operators on the ...
Increased blood demand and limited supply make shortages a significant problem in the chain, which may cause immeasurable losses. The objective of this paper is to develop scheduling scheme products during shortages, considering supply. For purpose, bi-objective mixed-integer programming model proposed, one minimises maximum shortage hospitals as well other latest arrival time. To solve model, ...
This paper addresses two NP-hard and strongly related problems in production planning of flexible manufacturing system (FMS), part type selection problem and machine loading problem. Various flexibilities such as alternative machines, tools, and production plans are considered. Real coded genetic algorithms (RCGA) that uses an array of real numbers as chromosome representation is developed to h...
This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible. Given an undirected labelled connected graph, the minimum labelling spanning tree problem seeks a spanning tree whose edges have the smallest number of distinct labels. This problem has been shown to be NP-hard. A Greedy Random...
ambiguous and subjective (Ang et al., 2010). Over the years, the classical TRIZ has been studied and extended to embrace broader features and inventive principles. This study led to the development of a new TRIZ matrix, which contained up to 48 features, with 77 inventive principles (Mann et al., 2003). Several years later, the study of TRIZ had brought to another matrix, which comprised 50 fea...
The Graph Colouring Problem (GCP) is a well known -hard problem with many theoretical and practical applications. In this paper we introduce a new local search algorithm based on a very large scale neighbourhood. We provide an extensive numerical comparison between this method and several other local search techniques considering also the embedding of the local search into more complex schemes ...
in this paper, a comprehensive model is proposed to design a network for multi-period, multi-echelon, and multi-product inventory controlled the supply chain. various marketing strategies and guerrilla marketing approaches are considered in the design process under the static competition condition. the goal of the proposed model is to efficiently respond to the customers’ demands in the presenc...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید