Complexity of the AGV shortest path and single-loop guide path layout problems

Guzman, Margo; Prabhu, N. U.; Tanchoco, J. M. A.

doi:10.1080/002075497194741

Cited by 43 publications

(8 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several layouts that have single-loop and cyclic structures have been reported [23], [24]. For this reason, we adopt a cyclic layout structure, as shown in Fig.…”

Section: Robotic Batch Manufacturing Systemmentioning

confidence: 99%

Multirobot Coordination for Flexible Batch Manufacturing Systems Experiencing Bottlenecks

Hoshino

Seki

Naka

et al. 2010

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

In this paper, we focus on a batch manufacturing system with multiple industrial robots. In this system, material-handling robots (MHRs) and material-processing robots (MPRs) are operating. Since various operations are conducted at certain places, one of them might include a localized bottleneck. A localized bottleneck is a constraint that dominates the maximum amount of production in a system, that is, the productivity. In addition, the bottleneck induces congestion; as a result, the productivity declines. For these issues, there are two primary challenges: bottleneck prevention and restraint. To solve them, suitable operational techniques with respect to the MHRs and MPRs are needed in order for them to operate appropriately while relating to each other. In this paper, a constructive approach toward multi-robot coordination problems is taken. In this approach, we propose applicable operational techniques for the robots. Through simulation experiments, we examine the effectiveness of the proposed techniques and their combinations and, finally, show an integrated operational technique. Each of the operational techniques solves a localized bottleneck and the congestion, and the integrated technique successfully improves the productivity and results in the most efficient system.Note to Practitioners-The primary motivation for this study was the pursuit of answers to the problems associated with production operations for a pipeless batch plant system in chemical process industries. These solutions will also apply to other manufacturing systems for high-mix low-volume production with a number of machines or robots. In many previous studies, scientists addressed the optimization problem of production scheduling; in this study, however, we focus on a simulation study and aim to develop an applicable integration technology for the coordination of operating robots in the interest of the automation of a highly flexible production activity. In practical batch manufacturing systems, as an entire operational strategy, it is necessary to equalize the flow of products, i.e., bottlenecks, throughout the system. Furthermore, once a localized bottleneck appears, its harmful effect on the system has to be restrained. Therefore, we suggest efficient operational techniques to tackle these challenging issues. Through various simulation experiments, we show that some good combinatorial techniques enable to improve productivity. The results of this paper are feasible and sufficient for flexible batch manufacturing systems, but the application is limited to a system in which the safety of production operations and processes is guaranteed. In future research, we will address design problems regarding safety and reliability in a plant system.

show abstract

“…Several layouts that have single-loop and cyclic structures have been reported [23], [24]. For this reason, we adopt a cyclic layout structure, as shown in Fig.…”

Section: Robotic Batch Manufacturing Systemmentioning

confidence: 99%

Multirobot Coordination for Flexible Batch Manufacturing Systems Experiencing Bottlenecks

Hoshino

Seki

Naka

et al. 2010

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

show abstract

“…The loop design problem (LDP) locates a shortest loop covering at least one edge from each work center in an existing facility layout. The NP-hardness of the LDP was proven by De Guzman et al (1997). By defining a binary variable for each directed arc, Tanchoco and Sinriech (1992) formulate the problem as an integer linear program.…”

Section: Literature Reviewmentioning

confidence: 99%

The value of the shortest loop covering all work centers in a manufacturing facility layout

Asef-Vaziri

Ortiz

2007

International Journal of Production Research

View full text Add to dashboard Cite

In this study we develop mathematical models to design circular material flow systems. We first develop a tight formulation to find the shortest loop covering all work centers within a manufacturing facility layout. The shortest loop is an attractive solution for most types of conveyors and power-and-free systems, where the length of the flow path is the major driver of the total cost. We develop a primal as well as a dual graph formulation and discuss their one-to-one correspondence in node-edge as well as in connectivity constraints. Our solution times outperform other optimization models available for the facility layout shortest loop design problem. We then approach trip-based material handling, such as automated guided vehicle systems, where the total loaded and empty trip distance is the major driver of the total cost. The problem in these systems evolves into concurrent design of the loop, pickup and dropoff station, and the empty vehicle dispatching policies. On the foundation of the shortest loop model, we propose a decomposition heuristic for design of trip-based flow systems. Computational results indicate that the heuristic provides high quality and robust solutions.

show abstract

“…Firstly, routing of AGV system through the guide path network in manufacturing facility was proved to be NP-complete problem [3]. Due to the obvious limitations of the exhaustive search algorithms in solving NP-complete problems, an approximate algorithm is used to find an optimal solution to the problem under consideration.…”

Section: Literature Reviewmentioning

confidence: 99%

Hybrid multiobjective genetic algorithms for integrated dynamic scheduling and routing of jobs and automated-guided vehicle (AGV) in flexible manufacturing systems (FMS) environment

Umar

Ariffin

Ismail

et al. 2015

Int J Adv Manuf Technol

104

View full text Add to dashboard Cite

The paper presents an algorithm for integrated scheduling, dispatching, and conflict-free routing of jobs and AGVs in FMS environment using a hybrid genetic algorithm. The algorithm generates an integrated schedule and detail routing paths while optimizing makespan, AGV travel time, and penalty cost due to jobs tardiness and delay as a result of conflict avoidance. The multi-objective fitness function use adaptive weight approach to assign weights to each objective for every generation based on objective improvement performance. Fuzzy expert system is used to control genetic operators using the overall population performance improvements of the last two previous generations. Computational experiments was conducted on the developed algorithm coded in Matlab to test the effectiveness of the algorithm. Integrated scheduling of jobs in FMS which are in synchrony with AGV dispatching, scheduling, and routing proved to ensure the feasibility and effectiveness of all the solutions of the integrated constituent elements.

show abstract

Complexity of the AGV shortest path and single-loop guide path layout problems

Cited by 43 publications

References 8 publications

Multirobot Coordination for Flexible Batch Manufacturing Systems Experiencing Bottlenecks

Multirobot Coordination for Flexible Batch Manufacturing Systems Experiencing Bottlenecks

The value of the shortest loop covering all work centers in a manufacturing facility layout

Hybrid multiobjective genetic algorithms for integrated dynamic scheduling and routing of jobs and automated-guided vehicle (AGV) in flexible manufacturing systems (FMS) environment

Contact Info

Product

Resources

About