Previous research has shown that artificial immune systems can be used to produce robust schedules in a manufacturing environment. The main goal is to develop building blocks (antibodies) of partial schedules that can be used to construct backup solutions (antigens) when disturbances occur during production. The building blocks are created based upon underpinning ideas from artificial immune sy...

The Prize Collecting Traveling Salesman Problem (PCTSP) can be associated to a salesman that collects a prize in each city visited and pays a penalty for each city not visited, with travel costs among the cities. The objective is to minimize the sum of travel costs and penalties, while including in the tour enough cities to collect a minimum prize. This paper presents one solution procedure for...

This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...

This paper proposes an Iterated Local Search (ILS) procedure and an Iterated Greedy (IG) algorithm, which are both combined with a variable neighbourhood search (VNS), for dealing with the flow shop problem with blocking, in order to minimize the total tardiness of jobs. The structure of both algorithms is very similar, but they differ in the way that the search is diversified in the space of s...

This paper investigates a single machine scheduling problem with strong industrial background, named the prize-collecting single machine scheduling problem with sequence-dependent setup times. In this problem, there are n candidate jobs for processing in a single machine, each job has a weight (or profit) and a processing time, and during processing a symmetric sequence-dependent setup time exi...

RNNs have local feedback loops within the network which allows them to shop earlier accessible patterns. This network can be educated with gradient descent back propagation and optimization technique such as second-order methods; conjugate gradient, quasi-Newton, Levenberg-Marquardt have also been used for networks training [14, 15]. But still this algorithm is not definite to find the global m...

Abstract In this paper we propose a hybrid metaheuristic based on Particle Swarm Optimization, which tailor portfolio selection problem. To motivate and apply our metaheuristic, reformulate the problem as an unconstrained problem, by means of penalty functions in framework exact methods. Our is it adaptively updates parameters model during optimization process. addition, iteratively refines its...

Abstract The Asymmetric Distance-Constrained Vehicle Routing Problem (ADVRP) is NP-hard as it a natural extension of the Problem. In ADVRP problem, each customer visited exactly once by vehicle; every tour starts and ends at depot; traveled distance vehicle not allowed to exceed predetermined limit. We propose hybrid metaheuristic algorithm combining Randomized Variable Neighborhood Search (RVN...

International Diabetes Federation (IDF) reports that diabetes is a rapidly growing illness. About 463 million adults between 20-79 years have diabetes. There are also millions of undiagnosed patients. It estimated there will be about 578 diabetics by 2030 [1]. reasons different eye diseases. Diabetic retinopathy (DR) one them and the most common vision loss or blindness worldwide. DR progresses...