In textile industry, marker planning is one of the main operations in the cutting fabric stage. Marker packing is usually used to maximize cloth exploitation and minimize its waste. In this research, a method is used based on new found meta-heuristic imperialist competitive algorithm (ICA) and Bottom-Left-Fill Algorithm (BLF) to achieve optimal marker packing. Function of the proposed method wa...

ADP (an Agent Decomposition-based Planner) is designed to deduce agent decompositions from standard PDDL-encoded planning problems and then to exploit such found decompositions to generate a heuristic used for efficient planning. The decomposition process partitions the problem into an environment and a number of agents which act on and influence the environment, but can not (directly) effect e...

In a mining supply chain, products from mines are blended at port terminals to ensure that set of blending targets (such as grade and qualities) achieved. The production scheduling problem each individual mine the for network ports constitute integrated optimisation, which involves modelling material flows mine-side pits port-side stockpiles. Due scale bilinear constraints behaviours, is comput...

in this study, a bi-objective model for integrated planning of production-distribution in a multi-level supply chain network with multiple product types and multi time periods is presented. the supply chain network including manufacturers, distribution centers, retailers and final customers is proposed. the proposed model minimizes the total supply chain costs and transforming time of products ...

This paper deals with parallel analysis of an electromagnetic problem for frequency-dependent materials. The solution of the linear wave equation is achieved using the finite element time domain method. A multi-pole Debye model approximates the memory of the dispersive material. The time-domain convolution is explicitly calculated using the integration by parts method. The linear recursive tech...

This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ‡ow shop problem with a single transportation robot and a blocking constraint. We propose an approximate decomposition algorithm. The proposed approach breaks the problem into two scheduling problems that are solved sequentially: a ‡ow shop problem with a...

Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic programming algorithm is to decide on the set of tables that will hold optimal solutions to subproblems. This step predetermines the shape of the dynamic programming recurrences as well as the asymptotic efficiency of the alg...

The paper deals with a problem of linearization of multi-output logic functions. Specifically, the case is discussed, when the functions have a large number of variables and cannot be efficiently linearized by using known techniques. For solution of the problem a socalled piecewise linearization is proposed. The piecewise linearization comprises decomposition of an initial multi-output function...