To read this content please select one of the options below:

Near‐optimal heuristics and managerial insights for the storage constrained, inbound inventory routing problem

Malini Natarajarathinam (Industrial Distribution Program, Texas A&M University, College Station, Texas, USA)
Jennifer Stacey (Operations Management Program, University of Alabama, Tuscaloosa, Alabama, USA)
Charles Sox (Operations Management Program, University of Alabama, Tuscaloosa, Alabama, USA)

International Journal of Physical Distribution & Logistics Management

ISSN: 0960-0035

Article publication date: 9 March 2012

1400

Abstract

Purpose

The purpose of this paper is to develop efficient heuristics for determining the route design and inventory management of inbound parts which are delivered for manufacturing, assembly, or distribution operations and for which there is limited storage space. The shipment frequencies and quantities are coordinated with the available storage space and the vehicle capacities.

Design/methodology/approach

Two heuristics that generate near optimal solutions are proposed. The first heuristic has an iterative routing phase that maximizes the savings realized by grouping suppliers together into routes without considering the storage constraint and then calculates the pickup frequencies in the second phase to accommodate the storage constraint. The second heuristic iteratively executes a routing and a pickup frequency phase that both account for the storage constraint. A lower bound is also developed as a benchmark for the heuristic solutions.

Findings

Near optimal solutions can be obtained in a reasonable amount of time by utilizing information about the amount of storage space in the route design process.

Practical implications

The traditional emphasis on high vehicle utilization in transportation management can lead to inefficient logistics operations by carrying excess inventory or by using longer, less efficient routes. Route formation and pickup quantities at the suppliers are simultaneously considered, as both are important from a logistics standpoint and are interrelated decisions.

Originality/value

The two proposed heuristics dynamically define seed sets such that the solutions to the capacitated concentrator location problem (CCLP) are accurately estimated. This increased accuracy helps in generating near‐optimal solutions in a practical amount of computing time.

Keywords

Citation

Natarajarathinam, M., Stacey, J. and Sox, C. (2012), "Near‐optimal heuristics and managerial insights for the storage constrained, inbound inventory routing problem", International Journal of Physical Distribution & Logistics Management, Vol. 42 No. 2, pp. 152-173. https://doi.org/10.1108/09600031211219663

Publisher

:

Emerald Group Publishing Limited

Copyright © 2012, Emerald Group Publishing Limited

Related articles