Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Two heuristic algorithms for location-inventory-routing models involving two warehouses within multi-echelon supply chain networks
by
Dai, Zhuo
, Giri, Bibhas Chandra
, Zhou, Yefu
in
639/166
/ 639/705
/ Algorithms
/ Deadlines
/ Distribution centers
/ Heuristic
/ Humanities and Social Sciences
/ Inventory
/ Inventory control
/ LIRPs
/ multidisciplinary
/ Retail stores
/ Science
/ Science (multidisciplinary)
/ Sensitivity analysis
/ Supply chain network
/ Supply chains
/ Two heuristic algorithms
/ Two warehouses
/ Vehicles
2025
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Two heuristic algorithms for location-inventory-routing models involving two warehouses within multi-echelon supply chain networks
by
Dai, Zhuo
, Giri, Bibhas Chandra
, Zhou, Yefu
in
639/166
/ 639/705
/ Algorithms
/ Deadlines
/ Distribution centers
/ Heuristic
/ Humanities and Social Sciences
/ Inventory
/ Inventory control
/ LIRPs
/ multidisciplinary
/ Retail stores
/ Science
/ Science (multidisciplinary)
/ Sensitivity analysis
/ Supply chain network
/ Supply chains
/ Two heuristic algorithms
/ Two warehouses
/ Vehicles
2025
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Two heuristic algorithms for location-inventory-routing models involving two warehouses within multi-echelon supply chain networks
by
Dai, Zhuo
, Giri, Bibhas Chandra
, Zhou, Yefu
in
639/166
/ 639/705
/ Algorithms
/ Deadlines
/ Distribution centers
/ Heuristic
/ Humanities and Social Sciences
/ Inventory
/ Inventory control
/ LIRPs
/ multidisciplinary
/ Retail stores
/ Science
/ Science (multidisciplinary)
/ Sensitivity analysis
/ Supply chain network
/ Supply chains
/ Two heuristic algorithms
/ Two warehouses
/ Vehicles
2025
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Two heuristic algorithms for location-inventory-routing models involving two warehouses within multi-echelon supply chain networks
Journal Article
Two heuristic algorithms for location-inventory-routing models involving two warehouses within multi-echelon supply chain networks
2025
Request Book From Autostore
and Choose the Collection Method
Overview
In supply chain management, the location of facilities, inventory control, and vehicle routing are three key components. This paper incorporates a two-warehouse inventory system into the location- inventory-routing problems (LIRPs) and develops LIRP models with two warehouses in one-level, two-level, and three-level supply chain networks. This study aims to minimize the average total costs of the models by reducing their average costs. To handle these models, two innovative hybrid algorithms, viz. Clarke and Wright—genetic algorithm (CW-GA) and Clarke and Wright—firefly algorithm (CW-FA) are put forward. Computational experiments and sensitivity analyses are conducted to compare the proposed two algorithms with Baron and test the algorithms’ effectiveness and the models’ feasibility. The management implications of this study are presented from two dimensions: model and method. Finally, future research directions and the gap between models and reality are discussed.
Publisher
Nature Publishing Group UK,Nature Publishing Group,Nature Portfolio
Subject
This website uses cookies to ensure you get the best experience on our website.