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...

Christopher James Coakley University of California, Santa Barbara 41.

The Discretizable Molecular Distance Geometry Problem (DMDGP) consists in a subclass of the Molecular Distance Geometry Problem for which an embedding in R can be found using a Branch & Prune (BP) algorithm in a discrete search space. We propose a Clifford Algebra model of the DMDGP with an accompanying version of the BP algorithm.

This paper considers large shift scheduling problems with different shift start times and lengths, fractionable breaks and work stretch duration restrictions. Two solution approaches are proposed to solve the problems over a multiple-day planning horizon. The first approach is based on a local branching strategy and the second one is based on a temporal decomposition of the problem. Local branc...

Dual-tree method Assume: K(·) parameterized by a distance function: K(x, y) = K (δ(x, y)). Main idea: build a spatial access tree on the source and target points, and use this to bound the value of the maximum influence and prune candidate nodes which cannot contain a particle that exceeds this bound. The bound tightens as we expand the tree, allowing more nodes to be pruned and leaving but a f...