in this paper an efficient three- stage algorithm is developed for software production cost and time estimation. first stage includes a hybrid model composed of cocomo and function points methods to increase estimation accuracy. second stage encompasses paired comparisons matrix of analytical hierarchy process to determine amount of any resources consumed in each step of software production by ...

Many authors have examined lot sizing, scheduling and sequence of multi-product flow shops, but most of them have assumed that set up times are independent of sequence. Whereas dependence of set up times to sequence is more common in practice. Hence, in this paper, we examine the discussed problem with hypothesis of dependence of set up times to sequence and cyclic schedule policy in basic peri...

‎In this paper, we study a flow shop batch processing machines scheduling problem. The fuzzy due dates are considered to make the problem more close to the reality. The objective function is taken as the weighted sum of fuzzy earliness and fuzzy tardiness. In order to tackle the given problem, we propose a hybrid electromagnetism-like (EM) algorithm, in which the EM is hybridized with a diversi...

The urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. Also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). In fact, making slight improvements in this issue lead to a huge saving in municipal consumption. Some inci...

logistic network design is one of the most important strategic decisions in supply chain management that has recently attracted the attention of many researchers. transportation network design is then one of the most important fields of logistic network. this study is concerned with designing a multi-stage and multi-product logistic network. at first, a mixed integer nonlinear programming model...

the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

guiding vehicles to their destination under dynamic traffic conditions is an important topic in the field of intelligent transportation systems (its). nowadays, many complex systems can be controlled by using multi agent systems. adaptation with the current condition is an important feature of the agents. in this research, formulation of dynamic guidance for vehicles has been investigated based...

imperialist competitive algorithm (ica) is a new socio-politically motivated global search strategy. the ica is applied to hybrid composite laminates to obtain minimum weight and cost. the approach which is chosen for conducting the multi-objective optimization was the weighted sum method (wsm). the hybrid composite laminates are made of glass/epoxy and carbon/epoxy to combine the lightness and...

The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...