Advertisement

A heuristic method for the combined location routing and inventory problem

  • S.C. LiuEmail author
  • C.C. Lin
Original Article

Abstract

The combined location routing and inventory problem (CLRIP) is used to allocate depots from several potential locations, to schedule vehicles’ routes to meet customers’ demands, and to determine the inventory policy based on the information of customers’ demands, in order to minimize the total system cost. Since finding the optimal solution(s) for this problem is a nonpolynomial (NP) problem, several heuristics for searching local optima have been proposed. However, the solutions for these heuristics are trapped in local optima. Global search heuristic methods, such as tabu search, simulated annealing method, etc., have been known for overcoming the combinatorial problems such as CLRIP, etc. In this paper, the CLRIP is decomposed into two subproblems: depot location-allocation problem, and routing and inventory problem. A heuristic method is proposed to find solutions for CLRIP. First of all, an initial solution for CLRIP is determined. Then a hybrid heuristic combining tabu search with simulated annealing sharing the same tabu list is used to improve the initial solution for each subproblem separately and alternatively. The proposed heuristic method is tested and evaluated via simulation. The results show the proposed heuristic method is better than the existing methods and global search heuristic methods in terms of average system cost.

Keywords

Combined location routing and inventory problem (CLRIP) Global search heuristic method Heuristic method  Hybrid heuristic NP problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Viswanathan S, Mathur K (1997) Integrated routing and inventory decisions in one-warehouse multiretailer multiproduct distribution system. Manage Sci 43:294–312Google Scholar
  2. 2.
    Hall RH (1987) Consolidation strategy: inventory, vehicle and terminals. J Bus Logist 8:57–73Google Scholar
  3. 3.
    Liu SC, Lee SB (2003) A two-phase heuristic method for the multi-depot location routing problem taking inventory control decision into considerations. Int J Adv Manuf Technol, in pressGoogle Scholar
  4. 4.
    Wu TH, Low C, Bai JW (2002) Heuristic solutions to multi-depot location-routing problems. Comput Oper Res 29:1393–1415CrossRefGoogle Scholar
  5. 5.
    Tan KC, Lee LH, Ou K (2001) Artificial intelligence heuristics in solving vehicle routing problems with time window constraints. Eng Appl Artif Intell 14:825–837CrossRefGoogle Scholar
  6. 6.
    Renaud J, Laporte G, Boctor FF (1996) A tabu search heuristic for the multi-depot vehicle routing problem. Comput Oper Res 23:229–235CrossRefGoogle Scholar
  7. 7.
    Tuzun D, Burke LI (1999) A two-phase tabu search approach to the location routing problem. Eur J Oper Res 166: 87–99CrossRefGoogle Scholar
  8. 8.
    Glover B (1977) A statistical approach to the TSP. Networks 7:205–229Google Scholar
  9. 9.
    Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:167–175Google Scholar
  10. 10.
    Skiscim CC, Golden BL (1983) Optimization by simulated annealing: a preliminary computational study for the TSP. Winter Simulation Conference, 1983Google Scholar
  11. 11.
    Tan KC, Lee LH, Zhu QL, Ou K (2001) Heuristics methods for vehicle routing problems with time windows. Artif Intell Eng 15:281–295CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2004

Authors and Affiliations

  1. 1.Department of Management Information SystemsNational Pingtung University of Science and TechnologyPingtungTaiwan

Personalised recommendations