An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...

This lecture discusses the problem of allocating ad slots given search queries, where the advertisers have constrained budgets, and the search queries arrive online. An online algorithm is tasked with allocating each term to an advertiser, with the aim of maximizing the overall revenue, subject to the budget constraints. The main result described is an online algorithm that, for a random permut...

A novel Parallel Ant Colony Optimization Algorithm based on Quantum dynamic mechanism for traveling salesman problem (PQACO) is proposed. The use of the improved 3-opt operator provides this methodology with superior local search ability; several antibody diversification schemes were incorporated into the PQACO in order to improve the balance between exploitation and exploration. We describe th...

  In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...

Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Alg...

The aim of this paper is to introduce a hybrid two-phase algorithm called SW+ ASelite for solving the MTSP which can be explained as the problem of designing collection of routes from one depot to a number of customers subject to side constraints. At the first stage, the MTSP is solved by the sweep algorithm, and at the second stage, the Elite Ant Colony Optimization ( ASelite ) and 3-opt local...

in this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. in this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. to tackle the problem efficiently and effectively, an effici...

This paper presents an Optimistic Atomic Broadcast algorithm (OPT-ABcast) that exploits the spontaneous total order message reception property experienced in local area networks, in order to allow fast delivery of messages. The OPT-ABcast algorithm is based on the Optimistic Consensus problem (OPT-Consensus) that allows processes to decide optimistically or conservatively. A process optimistica...

This paper presents a heuristic technique that uses the Wang Recurrent Neural Network with the "Winner Takes All" principle to solve the Traveling Salesman Problem. When the Wang Neural Network presents solutions for the Assignment Problem with all constraints satisfied, the "Winner Takes All" principle is applied to the values in the Neural Network’s decision variables, with the additional con...

The purpose of this paper is to propose effective parallelization strategies for the Ant Colony Optimization (ACO) metaheuristic on Graphics Processing Units (GPUs). The Max–Min Ant System (MMAS) algorithm augmented with 3-opt local search is used as a framework for the implementation of the parallel ants and multiple ant colonies general parallelization approaches. The four resulting GPU algor...