A Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)

A Branch-and-bound Method for Finding Flow-path Designing of Agv Systems

One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...

Single Array and Bound Method (RESEARCH NOTE).

One of the major disadvantages of using Branch and Bound algorithm to solve permutation bases problems by computer is the size of main memory required. The single Array Branch and Bound (SABB) method introduction here aims to overcome this deficiency, using only N memory locations as a vector of size N, and a single cell C with N bits.

A modified branch and bound algorithm for a vague flow-shop scheduling problem

Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...

Two Stage Flow Shop Scheduling Problem Including Transportation Time and Weightage of Jobs with Branch and Bound Method

Designing a quantum genetic controller for tracking the path of quantum systems

Based on learning control methods and computational intelligence, control of quantum systems is an attractive field of study in control engineering. What is important is to establish control approach ensuring that the control process converges to achieve a given control objective and at the same time it is simple and clear. In this paper, a learning control method based on genetic quantum contr...

A Branch and Bound Method for a Clique Partitioning Problem

[1] J.-P. Barthélemy, B. Leclerc, “The median procedure for partitions”, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 19, 1995, 3-34. [2] I. Charon, O. Hudry, “The noising method: a new combinatorial optimization method”, Operations Research Letters 14, 1993, 133-137. [3] P. Hansen, B. Jaumard, “Cluster analysis and mathematical programming”, Mathematical Programming 7...