Hierarchical Particle Swarm Optimization Algorithm of IPSVR Problem

  • Shang-Kuan Chen
  • Gen-Han Wu
  • Yen-Wu Ti
  • Ran-Zan Wang
  • Wen-Pinn Fang
  • Chian-Jhu Lu
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 238)

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.

Keywords

production scheduling vehicle routing hierarchical particle swarm optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rom, W., Slotnick, S.A.: Order acceptance using genetic algorithms. Computers and Operations Research 36, 1758–1767 (2009)CrossRefMATHGoogle Scholar
  2. 2.
    Slotnick, S.A., Morton, T.E.: Order acceptance with weighted tardiness. Computers and Operations Research 34(10), 3029–3042 (2007)CrossRefMATHGoogle Scholar
  3. 3.
    Oğuz, C., Salman, F.S., Yalçın, Z.B.: Order acceptance and scheduling decisions in make-to-order systems. International Journal of Production Economics 125, 200–211 (2010)CrossRefGoogle Scholar
  4. 4.
    Monkman, S.K., Morrice, D.J., Bard, J.F.: A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs. European Journal of Operational Research 187, 1100–1114 (2008)CrossRefMATHGoogle Scholar
  5. 5.
    Zhang, L., Lu, L., Yuan, J.: Single machine scheduling with release dates and rejection. European Journal of Operational Research 198, 975–978 (2009)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Lin, S.W., Lee, Z.J., Ying, K.C., Lu, C.C.: Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates. Computer and Operations Research 38, 809–815 (2011)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Chiang, W.C., Russell, R.A.: A meta-heuristic for the vehicle-routing problem with soft time windows. Journal of the Operational Research Society 55, 1298–1310 (2004)CrossRefMATHGoogle Scholar
  8. 8.
    Feillet, D.: A tutorial on column generation and branch and price for vehicle routing problems. 4 OR-A Quarterly Journal of Operations Research 8, 407–424 (2010)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Liberatore, F., Righini, G., Salani, M.: A column generation algorithmfor the vehicle routing problem with soft time windows. 4 OR-A Quarterly Journalof Operations Research 9, 49–82 (2011)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Belfiore, P., Yoshizaki, H.T.Y.: Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil. European Journal of Operational Research 199, 750–758 (2009)CrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Shang-Kuan Chen
    • 1
  • Gen-Han Wu
    • 2
  • Yen-Wu Ti
    • 3
  • Ran-Zan Wang
    • 4
  • Wen-Pinn Fang
    • 1
  • Chian-Jhu Lu
    • 2
  1. 1.Department of Computer Science and Information EngineeringYuanpei UniversityHsinchuTaiwan
  2. 2.Graduate Institute of Logistics ManagementNational Dong Hwa UniversityShoufengTaiwan
  3. 3.Department of Computer Science & Information EngineeringHwa Hsia Institute of TechnologyZhongheTaiwan
  4. 4.Department of Computer Science and EngineeringYuan Ze UniversityZhongliTaiwan

Personalised recommendations