An effective discrete artificial bee colony algorithm for multi-AGVs dispatching problem in a matrix manufacturing workshop

Zou, Wen-Qiang; Pan, Quan-Ke; Meng, Tao; Gao, Liang; Wang, Yulong

doi:10.1016/j.eswa.2020.113675

Cited by 82 publications

(23 citation statements)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The scheduling problem for multiple AGVs is NP-hard because the number of feasible schedules increases exponentially as the number of transport tasks, number of AGVs, and size of the warehouse increase. [4] Consequently, it is difficult to obtain an exact solution; hence, approximate solutions have been studied.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Rapid Search Method for Scheduling Delivery of Multiple Automated Guided Vehicles

Meno

Yorozu

Ohya

2022

Preprint

View full text Add to dashboard Cite

In this study, a method was developed to address the automated guided vehicle (AGV) transportation scheduling problem. For deliveries in factories and warehouses, it is necessary to quickly plan a feasible transportation schedule without delay within a specified time. This study focused on obtaining a transport schedule without delay from the specified time while maintaining the search for a better solution during the execution of the transport task. Accordingly, a method was developed for constructing a solution with a two-dimensional array of delivery tasks for each AGV, arranged in the order in which they are executed, as well as for searching for a schedule by performing exchange and insertion operations. For the exchange and insertion, a method that considers the connectivity between the end point of a task and the start point of the next task was adopted. To verify the effectiveness of the proposed method, numerical simulations were performed assuming an actual transportation task.

show abstract

Section: Related Workmentioning

confidence: 99%

“…3 The AGV moves along the shortest path from the start point to the end point to complete the transportation. 4 The AGV starts the next transfer task from the point where it finished the previous one. 5 It takes 10 s each for the AGV to load and unload the rack.…”

Section: Problem Descriptionmentioning

confidence: 99%

A Rapid Search Method for Scheduling Delivery of Multiple Automated Guided Vehicles

Meno

Yorozu

Ohya

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…The multi-objective ABC algorithm is a widely used algorithm in the literature for varied multi-objective problems. Some of these problems are scheduling problem [12][13][14][15][16], short-term scheduling of hydrothermal system [17], software requirement optimization [18] ,optimizing network topology design [19], manufacturing [5,20], smart grid communication [21], resource leveling problem [22], vehicle routing problem [23], band selection problem [24], and feature selection problem [25][26][27].…”

Section: Related Workmentioning

confidence: 99%

“…Especially, in NP-Hard problems, heuristic and metaheuristic optimization algorithms are convenient to overcome large-scale problems than exact methods [5]. Considering the approaches proposed in the literature for MORAP, it has been observed that well-known meta-heuristic methods such as genetic algorithm [6][7][8], ant colony optimization algorithm [9], particle swarm algorithm [10], and variable neighborhood search [1] have been suggested for the problem.…”

Section: Introductionmentioning

confidence: 99%

Solving Multi-Objective Resource Allocation Problem Using Multi-Objective Binary Artificial Bee Colony Algorithm

Acar

Başçiftçi

2021

Arab J Sci Eng

View full text Add to dashboard Cite

Resource allocation is the optimal distribution in a limited number of resources available for certain activities. The allocation of the resources for a large number of activities requires exponentially multiplying a computation cost. Therefore, the resource allocation problem is known as NP-Hard problem in the literature. In this study, a multi-objective binary artificial bee colony algorithm has been proposed for solving the multi-objective resource allocation problems. The proposed algorithm has benefited from the robust structure and easy implementation properties of the artificial bee colony algorithm. The contribution is to introduce the multi-objective version of the artificial bee colony algorithm with advanced local search and binary format using transfer functions. The multi-objective binary artificial bee colony algorithm has been improved as two versions using sigmoid and hyperbolic tangent transfer functions to be able to search in the binary search space. With the proposed algorithms, the multi-objective resource allocation problems in the literature are solved, and the algorithms are compared with other algorithms that develop for the same problems. The results obtained show that the proposed algorithms give effective results on the problem. Especially, in large-scale problems, higher accuracy values are reached with a smaller number of evaluations.

show abstract

“…It is suitable for optimizing the parameters of the NES. At present, the metaheuristic algorithm includes the genetic algorithm [47], the particle swarm optimization algorithm [48], the ant colony optimization algorithm [49], and the artificial bee colony optimization algorithm [50]. Among them, the differential evolution algorithm is a member of the genetic algorithm, which is an efficient, parallel and global search method [51].…”

Section: Introductionmentioning

confidence: 99%

Analytical, Numerical and Experimental Study of an Enhanced Nonlinear Energy Sink

Geng

Ding

2021

Preprint

View full text Add to dashboard Cite

Based on theoretical and experimental investigations, this paper proposes a nonlinear energy sink (NES) with piecewise linear springs to enhance vibration suppression effects. A cubic nonlinear oscillator is coupled with a piecewise linear spring to form an enhanced NES (E-NES). Without adding a new resonance region and changing the resonance frequency of the primary system, the enhanced NES can achieve better vibration suppression effects. Based on the free vibration and the forced vibration, the influence of piecewise linear stiffness on the vibration suppression is profoundly examined. The results show that the E-NES has a better suppression effect on the vibration of the primary structure than that of the cubic NES in most cases. Furthermore, the piecewise stiffnesses and gap displacements are optimized through the differential evolution algorithm. The best damping effect of the E-NES on the free vibration is presented. However, it also happens that the vibration suppression effect of the E-NES is weaker than that of the conventional NES. Moreover, the experimental results verify the analytical and numerical results. The vibration elimination efficiency of the E-NES exceeds 90%. Therefore, this research on using piecewise springs to enhance the vibration suppression efficiency will attract attention.

show abstract

An effective discrete artificial bee colony algorithm for multi-AGVs dispatching problem in a matrix manufacturing workshop

Cited by 82 publications

References 49 publications

A Rapid Search Method for Scheduling Delivery of Multiple Automated Guided Vehicles

A Rapid Search Method for Scheduling Delivery of Multiple Automated Guided Vehicles

Solving Multi-Objective Resource Allocation Problem Using Multi-Objective Binary Artificial Bee Colony Algorithm

Analytical, Numerical and Experimental Study of an Enhanced Nonlinear Energy Sink

Contact Info

Product

Resources

About