recently, gasimov and yenilmez proposed an approach for solving two kinds of fuzzy linear programming (flp) problems. through the approach, each flp problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. then, the crisp problem is solved by the use of the modified subgradient method. in this paper we will have another look at the earlier defuzzifi...

Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...

The strong interest in knowledge-level description of expert systems has led to various efforts defining and cataloguing AI problem solving methods and building methodologies and tools to use them. In thus paper we address the issue of matching problem solving methods to tasks. ‘This includes 1. deciding whether a method is applicable to the problem at hand, .Z. :if it is applicable, assessing ...

this study investigated how awareness affected learners’ intake and production in relation to their cognitive styles. it is assumed that learners’ cognitive styles may affect their ability to notice particular features in the input and, consequently, their intake and production. adult learners of english were exposed to four english structures through four sets of problem-solving tasks, followe...

In keeping with the spirit of Lamarckian evolution, variations on a simple genetic algorithm are compared, in which each individual is optimized prior to evaluation. Four different optimization techniques in all are tested: random hillclimbing, social (memetic) exchange, and two techniques using artificial neural nets (ANNs). These techniques are tested on a set of three sample problems: an ins...

the vehicle routing problem with simultaneous pickup and delivery (vrpspd) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. the objective is to minimize the distance traveled. the vrpspd is an np-hard combinatorial optimization problem. therefore, practical large-scale instances of vrpspd...