Journal
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
Volume 70, Issue -, Pages 305-323Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2014.07.010
Keywords
Supply chain; Inventory location routing; Inventory-routing problem; Location-routing problem; Metaheuristic; Simulated annealing
Categories
Funding
- National Natural Science Foundation of China [71272030]
- Science & Technology Foundation of Shenzhen City [CXZZ20130321145336439]
Ask authors/readers for more resources
This paper considers a supply chain network with multiple depots and geographically dispersed customers, each of which faces non-constant demand over a discrete planning horizon. The goal is to determine a set of depots to open, the delivery quantities to customers per period and the sequence in which they are replenished by a vehicle fleet such that the total system-wide cost is minimized. To solve it, first we construct a mixed integer program, and then propose a hybrid metaheuristic consisting of initialization, intensification and post-optimization. Results show that the proposed heuristic is considerably efficient and effective for many classical instances. (C) 2014 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available