4.5 Article

An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization

Journal

TRANSPORTATION SCIENCE
Volume 44, Issue 2, Pages 183-192

Publisher

INFORMS
DOI: 10.1287/trsc.1090.0302

Keywords

facility location; distribution network design; multiechelon inventory management, greedy algorithm

Funding

  1. National Natural Science Foundation of China [70801014]
  2. Program for New Century Excellent Talents in University of China [NCET-09-0292]
  3. Scientific Research Foundation for the Returned Overseas Chinese Scholars
  4. State Education Ministry, China
  5. Southeast University

Ask authors/readers for more resources

In this paper, we study a warehouse-retailer network design (WRND) model that simultaneously makes the location, distribution, and warehouse-retailer echelon inventory replenishment decisions. Although a column generation algorithm was proposed recently in the literature, it remains a challenge to solve large size instances of this NP-hard problem efficiently and effectively. The purpose of this paper is to present a greedy algorithm. Computational results demonstrate that our greedy algorithm can solve large-scale WRND problems efficiently with errors within 3%-4% on average.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available