Two-stage inventory models with a bi-modal transportation cost

B. Q. Rieksts; José A. Ventura

doi:10.1016/j.cor.2009.02.026

Two-stage inventory models with a bi-modal transportation cost

B. Q. Rieksts, José A. Ventura

Marcus Department of Industrial and Manufacturing Engineering

Research output: Contribution to journal › Article › peer-review

23 Scopus citations

Abstract

This paper discusses inventory models over an infinite planning horizon with constant demand rate and two modes of transportation. These transportation options include truckloads and a less than truckload carrier. An optimal algorithm is derived for a one-warehouse one-retailer system. A power-of-two heuristic algorithm is also proposed for a one-warehouse multi-retailer system. Computational results are provided to show that, on the average, the heuristic algorithm is at least 94% effective.

Original language	English (US)
Pages (from-to)	20-31
Number of pages	12
Journal	Computers and Operations Research
Volume	37
Issue number	1
DOIs	https://doi.org/10.1016/j.cor.2009.02.026
State	Published - Jan 1 2010

All Science Journal Classification (ASJC) codes

General Computer Science
Modeling and Simulation
Management Science and Operations Research

Access to Document

10.1016/j.cor.2009.02.026

Cite this

@article{bbc90564d6c14302a01171b5c1223d63,

title = "Two-stage inventory models with a bi-modal transportation cost",

abstract = "This paper discusses inventory models over an infinite planning horizon with constant demand rate and two modes of transportation. These transportation options include truckloads and a less than truckload carrier. An optimal algorithm is derived for a one-warehouse one-retailer system. A power-of-two heuristic algorithm is also proposed for a one-warehouse multi-retailer system. Computational results are provided to show that, on the average, the heuristic algorithm is at least 94% effective.",

author = "Rieksts, {B. Q.} and Ventura, {Jos{\'e} A.}",

year = "2010",

month = jan,

day = "1",

doi = "10.1016/j.cor.2009.02.026",

language = "English (US)",

volume = "37",

pages = "20--31",

journal = "Computers and Operations Research",

issn = "0305-0548",

number = "1",

}

TY - JOUR

T1 - Two-stage inventory models with a bi-modal transportation cost

AU - Rieksts, B. Q.

AU - Ventura, José A.

PY - 2010/1/1

Y1 - 2010/1/1

N2 - This paper discusses inventory models over an infinite planning horizon with constant demand rate and two modes of transportation. These transportation options include truckloads and a less than truckload carrier. An optimal algorithm is derived for a one-warehouse one-retailer system. A power-of-two heuristic algorithm is also proposed for a one-warehouse multi-retailer system. Computational results are provided to show that, on the average, the heuristic algorithm is at least 94% effective.

AB - This paper discusses inventory models over an infinite planning horizon with constant demand rate and two modes of transportation. These transportation options include truckloads and a less than truckload carrier. An optimal algorithm is derived for a one-warehouse one-retailer system. A power-of-two heuristic algorithm is also proposed for a one-warehouse multi-retailer system. Computational results are provided to show that, on the average, the heuristic algorithm is at least 94% effective.

UR - http://www.scopus.com/inward/record.url?scp=68249096944&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=68249096944&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2009.02.026

DO - 10.1016/j.cor.2009.02.026

M3 - Article

AN - SCOPUS:68249096944

SN - 0305-0548

VL - 37

SP - 20

EP - 31

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 1

ER -

Two-stage inventory models with a bi-modal transportation cost

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this