Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees

Transportation companies that operate in seasonal markets where differences in demand occur in peak and nonpeak periods often negotiate for some form of demand smoothing with the customer i.e., the shipper. In this paper, we study a shipper's transportation procurement model, in which the shipp...

Full description

Saved in:
Bibliographic Details
Main Authors: LIM, Andrew, RODRIGUES, Brian, XU, Zhou
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2008
Subjects:
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/584
https://doi.org/10.1287/opre.1070.0481
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.lkcsb_research-1583
record_format dspace
spelling sg-smu-ink.lkcsb_research-15832016-03-11T16:04:14Z Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees LIM, Andrew RODRIGUES, Brian XU, Zhou Transportation companies that operate in seasonal markets where differences in demand occur in peak and nonpeak periods often negotiate for some form of demand smoothing with the customer i.e., the shipper. In this paper, we study a shipper's transportation procurement model, in which the shipper gives assurances, through volume guarantees negotiated with the transportation companies, that shipments made in nonpeak periods will be commensurate with shipments in peak periods. The shipper uses the model in an auction process, in which the transportation companies bid for routes giving prices and capacity limits, to procure freight services from the companies, which minimizes its total transportation costs. The model is formulated as an integer programming problem that is shown to be strongly NP-hard even for a single-route network. We develop a solution approach that builds on the solution of the subproblem when only one transportation company is available to construct heuristic algorithms, including a linear programming relaxation-based method. Worst-case analysis is given, and the effectiveness of the algorithms is tested in numerical experimentation. By examining parameter sensitivity, insight is provided on how the algorithms can be used by the shipper for making procurement decisions. The practical usefulness of the model and the solution approaches is substantiated by its deployment with a multinational shipper. [PUBLICATION ABSTRACT] 2008-06-01T07:00:00Z text https://ink.library.smu.edu.sg/lkcsb_research/584 info:doi/10.1287/opre.1070.0481 https://doi.org/10.1287/opre.1070.0481 Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University transportation models assignment transportation allocation programming integer applications large-scale integer optimization industrial transportation/shipping transportation procurement optimization Operations and Supply Chain Management
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic transportation
models
assignment
transportation allocation
programming
integer applications
large-scale integer optimization
industrial
transportation/shipping
transportation procurement optimization
Operations and Supply Chain Management
spellingShingle transportation
models
assignment
transportation allocation
programming
integer applications
large-scale integer optimization
industrial
transportation/shipping
transportation procurement optimization
Operations and Supply Chain Management
LIM, Andrew
RODRIGUES, Brian
XU, Zhou
Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees
description Transportation companies that operate in seasonal markets where differences in demand occur in peak and nonpeak periods often negotiate for some form of demand smoothing with the customer i.e., the shipper. In this paper, we study a shipper's transportation procurement model, in which the shipper gives assurances, through volume guarantees negotiated with the transportation companies, that shipments made in nonpeak periods will be commensurate with shipments in peak periods. The shipper uses the model in an auction process, in which the transportation companies bid for routes giving prices and capacity limits, to procure freight services from the companies, which minimizes its total transportation costs. The model is formulated as an integer programming problem that is shown to be strongly NP-hard even for a single-route network. We develop a solution approach that builds on the solution of the subproblem when only one transportation company is available to construct heuristic algorithms, including a linear programming relaxation-based method. Worst-case analysis is given, and the effectiveness of the algorithms is tested in numerical experimentation. By examining parameter sensitivity, insight is provided on how the algorithms can be used by the shipper for making procurement decisions. The practical usefulness of the model and the solution approaches is substantiated by its deployment with a multinational shipper. [PUBLICATION ABSTRACT]
format text
author LIM, Andrew
RODRIGUES, Brian
XU, Zhou
author_facet LIM, Andrew
RODRIGUES, Brian
XU, Zhou
author_sort LIM, Andrew
title Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees
title_short Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees
title_full Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees
title_fullStr Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees
title_full_unstemmed Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees
title_sort transportation procurement with seasonally varying shipper demand and volume guarantees
publisher Institutional Knowledge at Singapore Management University
publishDate 2008
url https://ink.library.smu.edu.sg/lkcsb_research/584
https://doi.org/10.1287/opre.1070.0481
_version_ 1770569631462850560