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

Heuristic searches are the most commonly used search methods in the eld of arti cial intelligence. A heuristic provides an estimate of the remaining distance to the goal. With this knowledge, the search algorithms can greatly prune the search tree that has to be explored to nd a solution. Heuristic function is often done by hand using human intuition but can be automated to some extent. An auto...

Heuristics involve the ability to utilize memory to make quick judgments by exploiting fundamental cognitive abilities. In the current study we investigated the memory processes that contribute to the recognition heuristic and the fluency heuristic, which are both presumed to capitalize on the byproducts of memory to make quick decisions. In Experiment 1, we used a city-size comparison task whi...

Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and particle swarm optim...

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

This paper addresses two questions about computational innovative design: (1) How can a computer program recognize a good analogue for innovative design?, and (2) How can it eeciently nd one, once it knows how to recognize it? We answer question 1 by presenting a heuristic mapping engine that evaluates a candidate analogy based on features of the mappings between the devices' structures, behavi...

the purpose of this study was to evaluate the web pages of islamic world science citation center (isc), the islamic countries sci using nielsen`s heuristic principles and was performed during september 2012. among nielsen`s 10 usability heuristic principles, five were covered. five professional evaluators were asked to evaluate the database using nielsen`s five criteria. the total average of se...

in this paper the conditional location problem is discussed. conditional location problems have a wide range of applications in location science. a new meta-heuristic algorithm for solving conditional p-median problems is proposed and results are compared to those of the previous studies. this algorithm produces much better results than the previous formulations.

A two-stage inventory system is considered where Poisson demand occurs at Stage 1, and Stage 1 replenishes its inventory from Stage 2, which in turn orders from an outside supplier with unlimited stock. Each shipment, either to Stage 2 or to Stage 1, incurs a fixed setup cost. Under the assumption that the supply leadtime at Stage 2 is zero, we characterize a simple heuristic policy whose long-...