نتایج جستجو برای: multi start simulated annealing
تعداد نتایج: 688447 فیلتر نتایج به سال:
This paper presents a novel GRASP algorithm based on a new randomized heuristic for solving the capacitated vehicle routing problem. This problem is characterized by a fleet of homogenous vehicle capacity that will start from one depot, to serve a number of customers with demands that are less than the vehicle capacity. The proposed method is based on a new constructive heuristic, and a simulat...
This paper has been worked on a RAP with multi-state components and the performance rate of each component working state may increase by spending technical and organizational activities costs. Whereas RAP belongs to Np-Hard problems, we used Genetic algorithm (GA) and simulated annealing (SA) and for solving the presented problem and calculating system reliability universal generating function ...
در این مطالعه ابتدا نقش فن آوری اطلاعات و تجارت الکترونیک بر مدیریت زنجیره تامین مورد بررسی قرار می گیرد. سپس پس از بررسی مدیریت موجودی در مدیریت زنجیره تامین، الگوریتمی بر مبنای مدلی که توسط آقای گریوز graves توسعه داده شده است ، به وسیله روش فوق ابتکاری simulated annealing ابداع گردیده، که بواسطه آن می توان پیکره بندی بهینه زنجیره تامین را با رویکرد کمینه نمودن هزینه موجودی و سطح سرویس بالا ب...
In this paper, we study an integrated logistic system where the optimal location of depots and vehicles routing are considered simultaneously. This paper presents a new mathematical model for a multi-objective capacitated location-routing problem with a new set of objectives consisting of the summation of economic costs, summation of social risks and demand satisfaction score. A new multi-objec...
Hybrid sorting immune simulated annealing technique (HSISAT), a Meta heuristic is proposed for solving the multi objective flexible job-shop scheduling problem (FJSP). The major objectives are distributing the time of machines among the set of operations and scheduling them to minimize the criterion (makespan, total workload and maximum workload). The processing time is sorted for isolating the...
Many areas in which computational optimisation may be applied are multi-objective optimisation problems; those where multiple objectives must be minimised (for minimisation problems) or maximised (for maximisation problems). Where (as is usually the case) these are competing objectives, the optimisation involves the discovery of a set of solutions the quality of which cannot be distinguished wi...
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...
Many areas in which computational optimisation may be applied are multi-objective optimisation problems; those where multiple objectives must be minimised (for minimisation problems) or maximised (for maximisation problems). Where (as is usually the case) these are competing objectives, the optimisation involves the discovery of a set of solutions the quality of which cannot be distinguished wi...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید