A branch-and-bound algorithm for flow-path design of automated guided vehicle systems

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199106)38:3<431::AID-NAV3220380311>3.0.CO;2-C" /><431::AID-NAV3220380311>3.0.CO;2-C 10.1002/1520-6750(199106)38:3<431::AID-NAV3220380311>3.0.CO;2-CzbMath0725.90030OpenAlexW2016562690MaRDI QIDQ5202812

Kathryn A. Wilson, Munirpallam A. Venkataramanan

Publication date: 1991

Full work available at URL: https://doi.org/10.1002/1520-6750(199106)38:3<431::aid-nav3220380311>3.0.co;2-c

zbMATH Keywords

branch-and-boundautomated guided vehicle systemoptimal, unidirectional flow path

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (17)

On the generalized 2-peripatetic salesman problem ⋮ Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems ⋮ Heavy traffic analysis of a single vehicle loop in an automated storage and retrieval system ⋮ Designing an efficient method for tandem AGV network design problem using tabu search ⋮ Model and methods to address urban road network problems with disruptions ⋮ The strong network orientation problem ⋮ The undirected \(m\)-capacitated peripatetic salesman problem ⋮ A load-routeing problem in a tandem-configuration automated guided-vehicle system ⋮ An introduction to the segmented flow approach for discrete material flow systems ⋮ Optimal solution for the flow path design problem of a balanced unidirectional AGV system ⋮ A six sigma based multi-objective optimization for machine grouping control in flexible cellular manufacturing systems with guide-path flexibility ⋮ A practical exact algorithm for the shortest loop design problem in a block layout ⋮ Designing an efficient method for simultaneously determining the loop and the location of the P/D stations using genetic algorithm ⋮ Developing exact and Tabu search algorithms for simultaneously determining AGV loop and P/D stations in single loop systems ⋮ Minimum-cost strong network orientation problems: Classification, complexity, and algorithms ⋮ Heuristiques pour le Problème du Vendeurm-Péripatétique ⋮ Survey of research in the design and control of automated guided vehicle systems

This page was built for publication: A branch-and-bound algorithm for flow-path design of automated guided vehicle systems