Mar 5, 2010 · The purpose of this paper is to present a greedy algorithm. Computational results demonstrate that our greedy algorithm can solve large-scale WRND problems ...
In this paper, we study a warehouse-retailer network design (WRND) model that simultaneously makes the location, distribution, and warehouse-retailer ...
Computational results demonstrate that our greedy algorithm can solve large-scale WRND problems efficiently with errors within 3%--4% on average. Suggested ...
In this paper, we study a warehouse-retailer network design (WRND) model that simultaneously makes the location, distribution, and warehouse-retailer ...
This paper studies a warehouse-retailer network design (WRND) model that simultaneously makes the location, distribution, and warehouse-retailer echelon ...
The purpose of this paper is to present a greedy algorithm. Computational results demonstrate that our greedy algorithm can solve large-scale WRND problems ...
本文研究了仓库-零售商网络设计(WRND)模型，该模型可以同时进行选址、配送和仓库-零售商梯队的库存补充决策。虽然最近在文献中提出了一种列生成算法，但高效有效地解决这种 ...
People also ask
What is a greedy Heuristic?
What is the greedy strategy for algorithm design to solve optimization problems?
What is the difference between Heuristic algorithm and greedy algorithm?
Jia Shu: An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization. Transp. Sci. 44(2): 183-192 (2010). manage site settings.
An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization. In this paper, we study a warehouse-retailer network design (WRND) model ...
In this paper, we study the distribution network design problem integrating transportation and infinite horizon multiechelon inventory cost function.