نتایج جستجو برای: Decomposition-based heuristic algorithm
تعداد نتایج: 3419020 فیلتر نتایج به سال:
The passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. A line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. A new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems....
the passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. a line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. a new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems....
we consider the queueing maximal covering location-allocation problem (qm-clap) with an m/m/1 queueing system. we propose a new solution procedure based on decomposition of the problem into smaller sub-problems. we solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic grasp. we also solve the entire model with grasp. computational results for these ...
heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...
abstract biometric access control is an automatic system that intelligently provides the access of special actions to predefined individuals. it may use one or more unique features of humans, like fingerprint, iris, gesture, 2d and 3d face images. 2d face image is one of the important features with useful and reliable information for recognition of individuals and systems based on this ...
Supply Chain Network Design (SCND) is a strategic supply chain management problem that determines its configuration. This mainly focuses on the facilities location, capacity sizing, technology selection, supplier selection, transportation, allocation of production and distribution facilities to the market, and so on. Although the optimal solution of the SCND problem leads to a significant reduc...
The existing research on the two-workshop integrated scheduling problem with symmetrical resources does not consider complex product attribute structure and objective situation of plant equipment resources. This results in prolongation makespan reduction utilization rate general workshop. To solve above problems, a algorithm based process tree cyclic decomposition (STHIS-PTCD) was proposed. Fir...
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
این پایان نامه مروری بر مقاله a singular value decomposition algorithm based on solving hyperplane constrained nonlinear systems باشد. در این ?? که در سال 2010 توسط کی. کندو، 1 کی. یادانی 2 و ام. ایواساکی 3 ارائه شد، می شود. این روش که به روش ?? ی مقادیر تکین ماتریس ارائه می ?? پایان نامه الگوریتمی جدید برای تجزیه هایش در ?? خطی که جواب ?? ابرصفحه مقید معروف است، مسأله تجزیه مقدار تکین را ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید