نتایج جستجو برای: multi objective simulated annealing mosa
تعداد نتایج: 1117567 فیلتر نتایج به سال:
recently, much attention has been given to stochastic demand due to uncertainty in the real -world. in the literature, decision-making models and suppliers' selection do not often consider inventory management as part of shopping problems. on the other hand, the environmental sustainability of a supply chain depends on the shopping strategy of the supply chain members. the supplier selection pl...
In this paper, multi-objective set covering problems (MOSCP) as one of the location-allocation models are being considered. Here, the objective is to minimize the cost of locating facilities and at the same time to maximize demand satisfaction in a defined structure so that each customer or zone is being covered by at least one facility. Since the problem falls into NP-hard category from the ...
This paper describes a new technique for solving the duration minimization in a resourceconstrained network. It is based on a transformation of the resource-constrained project scheduling problem (RCPSP) to a sequence of (multi)knapsack problem (MKP) solutions. In the first part, three deterministic approaches are summarized and their time complexity is discussed. Due to the combinatorial natur...
Real Options for Project Schedules (ROPS) has three recursive sampling/optimization shells. An outer Adaptive Simulated Annealing (ASA) optimization shell optimizes parameters of strategic Plans containing multiple Projects containing ordered Tasks. A middle shell samples probability distributions of durations of Tasks. An inner shell samples probability distributions of costs of Tasks. PATHTRE...
PURPOSE To alleviate the intrinsic limitation of current time-of-flight magnetic resonance angiography (TOF-MRA) techniques, which are insensitive to in-plane blood flow due to the flow saturation effect. MATERIALS AND METHODS A multi-oblique-stack acquisition (MOSA) technique was proposed in this study to tackle this TOF problem by acquiring two or more TOF image stacks bearing different ori...
One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...
Abstract We describe the solver that we developed for Sports Timetabling Competition ITC2021, a three-stage simulated annealing approach, makes use of portfolio six different neighborhoods. Five these neighborhoods are taken from literature on round-robin tournament scheduling, whereas last one, denoted as PartialSwapTeamsPhased, is novel contribution and it specifically designed phased version...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید