
doi: 10.1155/2018/2726070
Facility location, inventory management, and vehicle routing are three important decisions in supply chain management, and location‐inventory‐routing problems consider them jointly to improve the performance and efficiency of today’s supply chain networks. In this paper, we study a location‐inventory‐routing problem to minimize the total cost in a closed‐loop supply chain that has forward and reverse logistics flows. First, we formulate this problem as a nonlinear integer programming model to optimize facility location, inventory control, and vehicle routing decisions simultaneously in such a system. Second, we develop a novel heuristic approach that incorporates simulated annealing into adaptive genetic algorithm to solve the model efficiently. Last, numerical analysis is presented to validate our solution approach, and it also provides meaningful managerial insight into how to improve the closed‐loop supply chain under study.
Discrete location and assignment, Nonlinear programming, Electronic computers. Computer science, Integer programming, QA75.5-76.95, Inventory, storage, reservoirs
Discrete location and assignment, Nonlinear programming, Electronic computers. Computer science, Integer programming, QA75.5-76.95, Inventory, storage, reservoirs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 28 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
