the multiple traveling salesman problem (mtsp) is a generalization of the famous traveling salesman problem (tsp), where more than one salesman is used in the solution. although the mtsp is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. this paper presents an efficient and evolutionary optimization algorith...

in many real world assembly line systems which the work-piece is of large size more than one worker work on the same work-piece in each station. this type of assembly line is called multi-manned assembly line (mal). in the classical multi-manned assembly line balancing problem (malbp) the objective is to minimize the manpower needed to manufacture one product unit. apart from the manpower, othe...

With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution because of the huge size of the state space. Only heuristic algorithms have been presented up till now. In this paper we propose an approach where, starting from a given heuristic algorithm, one obtains a better algorithm ...

 It is scientifically challenging to determine the inventory level all through the supply chain in such a way that the desired objectives such as effectiveness and responsiveness of the supply chain system can be obtained. Simulation is a means for solving various problems which cannot be solved by regular exact models such as mathematical ones due to their complexity. The present paper is aime...

We consider a single-machine scheduling problem, in which the processing time of a job can take any value from a given segment. The criterion is to minimize the sum of weighted completion times of the n jobs, a positive weight being associated with a job. For a job permutation, we study the stability box, which is a subset of the stability region. We derive an O(n logn) algorithm for constructi...

This study is investigated the optimum parameters for a tuned mass damper (TMD) under the seismic excitation. Shuffled complex evolution (SCE) is a meta-heuristic optimization method which is used to find the optimum damping and tuning frequency ratio for a TMD. The efficiency of the TMD is evaluated by decreasing the structural displacement dynamic magnification factor (DDMF) and acceleration ...

Response surface methodology is a common tool in optimizing processes. It mainly concerns situations when there is only one response of interest. However, many designed experiments often involve simultaneous optimization of several quality characteristics. This is called a Multiresponse Surface Optimization problem. A common approach in dealing with these problems is to apply desirability funct...

Code Assignment is one of the central problems in the management of mobile wireless networks, where a very precious resource (radio bandwidth) needs to be carefully shared among network nodes. As this problem has been shown to be NP-hard in every real world instance, no practical exact solution can be provided, and heuristic algorithms are being developed whose actual performance can hardly be ...

location-allocation is a combinatorial optimization problem, and is defined as non deterministic polynomial hard (np) hard optimization. therefore, solution of such a problem should be shifted from exact to heuristic or meta heuristic due to the complexity of the problem. locating medical centers and allocating injuries of an earthquake to them has high importance in earthquake disaster managem...

This two-part paper presents modelling and scheduling approaches of flexible manufacturing systems using Petri nets (PNs) and artificial intelligence (AI)-based heuristic search methods. In Part I, PN-based modelling approaches and basic AI-based heuristic search algorithms were presented. In Part II, a new heuristic function that exploits PN information is proposed. Heuristic information obtai...