An extended PSO algorithm for cold-chain vehicle routing problem with independent loading and minimum fuel volume

5Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

With the increasing complexity of the distribution environment, customers usually propose higher requirements, such as independent loading of local and foreign cold-chain items in the event of an emergency. Moreover, minimum fuel volume plays an important role in the process of transportation with different speeds and different kinds of vehicles. In this paper, we present a new mathematical model to characterize cold-chain vehicle routing optimization with independent loading of local and foreign items and minimum fuel volume. To address the above mathematical model, an extended particle swarm optimization (PSO) algorithm is proposed by combining original PSO with 2-opt optimization to improve diversity and reduce convergence speed. Six sets of experiments are set to verify the practical performance and stability of the extended PSO algorithm based on three standard datasets of C201, R201, and RC201 from Solomon.

Cite

CITATION STYLE

APA

Xu, S., Zong, J., Liu, L., Yang, W., & Xu, L. (2024). An extended PSO algorithm for cold-chain vehicle routing problem with independent loading and minimum fuel volume. International Journal of Industrial Engineering Computations, 15(2), 415–426. https://doi.org/10.5267/j.ijiec.2024.2.001

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