Abstract
This present study deals with the problem of sequencing feeding tasks of a single mobile robot with manipulation arm which is able to provide parts or components for feeders of machines in a manufacturing cell. The mobile robot has to be scheduled in order to keep machines within the cell producing products without any shortage of parts. A method based on the characteristics of feeders and inspired by the (s, Q) inventory system, is thus applied to define time windows for feeding tasks of the robot. The performance criterion is to minimize total traveling time of the robot in a given planning horizon. A genetic algorithm-based heuristic is developed to find the near optimal solution for the problem. A case study is implemented at an impeller production line in a factory to demonstrate the result of the proposed approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Crama, Y., van de Klundert, J.: Cyclic scheduling of identical parts in a robotic cell. Oper. Res. 45, 952–965 (1997)
Crama, Y., van de Klundert, J.: Cyclic scheduling in 3-machine robotic flow shops. J. Sched. 2, 35–54 (1999)
Crama, Y., Kats, V., van de Klundert, J., Levner, E.: Cyclic scheduling in robotic flow shops. Ann. Oper. Res. 96, 97–124 (2000)
Dang, Q.V., Nielsen, I.E., Steger-Jensen, K.: Scheduling a single mobile robot for feeding tasks in a manufacturing cell. In: Proc. of Int. Conf. Adv. Prod. Manag. Syst., Norway (2011)
Dror, M., Stulman, A.: Optimizing robot’s service movement: a one dimensional case. Comput. Ind. Eng. 12, 39–46 (1987)
Goldberg, D.E.: Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, New York (1989)
Kats, V., Levner, E.: Parametric algorithms for 2-cyclic robot scheduling with interval processing times. J. Sched. (2010), doi:10.1007/s10951-010-0166-0
Kats, V., Levner, E.: A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times. Eur. J. Oper. Res. 209, 51–56 (2011)
Maimon, O., Braha, D., Seth, V.: A neural network approach for a robot task sequencing problem. Artif. Intell. Eng. 14, 175–189 (2000)
Potvin, J.Y.: Genetic algorithms for traveling salesman problem. Ann. Oper. Res. 63, 339–370 (1996)
Suárez, R., Rosell, J.: Feeding sequence selection in a manufacturing cell with four parallel machines. Robot Comput. Integrated Manuf. 21, 185–195 (2005)
Shyu, J.-H., Liu, A., Kao-Shing, H.: A multi-agent architecture for mobile robot navigation control. In: Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence, pp. 50–57 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dang, QV., Nielsen, I.E., Bocewicz, G. (2012). A Genetic Algorithm-Based Heuristic for Part-Feeding Mobile Robot Scheduling Problem. In: Rodríguez, J., Pérez, J., Golinska, P., Giroux, S., Corchuelo, R. (eds) Trends in Practical Applications of Agents and Multiagent Systems. Advances in Intelligent and Soft Computing, vol 157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28795-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-28795-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28794-7
Online ISBN: 978-3-642-28795-4
eBook Packages: EngineeringEngineering (R0)