Combinatorial optimization

Keeping track with the mounting requirements of quality digital marketing, Elagoon Digital has announced the launch of customized packages that can ease the financial burden for most of the customers. The company came up with this announcement just to fulfill the demands of various business owners who run different businesses with varying requirements. These requirements are not similar, and that is why one SEO service cannot be effective to achieve objectives that different business owners have…

Lack of marketing policy and sales of services through lawyer can significantly influence on business activity of AL Hurdle Law LLC and be one of the weak side of it. Not the last place at creation and in work of the legal company should be occupied with the developed policy and standards in the field of marketing, sales and PR. It is necessary to understand how and through which sources AL Hurdle Law LLC can attract new clients, what resources, employee, and amount of money it can direct to its…

author Email: M_Aghaie@sbu.ac.ir Fax: +98 21 29902546 Abstract The Multi-Objective Loading Pattern Optimization is one of the most important concerns for the incore design of nuclear reactors. Hence, different techniques have been presented for optimization of incore patterns for nuclear reactors. This paper presents…

However, 10 years earlier many of basic TS elements were already suggested by Glover as a part of specific oriented heuristic for solving nonlinear covering problem \cite{glover1977,osman1996}. The TS meta-heuristics is mostly applied to combinatorial optimization problems. TS can be viewed as an extension of classical (steepest) local search method in order to overcome local optima with including various types of memory structures (classical being \textit{short-term memory})…

In this chapter an overview on the Bee Colony Optimization (BCO) method is presented. In the first introductory section the development of the BCO algorithm is given, with an overview on history of mathematical model based on discovered behavior patterns in bees in early 1940s. The aim here is to remind of first steps made in solving of optimization problems by BCO and what kind of changes were performed to obtain the current versions of the BCO method. In the second section two variants of the…

cities first and then move to the same city from where it has started its whole journey. One of the concerns here with this problem, here is that the salesman cannot visit a single city twice. There are several optimization techniques such as ant colony optimization, particle swarm optimization, genetic algorithm, nearest neighbor algorithm, etc. out of which we have solved Travelling salesman problem using a Genetic algorithm and Nearest neighbor algorithm. In our paper, we have shown that for…

150 years without a general solution. The use of swarm intelligence, specifically ant systems, has been quite successful in finding the salesman's optimal path. Its success can be attributed to the fact that swarm intelligence excels in combinatorial optimization problems. Locating the optimal path mirrors the process of ants foraging for food. In both cases, ants are dispersed randomly in search of the nearest city. The ant that returns first communicates its findings to the colony. This…

expensive function, especially for the industries involving distribution. The Operational Research literature has addressed this problem by calling it as the vehicle routing problem (VRP). Vehicle scheduling or vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem. The Travelling Salesman Problem (TSP) was introduced much before the Vehicle Routing Problem(VRP). In a way, VRP generalises the TSP. VRP first appeared in a paper by George Dantzig and John…

of a possible solution of the problem at hand and is called a chromosome. Each chromosome is evaluated by a function known as the fitness function which is usually called the cost function or the objective function of the corresponding optimization problem. Next new population is generated from the present one through selection crossover, repair and mutation operations. Purpose of selection mechanism is to select more fit individuals for crossover and mutation. A crossover…

Ruiz-Vanoye, J. A., Diaz-Parra, O., Saénz, A. C., Barrera-Cámara, R. A., Fuentes-Penna, A., & Bernabe-Loranca, B. (2014). Strategic planning for the computer security: A practice case of an electrical research institute.International Journal of Combinatorial Optimization Problems and Informatics, 5(2),…