Advertisement

Solve the IRP Problem with an Improved PSO

  • Zelin WangEmail author
  • Shi Cheng
  • Hu Peng
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 986)

Abstract

It is difficult to solve the inventory-routing problem, because it is a NP hard problem. To find the optimal solution with polynomial time is very difficult. Many scholars have studied it for many years to find a good solving method. This paper analyzed the inventory-routing optimization problem. Then considered PSO has a good performance in solving combinatorial optimization problems. The PSO was improved to make it be suitable for solving discrete combination optimization problems. In order to improve the performance of the PSO algorithm to solve the inventory routing problem, this paper put forward dynamic adjustment of inertia weight and accelerator factor of the PSO, and introduced mutation operator in PSO. It is proved by numerical experiments that the proposed algorithm has certain performance advantages, and it also proves that the improved algorithm can improve the performance of the algorithm.

Keywords

Particle swarm optimization algorithm Inventory routing problem Inertia weight Accelerated factor 

Notes

Acknowledgments

The authors would like to thank the doctoral fund provided by NanTong university. This work is supported by the Natural science foundation of China (No. 61763019).

References

  1. 1.
    Anily, S., Bramel, J.: An asymptotic 98.5% effective lower bound on fixed partition policies for the inventory-routing problem. Discrete Appl. Math. 145(1), 22–39 (2004)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Anily, S., Federgruen, A.: One warehouse multiple retailer systems with vehicle routing costs. Manag. Sci. 36(1), 92–114 (1990)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Chan, L., Federgruen, A., Simchi-Levi, D.: Probabilistic analyses and practical algorithms for inventory-routing models. Oper. Res. Int. J. 46(1), 96–106 (1998)zbMATHGoogle Scholar
  4. 4.
    Rafie-Majd, Z., Pasandideh, S.H.R., Naderi, B.: Modelling and solving the integrated inventory-location-routing problem in a multi-period and multi-perishable product supply chain with uncertainty: lagrangian relaxation algorithm. Comput. Chem. Eng. 109, 9–22 (2017)CrossRefGoogle Scholar
  5. 5.
    Mjirda, A., Jarboui, B., Macedo, R., Hanafi, S., Mladenovic, N.: A two phase variable neighborhood search for the multi-product inventory routing problem. Comput. Oper. Res. 52, 291–299 (2014)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Li, K.P., Chen, B., Sivakumar, A.I., Wu, Y.: An inventory routing problem with the objective of travel time minimization. Eur. J. Oper. Res. 236, 936–945 (2014)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Tang, R.: Decentralizing and coevolving differential evolution for large-scale global optimization problems. Appl. Intell. 4, 1–16 (2017)Google Scholar
  8. 8.
    Ghasemishabankareh, B., Li, X., Ozlen, M.: Cooperative coevolutionary differential evolution with improved augmented Lagrangian to solve constrained optimisation problems. Inf. Sci. 369, 441–456 (2016)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Salman, A.A., Ahmad, I., Omran, M.G.H.: A metaheuristic algorithm to solve satellite broadcast scheduling problem. Inf. Sci. 322, 72–91 (2015)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Wang, Z., Wu, Z., Zhang, B.: Packet matching algorithm based on improving differential evolution. Wuhan Univ. J. Nat. Sci. 17(5), 447–453 (2012)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.College of Computer Science and TechnologyNantong UniversityNantongChina
  2. 2.School of Information Science and TechnologyJiujiang UniversityJiujiangChina

Personalised recommendations