نتایج جستجو برای: multi start simulated annealing
تعداد نتایج: 688447 فیلتر نتایج به سال:
delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. in this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several produ...
logit models are one of the most important discrete choice models and they play an important role in describing decision makers’ choices among alternatives. in this paper the multi-nominal logit models has been used in mode choice modeling of isfahan. despite the availability of different mathematical computer programs there are not so many programs available for estimating discrete choice mode...
In this paper a new approach is proposed for the adaptation of the simulated annealing search in the field of the Multi-Objective Optimization (MOO). This new approach is called Multi-Case Multi-Objective Simulated Annealing (MC-MOSA). It uses some basics of a well-known recent Multi-Objective Simulated Annealing proposed by Ulungu et al., which is referred in the literature as U-MOSA. However,...
this paper presents a multi-criteria vehicle routing problem with soft time windows (vrpstw) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. in this case, the fleet is heterogene-ous. the vrpstw consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. it is assumed that this relaxation a...
To understand the regulation of the gene expression, the identification of transcription start sites (TSSs) is a primary and important step. With the aim to improve the computational prediction accuracy, we focus on the most challenging task, i.e., to identify the TSSs within 50 bp in non-CpG related promoter regions. Due to the diversity of non-CpG related promoters, a large number of features...
Simulated annealing (SA) algorithms can be modeled as time-inhomogeneous Markov chains. Much work on the convergence rate of simulated annealing algorithms has been well-studied. In this paper, we propose an adiabatic framework for studying simulated annealing algorithm behavior. Specifically, we focus on the problem of simulated annealing algorithms that start from an initial temperature T0 an...
this paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. this paper presen...
in this paper, we considered solving approaches to flexible job shop problems. makespan is not a good evaluation criterion with overlapping in operations assumption. accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. as overlapping in operations is a practical assumption in chemical, petrochemical, and gla...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید