Multi-objective optimization for location-routing-inventory problem in cold chain logistics network with soft time window constraint

13Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

Abstract

With the improvement of enterprise services, location-routing-inventory problem with time window constraint (LRIPTW) has become an essential problem in cold chain logistics network (CCLN). This paper aims to optimize the location cost, inventory cost, transportation cost, and penalty cost in CCLN simultaneously. Firstly, an optimization model was established for the LRIP with soft time window constraint (STW). Then, the multi-objective ant colony optimization (MACO) was improved to solve the model. Simulation results show that the improved MACO can solve the LRIPSTW effectively and efficiently. The research findings provide a reference for enterprises to reduce total cost and improve service quality.

Cite

CITATION STYLE

APA

Li, K., Li, D., & Wu, D. (2020). Multi-objective optimization for location-routing-inventory problem in cold chain logistics network with soft time window constraint. Journal Europeen Des Systemes Automatises, 53(6), 803–809. https://doi.org/10.18280/jesa.530606

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