We propose a powerful Reinforced Hybrid Genetic Algorithm (RHGA) for the famous NP-hard Traveling Salesman Problem (TSP). RHGA combines reinforcement learning technique with well-known Edge Assembly Crossover genetic algorithm (EAX-GA) and Lin-Kernighan-Helsgaun (LKH) local search heuristic. With help of proposed hybrid mechanism, evolution EAX-GA LKH can boost each other's performance. And bas...

abstract background: menthol is the most important active material in mint and different mechanisms have been suggested for the way mint functions, most of which emphasize its analgesic effect owing to the presence of a group of temporary protein receptors. this study investigates the efficacy of peppermint capsule in the treatment of primary dysmenorrhea, in comparison with mefenamic acid and ...

The job shop scheduling problem (JSSP) is a well-known difficult combinatorial optimization problem. This paper presents a hybrid genetic algorithm for the JSSP with the objective of minimizing makespan. A new generation alternation model of genetic algorithm for JSSP is designed. Every pair of randomly selected parents must pass either crossover or mutation, which are deployed in parallel. In ...

In a complex network, random initial attacks or failures can trigger subsequent failures in a cascading manner, which is effectively a phase transition. Recent works have demonstrated that in networks with interdependent links so that the failure of one node causes the immediate failures of all nodes connected to it by such links, both first- and second-order phase transitions can arise. Moreov...

This paper describes a Genetic Algorithms approach to a manpower-scheduling problem arising at a major UK hospital. Although Genetic Algorithms have been successfully used for similar problems in the past, they always had to overcome the limitations of the classical Genetic Algorithms paradigm in handling the conflict between objectives and constraints. The approach taken here is to use an indi...

The interest about recovery of used products andmaterials have been increased. Therefore, reverse logistics network problem (rLNP) will be powerful and get a great potential for winning consumers in a more competitive context in the future. We formulate amathematical model of remanufacturing system as three-stage logistics networkmodel for minimizing the total of costs to reverse logistics ship...

Today, interest about the recovery of used products and materials is on increasing. Therefore, reverse logistics will become power and great potential for winning consumers in more competitive contexts in the future. This paper considers the multistage reverse Logistics Network Problem (mrLNP) with minimizing the total of costs to reverse logistics shipping cost. We will demonstrate the mrLNP m...

We formulate a mathematical model of remanufacturing system as multi-stage reverse Logistics Network Problem (mrLNP) with minimizing the total costs for reverse logistics shipping cost and inventory holding cost at disassembly centers and processing centers over finite planning horizons. For solving this problem, in the 1st and the 2nd stages, we propose a Genetic Algorithm (GA) with priority-b...

A new hybrid assembly line design, called Parallel U-shaped Assembly Line system, is introduced and characterised along with numerical examples for the first time. Different from existing studies on U-shaped lines, we combine the advantages of two individual line configurations (namely parallel lines and U-shaped lines) and create an opportunity for assigning tasks to multi-line workstations lo...

Multi-trial Lin-Kernighan-Helsgaun 2 (LKH-2) is widely considered to be the best Interated Local Search heuristic for the Traveling Salesman Problem (TSP) and has found the best-known solutions to a large number of benchmark problems. Although LKH-2 performs exceptionally well on most instances, it is known to have difficulty on clustered instances of the TSP. Generalized Partition Crossover (G...