Hierarchical particle swarm optimization algorithm of IPSVR problem

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Production scheduling (PS) and vehicle routing (VR) are integrated to solve a production issue with timing requirement. The issue of multiple production chains and multiple vehicles is considered to produce productions and deliver them to customers. In the integrated production scheduling and vehicle routing (IPSVR) problem, each order is normally defined by its dependent setup time and processing time for the producing process and by its delivering time and time window for the delivering process. In this paper, a hierarchical particle swarm optimization algorithm is proposed for solving the IPSVR problem and reaching the minimum tardiness time.

Cite

CITATION STYLE

APA

Chen, S. K., Wu, G. H., Ti, Y. W., Wang, R. Z., Fang, W. P., & Lu, C. J. (2014). Hierarchical particle swarm optimization algorithm of IPSVR problem. In Advances in Intelligent Systems and Computing (Vol. 238, pp. 231–238). Springer Verlag. https://doi.org/10.1007/978-3-319-01796-9_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free