The chaotic simulated annealing algorithm for combinatorial optimization problems is examined in the light of the global bifurcation structure of the chaotic neural networks. We show that the result of the chaotic simulated annealing algorithm is primarily dependent upon the global bifurcation structure of the chaotic neural networks and unlike the stochastic simulated annealing infinitely slow...

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...

assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. in this study, we solve quadratic assignment problem (qap), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. it should be noted that any facility must be assign to only one location. in this paper, first o...

in this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (nlgp) by using an efficient initial point. some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by data envelopment analysis...

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 single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/i/etmax). due to the time complexity function, this sequencing problem belongs to a class of np-hard ones. thus, a special design of a simulated annealing (sa) method is applied to solve such a hard problem. to comp...