ArticlePDF Available

Abstract and Figures

This study was conducted to review the literature on full truckload (FTL) transportation service procurement and to identify the gaps from the perspectives of researchers and practitioners. FTL procurement in particular was reviewed because it is encountered more than others forms of procurement in freight movement, and it involves numerous challenges. A framework was developed to provide a systematic review of the literature, the findings of which are discussed in detail. Some key findings include the simplistic assumption of demand patterns, limited focus on non-price variables, a limited number of case studies, less consideration of sustainability aspects, and a lack of detailed studies on emerging economies.
Content may be subject to copyright.
1
Review of Full Truck Load (TL) Transportation Service Procurement
Jothi Basu Ramanatan1, Nachiappan Subramanian2, Naoufel Cheikhrouhou3
1Sethu Institute of Technology, India
2University of Nottingham, Ningbo Campus
3University of Applied Sciences Western Switzerland, Geneva School of Business
Administration
Abstract
The aim of this work is to review the literature on full truck load transportation service
procurement and identify the gaps from the points of view of researchers and practitioners.
Full truck load procurement is particularly considered for review since it is encountered more
in freight movement than others forms and also it has many challenges. A framework is
developed to have a systematic review of literature and the findings are discussed in detail.
Some key findings include the simplistic assumption of demand pattern, less focus on non-
price variables, a limited number of case studies, a lesser consideration of sustainability
aspects and the lack of detailed studies on emerging economies.
Keywords Transportation service; full truck load; procurement; review
1. Introduction
Outsourcing logistical activities have become common in various industries. Mostly
companies (shippers) try to establish long term service agreements with the logistics service
providers (carriers) in the form of two or three year contracts, known as contract logistics.
Growth of contract logistics is tremendous across the world, according to the report of
Transportation Intelligence (2012). The region wise global logistics market is estimated at
42.6% in Asia Pacific, 18% in Western Europe, 17.7% in USA and 21.8% in rest of the
world. The global logistic market worth 1216 Billion USD and the contract logistics market
accounts to 15.7% (TI Global Contract Logistics 2012). Country wise contract logistic market
is detailed in the table 1.
________________________
Insert Table 1 about here
________________________
2
The growth of contract logistics is promising and, at the same time, presents several
challenges. According to the survey conducted by the American Transportation Research
Institute (2011), several issues identified as critical are ranked in Table 2.
________________________
Insert Table 2 about here
________________________
Four out of five top critical issues (economy, hours of service, drivers shortage and fuel
price) are related to operational efficiency. The others are related to safety, congestion,
finance, infrastructure and technology. According to Rajagopal (2009) the operational
inefficiency is the universal concern and it has to be improved. On the operational efficiency
front, the contract logistics purely depends on the economic situation of the country and that
has a huge impact upon the customer demand as well as the freight demand. The hours of
service refer to the drivers working hours that have to be regulated in order to minimize the
driver’s fatigue. The pragmatic issue for the logistics service provider is the availability of
qualified drivers. This will become one of the important problems in the trucking industry in
the next decade (American Transportation Research Institute 2011). Accordingly, there is an
urgent need to develop methods for improving the quality of life of the drivers so that they
will remain in this industry. Studies relevant to environmental sustainability measures like
clean truck program and its associated health benefits (Lee et al. 2012; Sathaye et al. 2010 ;
Konur 2014) are found in the literature, but it is limited.
Other than the operational efficiency front issues, the study by Huang and Lin (2010) points
out few more external issues that would force the carriers to increase their efficiency, such as
the rising cost of energy, the infrastructural bottlenecks, the restrictive legal regulations and
the tough competition within the transportation sector. Apart from the above, it has been
proved that the political environment (Zvirblis and Zinkeviciute 2008) and compatible
operating systems have a huge impact on the performance of the transportation service
provider (Punakivi and Hinkka 2006).
Besides the overall macro level challenges in contract logistics industry, it is also interesting
to notice micro level challenges within trucking industry from the shipper and carrier
perspectives (Inbound Logistics 2011; Zhang and Figliozzi 2010). These micro level
3
challenges based on the empirical survey conducted by Reilly (2011) among motor freight
carriers and shippers and the details are shown in Table 3.
________________________
Insert Table 3 about here
_________________________
Usually, Shipper level expectation is to obtain high quality service with low cost, whereas
carriers’ challenges are oriented towards operating at low cost abiding by various regulations.
There is a compulsion for carriers to improve the operational efficiency. Also, it is to be
noted that the degree of impact of the above mentioned challenges will vary with regional
context. This paper aims to review the literature in transportation service procurement for a
decade, i.e. from 2000 until 2013 to depict how far researchers have considered the various
factors mentioned in the framework and to understand the current status of research with
respect to each criteria. Most of contract logistics will ship the consignment as FTL. Hence,
the paper only focuses on the full truckload (FTL) procurement process in contract logistics
because its presence is more than any other transportation modes (Langenfeld et al. 2007). It
is evident from table 4 that the volume of full truckload transport percentage is substantially
higher than other modes of transport in various countries. The transportation service
procurement process includes both bundled and unbundled purchases. Bundled procurement
refers to purchase of service that includes total shipment comprising of freight transport,
warehousing, customs clearance etc. Whereas unbundled purchases refers to pure freight
transport. This paper considers unbundled freight transport service procurement because it is
very hard to distinguish from the previous studies whether the procurement is bundled or
unbundled. From the practitioner point of view, truck load transportation service
procurement is an important activity because it has tremendous impact on the overall cost of
business. In addition to the above recent study by Doll et al (2014) endorses the importance
of transport service procurement and stated that the procurement contract decision has to be
based on shorter product cycle time. Moreover turbulent factors such as oil prices, economic
crises and environmental regulations imposed in various regions compels shippers and
carriers to workout a suitable transportation service procurement contract to tackle the
uncertainty. Considering the volume of FTL, FTL’s impact on businesses, decision on FTL’s
contract length based on product cycle time and influence of turbulent factors on FTL
agreement between shippers and carriers motivates us to relook the previous studies to
4
understand the FTL service procurement evolution over time and to identify potential
research gaps.
________________________
Insert Table 4 about here
_________________________
This work develops a framework to critically understand the inclusion of various challenges
in the procurement process by researchers through various scholarly databases (Business
source premier, ProQuest, MetaPress, Scopus, Emerald, Springer, Taylor & Francis, Informs,
Ingenta, and Indersceince). As a matter of context in the field of study, Bontekoning et al.
(2004) publish a review article discussing the inter-modal rail-truck transportation literature
published between 1977 and 2001. They propose an inter-modal research agenda and derive
insights to improve efficiency, profitability and level of competitiveness of intermodal
transportation. With regards to the challenges reported in Table 3, the focus has shifted
during the last decade. The need to address research works that have helped to solve the
critical problems identified becomes then clear.
The major contributions of the paper are as follows. This review paper is the first one
addressing the area of full truck load transportation service procurement. It reveals the
research gaps in transportation service procurement with respect to criteria presented in the
proposed framework. Moreover, this systematic review also emphasise the need to address
sustainability aspects and economic regulations in the process of full truck load transportation
service procurement.
The remaining part of the paper is structured as follows. The transportation service
procurement issue is discussed in section 2. The framework for review is provided in section
3. The literature as per the framework is reviewed and discussed in section 4. Section 5
summarizes the key research finding and gaps. Finally, the paper concludes with future scope
of research in transportation service procurement in section 6.
2. Procurement of transportation service
Truck load procurement process starts with call for quotation, which is initiated by the
shipper, followed by bidding (bid generation) by various carriers who are interested in the
offer. Carriers may then either bid for each lane individually or as a package bid called
5
combinatorial bids. After receiving bids from various carriers, the shipper’s job is to evaluate
the submitted bids and find out the winning bids (carrier assignment). Major research work is
carried out with respect to both the bid generation and carrier assignment aspects. Various
types of procedures adopted for transportation service procurement auction are given in detail
in appendix.
3. Framework for review
This paper classifies the literature in full truckload transportation procurement published
from 2000 up to 2013 based on the framework shown in figure 5. Two common methods
used for conceptual classification are taxonomies and topologies (Autry et al. 2008). This
framework is based on the taxonomy proposed by Carter and Jennings (2002) in logistics
social responsibility (LSR). In general, transportation service can be either procured on spot
market (one-time procurement) or on the contract market if there is a long-term agreement to
move the loads. Contract market includes FTL and less than truckload (LTL). Also, a recent
study discusses the shipment size and selection of corresponding truck size in each lane
(Abate et al. 2014).
______________________________
Insert Figure 1 about here
_______________________________
In FTL transportation, the truck moves directly from the origin to the destination without
visiting any intermediate locations, whereas the LTL carriers require the use of terminals and
scheduled routes to collect smaller shipments and consolidate them into larger loads. Out of
the two, FTL’s contribution to the contract market is higher than LTL (Tsai et al. 2009). It is
important to note that the freight rates of LTL are generally higher than that of FTL. But,
FTL freight transportation market of US is 524 Billion USD which accounts for 75.4% of the
total freight transportation market. On the other hand, LTL contributes to only 40 Billion
USD with the market share of 5.8%. (American Trucking Associations, 2010) Similarly, in
European Union, FTL is 72 Billion USD market where as LTL volumes 32 Billion USD (The
Statistics Portal). FTL procurement process has two major modelling issues such as bid
generation problem (BGP) and carrier assignment problem (CAP). BGP is to be solved by the
carrier (bidder) with the general objective of maximizing the profit. In this stage, the carriers
6
have to decide on the lanes they have to bid for and on their rate. This leads to the complex
combinatorial optimisation problem.
The problem of Carrier Assignment consists of finding the optimal allocation of lanes to the
bidders that minimizes cost. It is a NP-hard problem (Rothkopf et al. 1998) in which the
magnitude of difficulty increases according to the number of lanes to be assigned. Both
shippers and carriers in trucking industry wish to operate efficiently (Ergun et al. 2007). This
can be achieved either by collaboration between shippers or among carriers. In shipper
collaboration setting, shippers can identify collaborative routes with reduced empty-haul
movements. Similarly, carriers collaborate with each other depending upon their regional
network so that empty haul movement can be reduced.
The demand of loads to be moved in each lane by the carrier is normally assumed as constant
in most of the literature. In practice, seasonal and stochastic demand is frequently
encountered. The objective of the problem (for both BGP and CAP) is generally cost oriented
although there are some other non-financial objectives that are mentioned by Sheffi (2004),
such as on-time performance (both transportation time and response time), familiarity with
the shipper’s operations, availability of the right equipment, carriers’ non-transportation
activities (such as collecting payments and delivery beyond the receiving dock), and pick-up
performance.
4. Review of the literature
The literature in FTL transportation service procurement is reviewed based on the framework
shown in the figure 5. The criteria considered by researchers as per the framework are shown
in Table 5.
4.1. Type of the problem
As far as literature on Truckload procurement is concerned, the focus is mainly on either
BGP or CAP. Some of the authors discussed the collaboration, either at the shipper level or
among carriers.
4.1.1 Bid Generation Problem (BGP)
7
BGP is a problem handled by the bidder, namely the carrier. In the case of individual lane
bidding, setting the bid price for a particular lane is simple since it depends upon the existing
lane coverage in the region. If there is an economy of scope, then bid price is competitive. In
recent times, the use of combinatorial bidding is very popular because it can overcome the
exposure problem. In combinatorial auction, shipper request carriers to bid in the form of lane
packages. The carriers form their packages based on their own economics, their existing
client base, their driver’s domiciles, and their underlying maintenance networks (Sheffi
2004). In this setting, the carrier’s major goal is to identify and take advantage of
interdependencies in their transportation operations, and to determine the optimal utility
maximizing the packages to bid for. As it is a non-linear integer programming and NP-hard
problem (Lee et al. 2007), the problem has had reasonable attention among researchers and
the contribution other researchers in this area is discussed in detail.
Lee et al. (2007) develop a model that integrates route (package) generation and selection
simultaneously and present a column generation approach to solve the underlying non-linear
quadratic integer programming problem. The model represents a utility maximizing decision
problem that carriers can use to determine the best packages for bidding in a combinatorial
auction. The model trades off revenue from servicing a set of lanes and repositioning cost.
The algorithms for the carrier model can handle scenarios involving hundreds of lanes. Song
and Regan (2005) examine computationally tractable approximation methods for estimating
bid values and constructing bids. The benefit of the approximation method is that it provides
a way for carriers to identify their real costs and construct optimal or near optimal bids by
solving a single NP-hard problem. This represents a significant improvement in the
computational efficiency. The method is evaluated both analytically and using simulation.
The bidder’s optimality criterion of a combinatorial bid is addressed by Wang and Xia (2005)
who use the bundling method to solve the problem. This heuristic is comparable with a
simple nearest insertion method. Simulation results show that the former outperforms the
latter in most cases. Chang (2009) aims to develop a bidding advisor to help truckload (TL)
carriers to overcome such challenging problems in one-shot combinatorial auctions. Their
proposed advisor integrates the load information in e-marketplaces with carriers’ current fleet
management plans, and then chooses the desirable load bundles. They formulate it as a
synergetic minimum cost flow problem by estimating the average synergy values between
loads and attempt to solve it through approximation method.
8
4.1.2 Carrier Assignment Problem (CAP)
This problem encounters the bid analysis stage of transportation procurement process, which
is NP-complete problem (Sandholm 2002). A Carrier Assignment Problem (CAP) aims to
minimize the shipper’s total costs, while ensuring that each lane is served and its required
capacity is satisfied. In (Guo et al. 2006), the objective is to solve the winner determination
auctions for transportation procurement to include shipper non-financial objectives and
carrier transit point costs. The model includes penalty and transit point costs. The
optimisation process uses Branch and Bound (B&B), Genetic Algorithm (GA), Tabu Search
(TS) and combination of Genetic Algorithm and Tabu Search (GA+TS) for the new model.
Computational experimentation shows that Meta-heuristics perform well for small size
problems but do not guarantee good performance for large size problems. As far as
computational time is concerned, branch and bound requires considerably more time than
Meta-heuristics. Among Meta-heuristics, performance and computational time is better for
TS and GA + TS than GA.
Yadati et al. (2007) consider the case in which the suppliers provide a quantity-discount
function of prices, instead of a single bid. The winner determination problem in this case is
NP-hard since this is a generalization of the normal bidding process. They develop
mathematical programming formulations for winner determination that are applicable to
hybrid procurement mechanisms. They present a heuristic solution scheme, where solutions
are constructed in a greedy manner.
Ma et al. (2010) propose a two-stage stochastic integer programming model for the CAP in
combinatorial auctions to hedge the shipper’s risk under shipment uncertainty. In addition,
many other important comprehensive business side constraints are included in the model.
Computational results indicate that moderately sized realistic instances can be solved by
branch and bound method using commercial solvers in reasonable time. Tian et al. (2011)
propose mixed integer programming and heuristic methods to solve CAP in combinatorial
auction setting. In the winner determination problem, Rekik et al. (2012) propose to consider
the reputation of carriers. Allocation of lanes is based on both bidding price and reputation of
the carrier.
9
4.1.3 Collaboration
Carriers constantly seek ways to reduce operating costs as substantial fraction of a truckload
carrier’s operating costs comes from the repositioning movements of its trucks (no revenue is
generated as the truck moves empty, but costs are incurred). Consequently, minimizing
repositioning movements of trucks is one of the primary objectives of dispatching truckload
carriers (Kuyzu 2007). By collaboration, empty movement of trucks can be minimized by
forming cycles, thus carriers costs are reduced. A portion of the carrier's cost saving is shared
with the shipper in the form of lower price for freight movement (Verdonck et al 2013).
Ergun et al. (2007) discuss the optimization- based techniques used in the identification of
repeatable, dedicated truckload continuous move tours with little truck repositioning. Ozener
and Ergun (2008) develop cost-allocation mechanisms using cooperative game theory. They
define a set of new properties, such as a guaranteed discount from the standalone cost for
each shipper, and propose several cost-allocation schemes that could lead to implementable
solutions. A computational study on randomly generated and real-life data is performed to
derive insights on the performance of the allocation schemes developed. Berger and
Bierwirth (2010) consider a network of collaborating freight carrier companies that provide
an equivalent transport service in their regional areas. They propose a framework for post
market based optimization to improve the network profit. A Lane exchange mechanism is
proposed by Ozener et al. (2011) for truckload carrier collaboration, which differs from
others in terms of information sharing requirements. Gujo and Schwind (2008) and Schwind
et al. (2009) propose a Combinatorial Exchange (comEx) mechanism for collaboration.
Schwind et al. (2009) present ComEx system for auction based exchange of delivery routes
among profit centres. Gujo and Schwind (2008) propose ComEx for exchanging the delivery
contracts. They adopted this study in medium sized food delivering industries organized in
profit centre structures.
_______________________________
Insert Table 5 about here
________________________________
4.2. Problem Objectives
4.2.1 Cost objective
10
In BGP, the objective is to maximize the profit (Berger and Bierwirth 2010; Chang 2009; Lee
et al. 2007; Song and Regan 2005; Song and Regan 2003; Wang and Xia 2005). In the case of
CAP, the objective is minimizing the transportation cost (Caplice and Sheffi 2003; Caplice
2007; Cohn et al. 2008; Lim et al. 2008; Ma et al. 2010; Srivastava et al. 2008; Yadati et al.
2007).
The general formulation of the optimisation problem for BGP is as follows.
Maximize
jjj zaR
Where,
R - Revenue generated by serving the lanes
aj Asked price for serving lane ‘j’
zj Decision variable.
Berger and Bierwirth (2010) aim to maximize the total profit of Collaborative Carrier
Network (CCN). The objective of minimizing the net total cost is considered in Chang
(2009). Lee et al. (2007) solve the BGP with the objective of maximizing the profit. They
make use of decomposition strategy to reduce the complexity of the problem. A bid
construction problem with the objective of minimizing the empty movement cost is dealt by
Song and Regan (2005). Wang and Xia (2005) formulate the BGP with the objective of
minimizing the distance covered to reduce the transportation cost.
Similarly, the objective of CAP takes the form
Minimize
i j ijij xbC
Where,
C - Total transportation cost spend by the shipper
bij - Bid value of the carrier ‘i’ for serving the lane ‘j’
xij Decision variable expressing whether the carrier i is assigned to the lane j.
Ma et al. (2010) develop a stochastic winner determination model with the objective of
minimizing the total expected purchasing cost. Minimizing the total cost involved in
transportation is the objective considered by few researchers (Caplice and Sheffi 2003;
Caplice 2007; Cohn et al. 2008; Srivastava et al. 2008; Yadati, Oliveira and Pardalos 2007),
whereas maximizing the total saving is the objective considered by Lim et al. (2008).
11
4.2.2 Non Price objective
Beyond the cost objective, there are many other objective types, which are very important
from the operations perspective. This includes on-time performance of the carrier, familiarity
with shipper’s operation, availability of right equipment, pick up performance, and billing
accuracy. Guo et al. (2006) and Sheffi (2004) discuss the non financial objective. Guo et al.
(2006) aim at minimizing total transportation cost considering the non financial objectives.
The benefits of using combinatorial auction and the importance of considering non financial
objectives are studied in detail by Sheffi (2004). Coulter (1989) categorizes the customers of
transportation service into six groups and analyses the influence of the factors such as
reliability of performance, insurance of service provision, quality of service, personalizing
factor and handling services for each group. They offer strategies for each segment of
customers based on these five factors. Rekik et al. (2012) include service attributes in terms
of hidden cost and this cost depends upon the reputation of the carrier. Reputation is
evaluated through different service attributes and corresponding weights assigned for each
carrier based on previous performance.
4.3. Market considered for analysis
4.3.1 Contract Market
In contract market, shippers allocate lanes to the carriers such that the particular carrier would
haul the agreed amount of loads in long term basis. This market is given more attention in the
literature (Caplice and Sheffi 2003; Caplice 2007; Chang 2009; Ergun et al. 2007; Figliozzi et
al. 2006; Guo et al. 2006; Lee et al. 2007; Lim et al. 2008; Ma et al. 2010; Sheffi 2004; Song
and Regan 2005; Song and Regan 2003; Wang and Xia 2005; Yadati et al. 2007; Rekik et al.
2012; Zhang et al. 2014). Ergun et al. (2007) discuss the cycle generation in collaborative
market place. Andersson and Norrman (2002) compare the purchase of basic and advanced
logistics services. They emphasize the need for reducing the time spent in establishing
contracts between shippers and carriers. In general, the negotiation process takes one or two
years because of uncertainty and other complexity involved.
4.3.2 Spot Market
Spot market is also addressed by the various researchers (Agrali et al. 2008; Berger and
Bierwirth 2010; Figliozzi 2004; Figliozzi et al. 2003; Garrido 2007; Mes et al. 2009; Robu
and Poutre 2009; Xu et al. 2013). In the spot market, the purchase of logistics services is one
12
time and the volume of load moved is relatively small. Usually in the market, both local and
in-transit carriers would be competing for winning lanes/loads. Analytical models are
available to analyse the effect of various system parameters such as order, carrier arrival and
abandonment rate on the system performance. Berger and Bierwirth (2010) develop a
framework for collaboration among carriers in a competitive market setting. Figliozzi (2004)
discusses the truckload procurement in spot markets using a sequential auction format.
Figliozzi et al. (2003) analyse online transportation market place using an agent based
system. Garrido (2007) studies the procurement of transportation services based on the fact
that empty movements may be used with real time information about shipper’s needs to
exploit spot market opportunities. Mes et al. (2009) develop profit maximization strategies
for shippers in the spot market. A partial truckload transportation auction model in spot
market is considered by Robu and Potre (2009). Xu et al. (2013) proposed solution
methodology to address transportation service procurement with asymmetric demand and
supply pattern in spot market.
4.4. Nature of demand
4.4.1. Constant demand
In most of the studies, demand for load to be moved in each lane is generally assumed to be
constant in order to reduce the complexity of the problem (Sheffi 2004; Wang and Xia 2005).
In some cases, unit demand is considered for simplification (Ergun et al. 2007; Guo et al.
2006; Lee et al. 2007; Mes et al. 2009; Song and Regan 2005; Song and Regan 2003).
Moreover, some authors formulate the models based on the known demand, which is an
estimate of previous data (Caplice and Sheffi 2003; Caplice 2007; Chang 2009; Garrido and
Mahmassani 2000; Yadati et al. 2007; Rekik et al. 2012). An estimate of loads per week or
month is accounted in the mathematical model developed by Caplice (2007). Chang (2009)
assumes that the total quantity of load to be moved consists of auctioned load, booked load
and forecasted load. To estimate the freight demand, Garrido and Mahmassani (2000)
propose a Multinomial Probit (MNP) model and apply it to an actual data set in order to
evaluate its performance. Yadati et al. (2007) allow the carriers to submit a bid price for each
lane along with the range of volume of loads to be moved. Figliozzi et al. (2004) study
various technologies available in the dynamic vehicle routing problem to compare the
performances of different technologies.
13
4.4.2 Variable Demand
The condition of variable demand nature of loads to be moved in each lane is also discussed
in a few works (Agrali et al. 2008; Garrido 2007). Moreover, a seasonality factor is
considered by Lim et al. (2008). Agrali et al. (2008) propose an analytical model to analyse
the performance of the logistics spot market in Turkey. One of the important features of the
model is that it can also be applied to other procurement auctions where the number of
participants varies randomly over time. Spot market case is studied by Garrido (2007) using
double auction system to match demand and supply.
4.4.3. Stochastic demand
Very limited works address the stochastic nature of demand. Ma et al. (2010), developed a
two stage stochastic model for the carrier assignment problem taking into account shipment
volume uncertainty. Zhang et al. (2014) is also attempted to solve two stage stochastic WDP
by using Monte Carlo Approximation method.
4.5. Lane bid type
4.5.1. Single bid
In this type, carriers bid for individual lanes. Agrali et al. (2008) adopt a reverse auction in
logistics spot market, where a shipper initiates the auction process by releasing transportation
order. The carriers who are interested will bid on line. Based on the received bids, the carrier
with the lowest bid price will be awarded the particular order. Their logistic market setting
has three parties: shippers, local carriers and in-transit carriers. Figliozzi et al. (2006) study a
logistics market operating in real time and in which the auction is performed one at a time as
the shipment reaches the auction market. Mes et al. (2009) discuss the automated
transportation market where bids are initiated for a single lane and use a threshold price for
continuous auction. Figliozzi et al. (2005) compare the performance of different sequential
auction settings used in truckload transportation service procurement. Computational
experiments shows that auction setting and information disclosure affect the performance of
truckload procurement market.
4.5.2 Combinatorial bids
Auctions where bidders are allowed to submit bids on combinations of items are usually
called combinatorial auctions, a topic which receives much attention among researchers
14
(Vries and Vohra 2003). Combinatorial bid is more attractive because of the potential
advantage over individual bids (Berger and Bierwirth 2010; Caplice and Sheffi 2003; Caplice
2007; Chang 2009; Cohn et al. 2008; Guo et al. 2006; Lee et al. 2007; Lim et al. 2008; Ma et
al. 2010; Sheffi 2004; Song and Regan 2005; Song and Regan 2003; Srivastava et al. 2008;
Wang and Xia 2005; Yadati et al. 2007; Tian et al. 2011; Rekik et al. 2012; Zhang et al.
2014). Berger and Bierwirth (2010) develop a combinatorial auction for the reassignment
problem in collaborative carrier networks.
Chang (2009) develops a bidding advisor to create combinatorial bids in the one shot
combinatorial auction in spot market. Cohn et al. (2008) develop an implicit bidding
mechanism for solving fully enumerated combinatorial auction in a single round. Guo et al.
(2006) attempt to solve a CAP with combinatorial bids using optimization models including
shipper’s non-price business objectives. Lee et al. (2007) propose an integrated model for
simultaneous route generation and selection for carrier’s bid generation problem under
combinatorial settings. Ma et al. (2010) develop a two stage stochastic model for CAP in
combinatorial auction. Sheffi (2004) emphasizes the need to use combinatorial auctions in
order to exploit the economies of scope in transportation service procurement. Moreover, the
use of optimization techniques in CAP has the added advantage of dealing with non-price
attribute and system constraints. Song and Regan (2005) propose an optimization based bid
construction strategy for BGP to investigate the benefits of using combinatorial auction from
the shipper and the carrier perspectives.
Song and Regan (2003) analyse shipper and carrier problems related to transportation service
procurement process based on combinatorial auction. Benefits of combinatorial auctions are
compared with traditional call for quote and negotiation procurement. Srivastava et al. (2008)
propose combinatorial auction based methods for global logistics procurement. Wang and
Xia (2005) discuss the formation of combinatorial bids in Bid Generation Problem. Yadati et
al. (2007) consider hybrid combinatorial auctions in CAP for transportation service
procurement. A hybrid auction is where a carrier not only gives the price for each lane but
also the relationships between the different prices and different quantities of items moved in a
particular lane.
4.6. Nature of work done
15
4.6.1 Conceptual developments
There are several theoretical studies that report issues and challenges in transport service
procurement without any mathematical or simulation models (Caplice and Sheffi 2003;
Garrido 2007; Sheffi 2004; Srivastava et al. 2008; Rekik et al. 2012). Caplice and Sheffi
(2003) discuss the transportation service procurement as a whole in which uncertainty in
bidding, carrier assignment model, business considerations and other lessons based on
practice are expressed in detail. Sheffi (2004) studies the benefits of having combinatorial
bidding in transportation service procurement and also the importance of considering non
price attribute in carrier assignment problem. The scope, challenges and design issues in
modelling global logistics procurement are discussed by Srivastava et al. (2008). Rekik et al.
(2012) introduce the concept of reputation-based allocation of lanes to carriers in truckload
transportation procurement auction for long term contract.
4.6.2 Mathematical Modelling Approaches
Most of the studies attempt to develop mathematical models and propose appropriate
solutions. Berger and Bierwirth (2010) consider collaborative carrier networks where carriers
exchange lanes in order to maximize the total profit without decreasing the individual profit
of the carriers. Chang (2009) develops a bidding advisor for solving BGP as minimum cost
flow network model. His approach is to formulate the problem as a collaborative carrier
routing problem and try to solve it using a heuristic procedure. Ergun et al. (2007) develop a
model for cycle covering problem involved in shipper collaboration and solve it using a
heuristic procedure.
Guo et al. (2006) formulate a mathematical model for CAP including cost involved at transit
points in order to make more realistic models. A combination of Branch and bound technique
and a heuristic is used to find a solution to the problem. Lee et al. (2007) develop a nonlinear
integer programming model for bid generation problem with the objective of maximizing the
profit and solve it by using Branch and Bound method. Lim et al. (2008) formulate an integer
programming model for carrier assignment problem considering the aspect of minimum
volume guarantee to the carriers which smoothen the irregularities in demand of freight
movement on each lane. Ma et al. (2010) formulate a two stage integer programming model
for CAP, considering stochastic nature of demand of loads to be hauled in each lane. Mito
and Fujita (2004) consider the general winner determination problem and proposed a
heuristic to solve it. They prove the effectiveness of the proposed heuristic over conventional
16
solution methodologies. Özener and Ergun (2008) consider the cost allocation problem in the
shipper collaborative environment and derived an effective mechanism for cost allocation
among shippers in order to maintain the collaborative structure. Yadati et al. (2007) formulate
an integer programming model for a hybrid carrier assignment problem with a heuristic
algorithm to solve the same. A mixed integer programming model is proposed by Tian et al.
(2011) and the CPLEX solver is used to solve the developed model.
4.6.3 Simulation techniques
Simulation based studies are widely used in transportation service procurement. Agrali et al.
(2008) use a simulation study to identify the effect of various factors such as order time,
carrier arrival time and abandonment rate on the performance of the spot market where both
local and in-transit carriers compete for transportation orders. Chan and Kroese (2008) use
two randomized algorithms namely Cross-entropy based algorithm and simulation based on
Markov chain Monte Carlo techniques to solve the WDP. Monte Carlo Approximation
method is used by Zhang et al. (2014) for solving two stage stochastic WDP under volume
uncertainty. Figliozzi et al. (2003) develop a simulation based framework using agents for
market place, shippers, and carriers to analyse the complexity of the engineering and
economic processes involved in transportation market place.
Figliozzi et al. (2006) derive an expression for opportunity cost in sequential auction for
transportation service procurement and use a simulation framework to evaluate different
strategies adopted. Mes et al. (2009) conduct a simulation study to analyse the performance
of the dynamic threshold policy adopted by the shipper in spot market environment. Song and
Regan (2005) conduct a simulation based experiment to examine the performance of
proposed bid construction method involved in BGP. Their study reveals that the performance
of the proposed methodology in terms of number of new lanes is high and that the empty
movements are comparable to the results of the traditional techniques. A framework for
modelling a full truckload transportation network is developed by Rossetti and Nangia (2007)
who prove its helpfulness in simulating real networks.
Multi-agent technology can be used as an important tool in transportation service
procurement process. Lavendelis and Grundspenkis (2006) discuss the use of agent
technology in multi criteria decision making involved in transportation service procurement.
17
Robu et al. (2011) provide insight into the effectiveness of application of agent based system
in day-to-day transportation outsourcing activities. An agent based framework for freight
transportation system is modelled by Roorda et al. (2010) and used in business decision
making, including logistic service contract, and provides sensitivity analysis with respect to
technological trends, business trends and policy scenario.
4.6.4 Case Study
Case studies in full truck load transportation service procurement are carried out by very few
researchers (Agrali et al. 2008; Ergun et al. 2007). Agrali et al. (2008) consider the logistic
spot market in Turkey, namely the ESO Logistics Centre. Ergun et al. (2007) use data
obtained from Strategic sourcing consortium for $14 billion sized US industry to test the
effectiveness of the algorithm developed for lane cycle generation. Tian et al. (2011) consider
the transportation service procurement process of Royal Philips Company for the analysis and
solve by using a heuristic method and Integer programming model.
5. Key findings and research gap
50 peer reviewed journal articles from 2000 to 2014 are selected (searched via Emerald,
Ingenta, Inderscience, Business Source Premier, Springer, Taylor & Francis, Informs,
MetaPress, ProQuest, and ScienceDirect), reviewed and analysed based on our framework.
Figure 2 depicts the number of papers published per year. The first observation is that there is
an increase in the number of publications during 2008 and 2009. One of the reasons is to
address the cost minimization challenges in the trucking industry during the period of
recession.
Table 6 shows the distribution of the literature according to classification criteria considered
in the framework. It is clear from the table 6 that CAP is more addressed by the researchers
than BGP. Furthermore, any non-price objectives are given a low importance.
______________________________
Insert Figure 2 about here
_______________________________
18
5.1 Problem type
The truckload service procurement process is carried out using an auction mechanism. In this
procedure, two phases are important, namely bidding by the carriers and determining winners
of various lane bids by shipper. The former problem is known as Bid Generation Problem
(BGP) and the latter is the Carrier Assignment Problem (CAP). As far as the problem
considered by the researchers is concerned, the number of works addressing CAP is higher
than BGP. The reason behind the difference is that the complexity involved in solving CAP is
comparatively higher than that of BGP. In today’s online truckload allocation market
situation, it is difficult to generate bids. BGP is developed as a bidding advisor to the carriers
in spot market as well as in contract market. With the evolution of combinatorial bidding,
solving BGP is more critical. On the same note, solving CAP becomes a more tedious task.
_________________________________________
Insert Table 6 about here
__________________________________________
5.2 Objectives
The objective of the problem discussed in the literature, whether it is a Bid Generation
Problem or Carrier Assignment Problem, is mostly cost oriented. Various non financial
objectives such as service level, percentage of acceptance of new loads, response time, billing
accuracy, etc. are given less attention. In addition, the literature addressing collaboration
issues needs more focus to unearth new ways and means of reaching effective lane cycle
formation and cost allocation mechanism among the partners, in order to maintain the
collaboration.
5.3 Bid type
From the survey, it is clear that the use of combinatorial bidding is promising for full
truckload transportation service procurement. Benefits of using combinatorial auction are
clearly explained especially in (Ledyard et al. 2002). In a combinatorial auction, a carrier
could submit single bids for several distinct lanes. If a particular bid is successful, then the
19
carrier would obtain the right to serve all lanes within the set (package) submitted. Otherwise
there would be no obligation to ship any incomplete set. This would minimize the risks for
carriers in obtaining only a subset of lanes that are not worth much, or that would incur a loss
in servicing the incomplete set of won lanes due to different repositioning costs.
5.4 Type of Market
Contract market is widely considered by researchers because of the amount of load to be
hauled by the carrier on the one side, and the period of agreement between the two parties
(shipper and carrier) on the other side, which is considerably higher compared to spot market.
The contract is always associated with terms and conditions upon which both parties agree.
Works do not only focus on establishing contract but also on sustaining it. For the one time
procurement of transportation service, spot or online market is best suited. In this aspect,
there is quite a considerable number of works considering procurement scenario in spot
market. Moreover, few authors consider the use of agent technology in full truckload
procurement. Further research can be carried out using intelligent agent system with more
realistic input to agents. Similarly, works may be done to include a number of carrier
performance measures during the period of contract for the next allocation period.
5.5 Collaboration
Both shipper collaboration and carrier collaboration are addressed in the literature. The
objective is mainly to minimize the empty movement of trucks in the case of carrier
collaboration, so that their profit is maximised. In addition, there are works emphasising the
strategies to be adopted for maintaining the collaboration. However, the survey shows that
only a limited number of works are carried out with a collaboration perspective. Some real
life information and data regarding shipper or carrier collaboration can also be used to
unearth more findings.
5.6 Demand consideration
In most of the papers, it is assumed that there is a unit demand in all the lanes for
simplification of the problem (i.e. the number of loads in each lane is equal to one). In some
other papers, the demand is determined by forecasting techniques and used in the assignment
of lanes to carriers. But in practice, there is always an uncertainty over the amount of loads to
be moved in each lane. In truckload procurement auction, most of the lanes are specified with
the volume to be moved as an estimated quantity. Lanes are awarded before the actual
20
volume requirements are known. Thus, assignments of lanes to carriers may not be optimal
after the volume uncertainty is resolved. For example, a carrier that wins a set of lanes may
be asked to ship less volume than actually awarded and thereby portion of revenue may be
lost. Sometimes, the volume may be greater than the expected amount such that an assigned
carrier may not have sufficient truckload capacity. In this case, the shipper may need to
procure additional third-party services at extra cost to meet the actual volume demand. In
either case, uncertainty can have a detrimental effect and the Carrier assignment Problem
(CAP) should properly account for this possibility. This demand uncertainty factor is only
addressed by Ma et al. (2010). There is then more scope for work addressing stochastic
demand pattern involved in lane estimation for truckload procurement.
5.7 Nature of Work done
One of the most important findings is the limited number of real-world cases; very few
authors have conducted case studies. Procurement of transportation service with respect to
emerging economies has not been studied so far. Some of the reasons are the low penetration
rate of modern logistic concepts and freight transport and the lack of good infrastructure. As
far as problem modelling is concerned, most of the literature has a focus on mathematical and
simulation models, but few authors use meta-heuristics to solve the problem.
5.8 Work done in Regional context
The survey reveals that most of the research articles published in this topic are based on US
logistic market. Almost 90 percentage of the literature deal with various issues in
transportation service procurement which are based on US market. Most of the terminologies
are also evolved from this region only. Few studies are also addresses the other markets such
as China, India, Canada, Turkey etc., It is also observed from the survey that there is a wide
gap between the developing and emerging markets in terms of infrastructure, technology,
environmental regulation and so on. As an important observation of this study, it is identified
that there is a huge opportunity for the researchers to carry out the case studies based on
emerging logistic markets.
6. Conclusion
FTL transportation service procurement is an important logistical activity, as it will highly
impact logistics cost and customer service. In this paper, Full truck load procurement is
21
considered for review. The review is based on a framework with several criteria such as
problem type considered, objective, type of market, nature of demand, type of collaboration
and the methodology used.
In terms of problem formulation, the inclusion of non financial objectives along with the cost
related objective will yield outstanding results in truckload procurement auctions. Cycle
generation methods are used by researchers to reduce empty movement of trucks. In this way,
both shipper and carrier can benefit.
On the methodological side, future research directions should consider stochastic models for
the truckload requirement in each lane, so that it will mimic reality. From the modelling point
of view, both BGP and CAP are formulated as single objective problems. However, as the
problem becomes complex, there is a need to consider multi-objective frameworks to cope
with its real complexity.
The review work is completely based on the articles available in full truckload procurement
and it outlines the current status and trend of research in this topic with the available articles.
The paper simply elaborates the outcome of systematic literature review based on the
framework considered without proposing solutions for specific cases of full truckload
procurement.
References
Abate, M., and Jong, G. 2014. The optimal shipment size and truck size choice The
allocation of trucks across hauls. Transportation Research Part A: Policy and Practice 59,
262277.
Agrali, S., Tan, B., and Karaesmen, F. 2008. Modeling and analysis of an auction-based
logistics market. European Journal of Operational Research 191(1), 272294.
American Trucking Associations. 2010 < http://www.trucking.org> (accessed 06.12.2014).
American Transportation Research Institute. 2011. Critical issues in the trucking industry-
2011. <http://www.atri-online.org/2011_top_industry_issues.pdf.> (accessed 06.11.2013).
Andersson, D., and Norrman, A. 2002. Procurement of logistics services -a minutes work or a
multi-year project?. European Journal of Purchasing & Supply Management 8(1), 314.
22
Autry, C.W., Zacharia, Z.G., and Lamb, C.W. 2008. A logistics strategy taxonomy. Journal
of Business logistics 29(2), 27 51.
Berger, S., and Bierwirth, C. 2010. Solutions to the request reassignment problem in
collaborative carrier networks. Transportation Research Part E 46(5), 627638.
Bontekoning, Y.M., Macharis, C., and Trip, J.J. 2004. Is a new applied transportation
research field emerging?––A review of intermodal railtruck freight transport literature.
Transportation Research Part A 38(1), 134.
Caplice, C. 1996. An optimization based bidding process: A new framework for shipper-
carrier relationships. Ph.D thesis, Massachusetts Institute of Technology, Cambridge,
Massachusetts, USA.
Caplice, C. 2007. Electronic Markets for Truckload Transportation. Production and
Operations Management 16(4), 423436.
Caplice, C., and Sheffi, Y. 2003. Optimization-Based Procurement for Transportation
Services. Journal of Business Logistics 24(2), 109-128.
Carter, C.R., and Jennings, M.M. 2002. Logistics social responsibility: An integrated
framework. Journal of Business logistics 23(1), 145 180.
Chan, J.C.C., and Kroese, D.P. 2008. Randomized Methods for solving the Winner
Determination Problem in Combinatorial Auctions. IEEE Proceedings of the Winter
Simulation Conference, Dec. 7-10, Austin, Texas, USA 1344 - 1349.
Chang, T.S. 2009. Decision Support for Truckload carriers in one-shot Combinatorial
auctions. Transportation Research Part B 43(5), 522541.
Chen, R.L.Y. 2010. Models and Algorithms for Stochastic Network Design and Flow
Problems: Applications in Truckload Procurement Auctions and Renewable Energy. Ph.D
thesis, University of Michigan, Ann Arbor, Michigan, USA.
Cohn, A., Beil, D., and Sinha, A. 2008. Using Implicit Bidding to Solve Truckload
Procurement Auctions. Proceedings of NSF Engineering Research and Innovation
Conference, Jan. 7-10, Knoxville, Tennessee, USA.
Coulter, R.L., Darden, W.R., Coulter, M.K., and Brown, G. 1989. Freight Transportation
Carrier Selection Criteria: Identification of Service dimensions for competitive positioning.
Journal of Business Research 19(1), 51-66.
Doll, A., Friebel, D., Rückriegel, M. and Schwarzmüller, C. 2014. Global Logistics Market.
Roland Berger Strategy Consultants, Munich, Germany.
Ergun, O., Kuyzu, G., and Savelsbergh, M. 2007. Reducing Truckload Transportation Costs
Through Collaboration. Transportation Science 41(2), 206221.
Ergun, O., Kuyzu, G., and Savelsbergh, M. 2007. Shipper collaboration. Computers &
Operations Research 34(6), 15511560.
23
Figliozzi, M.A. 2004. Performance and analysis of spot-truckload procurement markets using
sequential auction. Ph.D thesis, University of Maryland, Maryland, USA.
Figliozzi, M.A., Mahmassani, H.S., and Jaillet, P. 2003. Framework for Study of Carrier
Strategies in Auction-Based Transportation Marketplace. Transportation Research Record
1854, 162-170.
Figliozzi, M.A., Mahmassani, H.S., and Jaillet, P. 2004. Competitive Performance
Assessment of Dynamic Vehicle Routing Technologies Using Sequential Auctions.
Transportation Research Record 1882, 1018.
Figliozzi, M.A., Mahmassani, H.S., and Jaillet, P. 2005. Impacts of Auction Settings on the
Performance of Truckload Transportation Marketplaces. Transportation Research Record
1906, 8996.
Figliozzi, M.A., Mahmassani, H.S., and Jaillet, P. 2006. Quantifying Opportunity Costs in
Sequential Transportation Auctions for Truckload Acquisition. Transportation Research
Record 1964, 247252.
Garrido, R.A. 2007. Procurement of transportation services in spot markets under a double-
auction scheme with elastic demand. Transportation Research Part B 41(9), 10671078.
Garrido, R.A. and Mahmassani, H.S. 2000. Forecasting freight transportation demand with
the space-time multinomial probit model. Transportation Research Part B 34(5), 403-418.
Guastaroba, G., Mansini, R., and Speranza, M.G. 2009. Modeling the Pre-Auction Stage: The
Truckload Case. Innovations in Distribution Logistics, Lecture Notes in Economics and
Mathematical Systems 619, 219-233.
Gujo, O., and Schwind, M. 2008. Bid Formation in a Combinatorial Auction for Logistics
Services. Enterprise Information Systems Lecture Notes in Business Information Processing
12(5), 303-315.
Guo, Y., Lim, A., Rodrigues, B., and Zhu, Y. 2006. Carrier assignment models in
transportation procurement. Journal of the Operational Research Society 57, 14721481.
Huang, S.H., and Lin, P.C. 2010. A modified ant colony optimization algorithm for multi
item inventory routing problems with demand uncertainty. Transportation Research Part E
46(5), 598611.
Kelkar, V. 2008. Logistics Management: Emerging Scenario. Chemical Engineering World
Magazine 53-54.
Konur, D. 2014. Carbon constrained integrated inventory control and truckload transportation
with heterogeneous freight trucks. Int. J. Production Economics 153, 268-279.
Kuyzu, G. 2007. Procurement in truckload transportation. Ph.D thesis, Georgia Institute of
Technology, Atlanta, Georgia, USA.
Langenfeld, J.A., Halloran, M., Hartford, B.J. 2007. Transportation & Logistics Third
Party Logistics” Robert W. Baird & Co. Incorporated.
24
<http://www.globallp.net/glp2/GLP2_downloads/Baird3PLReport7-07.pdf> (accessed
12.11.2013).
Lavendelis, E., and Grundspenkis, J. 2006. Simulation Tool for Multicriteria Auctions in
Transportation and Logistics Domain. Proceedings of International Conference on Computer
Systems and Technologies, June 15-16, University of Veliko Tarnovo, Bulgaria, 17.1-17.6.
Ledyard, J.O., Olson, M., Porter, D., Swanson, J.A., and Torma, D.P. 2002. The First Use of
a Combined-Value Auction for Transportation Services. Interfaces 32(5), 412.
Lee, C.G., Kwon, R.H., and Ma, Z. 2007. A carrier’s optimal bid generation problem in
combinatorial auctions for transportation procurement. Transportation Research Part E 43(2),
173191.
Lee, G., You, S., Ritchie, S.G., Saphores, J., Jayakrishnan, R., Ogunseitan, O. 2012.
Assessing air quality and health benefits of the Clean Truck Program in the Alameda
corridor, CA. Transportation Research Part A: Policy and Practice 46(8), 11771193.
Lim, A., Rodrigues, B., and Xu, Z. 2008. Transportation Procurement with Seasonally
Varying Shipper Demand and Volume Guarantees. Operations Research 56(3), 758771.
Logistics world (2013), <www.logisticsworld.com>,(accessed 08.02.2013).
Ma, Z. 2008. Combinatorial auctions for truckload transportation procurement. Ph.D thesis,
University of Toronto, Toronto, Canada.
Ma, Z., Kwon, R. H., and Lee, C.G. 2010. A Stochastic programming winner determination
model for truckload procurement under shipper uncertainty. Transportation Research Part E
46(1), 4960.
Mes, M. 2008. Sequential auctions for full truckload allocation. Ph.D thesis, University of
Twente, Enschede, The Netherlands.
Mes, M., Heijden, M.V., and Schuur, P. 2009. Dynamic threshold policy for delaying and
breaking commitments in transportation auctions. Transportation Research Part C 17(2), 208
223.
Mito, M., and Fujita, S. 2004. On Heuristics for Solving Winner Determination Problem in
Combinatorial Auctions. Journal of Heuristics 10(5), 507523.
Ozener, O.O., and Ergun, O. 2008. Allocating Costs in a Collaborative Transportation
Procurement Network. Transportation Science 42(2), 146165.
Ozener, O.O., Ergun, O., and Savelsbergh, M. 2011. Lane-Exchange Mechanisms for
Truckload Carrier Collaboration.Transportation Science 45(1), 1-17.
Punakivi, M. and Hinkka, V. 2006. Selection Criteria of Transportation Mode: A Case Study
in Four Finnish Industry Sectors. Transport Reviews: A Transnational Transdisciplinary
Journal, 26(2), 207 219.
Rajagopal, N. 2009. Rethink Transportation Service Procurement. Transportation. Logs
India, Magazine.
25
Reilly, J. 2011. Trucking Perspectives market insight. Inbound Logistics September 2011, 61-
69.
Rekik, M., and Mellouli, S., 2012. Reputation-based winner determination problem for
combinatorial transportation procurement auctions. Journal of the Operational Research
Society 63, 14001409.
Robu, V., and Poutré, H.L. 2009. Designing Risk-Averse Bidding Strategies in Sequential
Auctions for Transportation Orders. Studies in Computational Intelligence 233, 139-160.
Robu, V., Noot, H., Poutré, H.L., and Schijndel, W.J. 2011. A multi-agent platform for
auction-based allocation of loads in transportation logistics. Expert Systems with
Applications 38(4), 3483-3491.
Roorda, M.J., Cavalcante, R., McCabe, S., and Kwan, H. 2010. A conceptual framework for
agent-based modelling of logistics services. Transportation Research Part E 46(1), 1831.
Rossetti, M.D., and Nangia, S. 2007. An Object-Oriented Framework for Simulating Full
Truckload Transportation Networks. IEEE Proceedings of the Winter Simulation Conference,
Dec. 9-12, Washington DC, USA, 1869-1877.
Rothkopf, M.H., Pekec, A., and arstad, R.M. 1998. Computationally Manageable
Combinatorial Auctions. Management Science 44(8), 1131-1147.
Sandholm, T. 2002. Algorithm for optimal winner determination in combinatorial auctions.
Artificial Intelligence 135(1-2), 154.
Sathaye, N., Horvath, A., Madanat, S. 2010. Unintended impacts of increased truck loads on
pavement supply-chain emissions. Transportation Research Part A: Policy and Practice 44(1),
1-15.
Schulz., J.D. 2014 State of Logistics: Truckloadcapacity tight and drivers needed, article in
Logistic Management magazine, 1st July 2014.
Schwind, M., Gujo, O., and Vykoukal, J. 2009. A combinatorial intra-enterprise exchange for
logisics services. Information Systems and E-Business Management 7 (4), 447471.
Sheffi, Y. 2004. Combinatorial Auctions in the Procurement of Transportation Services.
Interfaces 34(4), 245252.
Song, J. and Regan, A. 2003. Combinatorial Auctions for Transportation Service
Procurement: The Carrier Perspective. Transportation Research Record 1833, 40-46.
Song, J., and Regan, A. 2005. Approximation algorithms for the bid construction problem in
combinatorial auctions for the procurement of freight transportation contract. Transportation
Research Part B 39(10), 914933.
Srivastava, N.K., Viswanadham, N., and Kameshwaran, S. 2008. Procurement of Global
Logistics Services Using Combinatorial Auctions. Proceedings of fourth IEEE Conference on
Automation Science and Engineering, August 23-26, Key Bridge Marriott, Washington DC,
USA 297-302.
26
The Statistics Portal < http://www.statista.com> (accessed 10.12.2014).
Tian, T., Wang, N., Ma, H., Lim, A. 2011. 8th International Conference on Service Systems
and Service Management (ICSSSM), 25-27, June 2011, Tianjin, China.
Transportation Intelligence. 2012. Global contract logistics 2012.”
<http://www.transportintelligence.com> (accessed 09.12.2014).
Tsai, M.T., Regan, A., Saphores, J.D. 2009. Freight Transportation Derivatives Contracts:
State of art and future developments. Transportation Journal 48(4), 7-19.
Verdonck, L., Caris, AN., Ramaekers, K. and Janssens, G. K. 2013. Collaborative Logistics
from the Perspective of Road Transportation Companies, Transport Reviews: A
Transnational Transdisciplinary Journal, 33(6), 700-719.
Vries, S.D., and Vohra, R.V. 2005. Combinatorial Auctions: A Survey. Journal on
Computing 15(3), 284309.
Wang, X., and Xia, M. 2005. Combinatorial Bid Generation Problem for Transportation
Service Procurement. Transportation Research Record 1923, 189198.
Xu, S.X., Huang, G.Q. 2013. Transportation service procurement in periodic sealed double
auctions with stochastic demand and supply. Transportation Research Part B 56, 136160.
Yadati, C., Oliveira, C.A.S., and Pardalos, P.M. 2007. An Approximate Winner
Determination Algorithm for Hybrid Procurement Mechanisms Logistics. Advances in
Computational Management Science 9(1), 51-66.
Zhang, B., Ding, H., Li, H., Wang, W., and Yao, T. 2014. A Sampling-Based Stochastic
Winner Determination Model for Truckload Service Procurement. Networks and Spatial
Economics 14(2), 159-181.
Zhang, Z. and Figliozzi , M.A. 2010. A Survey of China’s Logistics Industry and the Impacts
of Transport Delays on Importers and Exporters, Transport Reviews: A Transnational
Transdisciplinary Journal, 30(2), 179 194.
Zvirblis, A., and Zinkeviciute, V. 2008. The Integrated Evaluation of the Macro environment
of Companies providing Transport Services. Transport 23(3), 266-272.
27
Table 1: Country wise contract logistic market
S.No
Country
Contract logistic Market in
Million USD
1
USA
60739
2
Canada
5786
3
UK
22332
4
Germany
19629
5
France
10241
6
China
33690
7
Japan
21163
8
India
8049
Table 2: Issues in logistics and their Ranks
Rank
Issues
Rank
1
Economy
6
2
Hours of service
7
3
Driver shortage
8
4
Implementation of safety rules
9
5
Fuel price
10
Table 3: Typical challenges
Shippers Challenges
Carriers Challenges
1. Reducing transport cost
2. Price pressure from customers/competitors
3. Customer service
4. Finding capacity
5. Matching supply to demand
1. Driver related cost
2. Fuel cost
3. Equipment cost
4. Safety regulations
5. Insurance cost and liabilities
28
Table 4: Countrywise Truckload Market
S.No
Country
Billions of Tonne
Kms
Percentage share by
Transportation mode
1
US
1898.7
29.52
2
China
6740.4
35.56
3
EU
1740.3
44.76
4
Japan
379.3
62.54
5
India
9975.6
59.62
29
Table 5: Literature review summary based on the framework
S.
No.
Author
Problem
Type
Objective
Market
considered
Collaboration
Among
Demand
Lane Bid type
Nature of work
BGP
CAP
Cost
Non
price
Truck
Contract
Spot/
For-
hire
Shipper
Carrier
Known/
Constant/
unit
Stochastic/
Seasonal
Single
Combi
natorial
Con
ceptual
Mathe
matical
Simu
lation
Case
Study
1.
Agrali et al.
(2008)
X
X
X
X
X
X
2.
Berger and
Bierwirth
(2010)
X
X
X
X
X
X
3.
Caplice
(2007)
X
X
X
X
X
X
4.
Caplice and
Sheffi
(2003)
X
X
X
X
X
X
5.
Chang
(2009)
X
X
X
X
X
X
6.
Cohn et
al.(2008)
X
X
X
7.
Ergun et al.
(2007)
X
X
X
X
X
X
8.
Ergun et al.
(2007)
X
X
X
X
9.
Figliozzi et
al. (2003)
X
X
X
10.
Figliozzi et
al. (2006)
X
X
X
X
X
11.
Garrido
(2007)
X
X
X
12.
Guo et al.
(2006)
X
X
X
X
X
X
X
13.
Lee et al.
(2007)
X
X
X
X
X
X
14.
Lim et al.
(2008)
X
X
X
X
X
X
15.
Ma et al.
(2010)
X
X
X
X
X
X
30
16.
Mes (2008)
X
X
X
X
X
17.
Özener and
Ergun
(2008)
X
X
X
18.
Rekik et al.
(2012)
X
X
X
X
X
X
19.
Sheffi
(2004)
X
X
X
X
X
X
X
20.
Song and
Regan
(2005)
X
X
X
X
X
X
21.
Song and
Regan
(2003)
X
X
X
X
X
X
22.
Srivastava
et al. (2008)
X
X
X
X
23.
Tian et al.
(2011)
X
X
X
X
X
X
24.
Wang and
Xia (2005)
X
X
X
X
X
X
25.
Xu et al.
(2013)
X
X
X
X
X
X
26.
Yadati et
al.(2007)
X
X
X
X
X
X
27.
Zhang et al.
(2014)
X
X
X
X
X
X
31
Table 6: Distribution of literature as per the criteria in framework
S.No.
Classifying Criterion
Type considered
No. of Papers published
1.
Problem Type
BGP
6
CAP
11
2.
Problem Objective
Cost
21
Non-Price
2
3.
Market considered
Contract
15
Spot
5
4.
Collaboration
Shipper
3
Carrier
2
5.
Demand of loads
Known/constant/
unit
12
Seasonal/
Stochastic
6
6.
Lane Bid Type
Single
3
Combinatorial
16
7.
Nature of Work
Conceptual
4
Mathematical
12
Simulation
8
Case study
2
32
Figure 1: Framework for review of truckload transportation procurement
Figure 2: Literature published in transportation service procurement
33
Appendix: Terminology and process involved in transportation service procurement
A1. Terminology
As the area of FTL technically involves many concepts, which are of a high importance in the
domain, the following terminology is adopted for this paper.
Shipper: Shippers may be manufacturers, distributors, retailers, and other organizations that
need to move freight.
Carriers: Carriers are trucking companies that have trucks and other transportation facilities.
Lane: It is the basic unit of interest and is defined as a unidirectional movement from an
origin to a destination for a certain time period.
Cycle: A cycle is a set of lanes originating and terminating at the same physical location. In
general, cycle generation is achieved by shipper or carrier collaboration.
Individual Bids: Carriers submit bid for each lane separately, and the shipper will designate
the winner based on the bid price for the particular lane submitted by carriers.
Combinatorial Bids: In combinatorial bidding, carriers bid for set of lanes and each carrier
can submit any number of sets. If a carrier wins a particular set, then he has to haul all the
lanes in the set.
Economy of Scope: The cost of serving a lane not only depends upon the amount of loads to
be moved on that lane but also on the number of loads carried on other related lanes. Suppose
a carrier is moving 10 loads from city A to city B and return to the city A without load
(empty haul) for further loading. In this scenario, load from city B to city A will reduce the
repositioning cost of the carrier, and it is referred as an economy of scope.
Empty haul: It is the empty movement of the vehicle from the delivery point to the home.
This may be because of repositioning of the truck for further freight loading or change of
driver or for servicing the vehicle, etc.,
34
A2. Process involved in Transportation Procurement
Shippers procure transportation services in order to move their loads, which are based on
their freight forecast and planned freight cost. According to Caplice (1996), the procurement
process consists of five steps: carrier screening, information exchange, carrier assignment,
load tendering and performance review. The first three steps constitute the planning phase,
and the last two steps are components of the execution phase as shown in figure A1.
Planning Phase
The first step in the planning phase is carrier screening. In this stage, the shipper filters the
number of potential carriers to decrease complexity, reduce cost and increase service level.
The second step is the iterative process of information exchange in which shippers and
carriers exchange information about lanes, volume details and prices.
______________________________
Insert Figure A1 about here
_______________________________
The shipper then assigns the carriers to its network and assembles the routing guide. The
routing guide ranks which carrier is assigned to a specific load, based on the lane and
capacity of the carrier during the execution phase. Routing guides can vary in complexity and
range from a paper-based system to a central electronic database that uses sophisticated
software to integrate the shipper to the carrier Enterprise Resource Planning (ERP) system.
These systems are known as Transportation Management Systems (TMS) and have many
capabilities to handle transportation planning and execution.
Execution Phase
The execution phase has two steps: load tendering and performance review. The Load
tendering step selects the carrier for each load as it becomes ready to ship. Organizations
must make real time choices picking alternative carriers to mitigate changes between
planning and execution. These changes include adding, moving, adjusting and deleting
freight volume as a result of anticipated activities such as closing of facilities, acquiring new
suppliers or mergers with other companies. The final step is the performance review of the
carrier. The performance review includes some measures such as the carrier refusal rate and
35
the on-time rate. Generally, long term contracts are established by the manufacturing
industries with carriers by following the above set of procedure and in logistic terms it is a
part of contract logistics. The volume of the market can be understood from the figure A2,
which shows the revenue of the world top 5 contract logistic companies in the year 2013.
______________________________
Insert Figure A2 about here
_______________________________
Ma (2008) uses a similar procedure to explain the overall procurement process for
transportation services. In addition to the activities in the comprehensive procurement
process, multi round auctions for transportation procurement have few more activities as
shown in figure A3. Multi round auction has the advantage of adjusting different strategies by
the bidders based on the price change. In this type of auction, the winner of the first round is
determined, and then bidders are called for second round. The package submitted by the
carriers for the second round may be different from the previous one. This procedure is
repeated until stopping criteria are achieved.
______________________________
Insert Figure A3 about here
_______________________________
According to Chen (2010), in a basic truckload procurement auction, the auctioneer specifies
a set of bid lanes, each defined by an origin, a destination and expected number of loads.
Given a bundle of bid lanes, carriers determine the least-cost set of tours to serve these bid
lanes, then use this cost to calculate their bid price for this particular bundle. Finally, the
auctioneer solves the winner determination problem (WDP) to select bundles and allocate the
corresponding lanes to the winning carriers. Demand driven online market situation is
explained by Mes (2008) and shown in figure A4.
______________________________
Insert Figure A4 about here
_______________________________
36
Shippers post their required number of full truckloads online and the carriers bid for it based
on their on-hand open capacity. If the requirement and the available capacity match, an
agreement is then reached. As a next step, vehicle scheduling consists of allocating each load
to a vehicle and a driver. Carriers may be able to find out the remaining available capacity
after including the loads in their schedule. The carrier searches for online jobs to match the
ready for use capacity in an iterative manner. This type of procedure is followed in for-hire
truckload industry, an important logistic sector in developed market like US. In US, it
accounts to 300 Billion USD (Schulz. 2014).
37
Figure A1: Transportation service procurement process
16044
4459
4455
3711
2495
DHL Supply
Chain
Kuehne+ Nagel
CEVA
Hitachi
Transport
SNCF Geodis
Revenue in Million USD
Figure A2: Revenue of Top 5 Contract logistic companies of the world
38
Figure A3: Basic structure of multi round auction
Figure A4: Online transportation service market
... TL freight transportation market is worth US$524 billion in the USA, which represents 75.4% of the total freight transportation market and this is expected to increase even more in the coming years given the accessibility of online shopping Jothi Basu et al., 2015). Indeed, TL operations are often used for the delivery of a single item with a high demand while LTL operations are operated to deliver one or more items to a larger number of clients with small requests by combining them. ...
... Jothi Basu, R., Subramanian, N., Cheikhrouhou, N., 2015. Review of full truckload transportation service procurement. ...
Thesis
Full-text available
Nowadays, the evolution of e-commerce and consumption levels require supply chain actors, in particular carriers, to efficiently manage their operations. In order to remain competitive and to maximize their profits, they must optimize their transport operations. In this doctoral thesis, we focus on Combinatorial Auctions (CA) as a negotiation mechanism for truckload (TL) transportation services procurement allowing a shipper to outsource its transportation operations and for a carrier to serve new transportation contracts. Combinatorial bids offer a carrier the possibility to express his valuation for a combination of contracts simultaneously. If the bid is successful, all the contracts forming it will be allocated to the carrier at the submitted price. The major challenges for a carrier are to select the transportation contracts to bid on, formulate combinatorial bids and associated prices. These decision-making challenges define the Bid Construction Problem (BCP). Each carrier must solve a BCP while respecting its pre-existing commitments and transportation capacity and considering unknown competitors' offers, which makes the problem difficult to solve. In practice, the majority of carriers rely on their historical data and market knowledge to set their prices. In the literature, the majority of works on the BCP propose deterministic models with known parameters and are limited to the problem with a homogeneous fleet. In addition, we found a single work addressing a stochastic BCP. In this thesis, we aim to advance knowledge in this field by introducing new formulations and solution methods for the BCP. The first chapter of this thesis introduces the BCP with a heterogeneous fleet. Starting from a comparison between the BCP and classical Vehicle Routing Problems (VRPs), we propose a new arc-based formulation with new symmetry-breaking constraints for the BCP. Next, we propose exact and heuristic approaches to solve this problem. Our Adaptive Large Neighborhood Search (ALNS) heuristic is based on a destroy-repair principle using operators designed for this problem. Our exact method starts from the heuristic solution and solves our mathematical model with CPLEX. The results we obtained revealed the relevance of our methods in terms of solutions quality and computational times for large instances with up to 500 contracts and 50 vehicles. In the second chapter, we tackle a particular case of the BCP where the carrier has no pre-existing commitments and aims to select a set of profitable auctioned contracts to bid on. This problem corresponds to a Team Orienteering Problem (TOP). We propose a hybrid ALNS heuristic for the TOP with new operators as well as new features taking into account the nature of the problem. Then, we compare the performance of our algorithm against the best solutions from the literature. The results show that our method generally outperforms all the existing ones in terms of solutions quality and/or computational times on benchmark instances. Our method improves one large instance solution, which highlights its performance. In the third chapter, we focus on the uncertainty associated with the auctioned contracts clearing prices and competing carriers offers. Only one article dealing with uncertainty in the BCP existed but it does not allow to generate multiple bids. Thus, we propose a new formulation for the BCP with stochastic prices allowing to generate non-overlapping combinatorial bids. We present two methods to solve this problem. The first one is a two-step hybrid heuristic. First, it solves a Contracts Selection Problem to determine a set of profitable contracts to bid on. Secondly, it simultaneously solves a Contracts Selection and Pricing Problem (CSPP) by considering only the set of auctioned contracts selected in the first stage. Our exact method solves a CSPP by branch-and-cut without pre-selecting contracts. The experimental and simulation results underline the performance of our two methods and evaluate the impact of certain parameters on the carrier's real profit. In the fourth chapter, we focus on the uncertainty associated with bids success and contracts non-materialization. Generally, the carrier seeks to be assured that if some of the submitted bids are not won or a contract does not materialize, it will not incur a loss by serving the remaining contracts. In this research, we address the BCP with stochastic prices and develop an exact method that ensures a non-negative profit for the carrier regardless of the auction outcomes and contracts materialization. Our simulations of the optimal solutions show that, on average, our approach increases the carrier's profit in addition to guaranteeing its non-negativity regardless of the bids won or the contracts materialization.
... While in a competitive transportation procurement system, if carriers can combine multiple lanes as a tour or a continuous move, they can decrease their empty mileage and thereby reduce cost (Chen et al., 2009) or generate greater profits (Chang, 2009;Jothi Basu et al., 2015). Due to the synergies available on the transportation pathways (Triki, 2016;Wang & Wang, 2015;Xu & Huang, 2014a,b), CAs has attracted increasing attentions in transportation procurement as it allows carriers to submit bundle bids that can express their preferences when they group transportation lanes into packages (Sheffi, 2004a;Triki et al., 2014). ...
... In a competitive transportation procurement system, due to the synergies available on the transportation pathways (Triki, 2016;Wang & Wang, 2015;Xu & Huang, 2014a,b), CAs allows carriers to bid on combinations of lanes as a packages instead of bidding only on individual lane, in which, carriers can express their preferences when they group transportation lanes into packages (Sheffi, 2004a;Triki et al., 2014). In other words, combining multiple lanes as a tour or a continuous move by carriers allows them to decrease their empty mileage and thereby reduce cost (Chen et al., 2009) or to generate greater profits (Chang, 2009;Jothi Basu et al., 2015). ...
Thesis
In this thesis, we aim to develop models and decision making algorithms to design simultaneously several sustainable logistics and transportation chains between origins and destinations given a logistics and transportation network. First, we investigate the state of the art of decentralized logistics and transportation systems, and survey the Winner Determination Problem. Then, we study the Bundle Construction Problem to construct transportation routes, which is solved by an exact bi-directional dynamic programming. Next, we merge the Bid Generation Problem and Winner Determination Problem through the bi-level concept, the centralized and decentralized bi-level problems are then solved by Linearization procedure and Best Response procedure, respectively.
... Varieties of procurement mechanisms are proposed for solving the transportation service procurement problem, such as combinatorial auctions, double auctions. For more details about auction mechanisms for transportation service procurement, please refer to the review papers of Jothi Basu et al. (2015) and Lafkihi et al. (2019). In a transportation service procurement auction, each carrier needs to solve a bid generation problem (BGP) to select transportation requests for bidding . ...
Thesis
Effective transportation planning is important for shippers and carriers to reduce their logistics costs because of high fuel prices and an increasing competition in the transportation market. Collaboration among shippers or carriers can improve their profitability by reducing empty vehicle repositions and increasing vehicle fill rates.This thesis studies three problems raised in collaborative logistics in less than truckload transportation. Firstly, an iterative request exchange mechanism is proposed for carrier collaboration in a single echelon transportation. Numerical experiments show that this multi-round exchange mechanism significantly outperforms other auction mechanisms in the literature. Then, a Benders decomposition algorithm is developed to solve a transportation service procurement problem in a multi-echelon transportation. Finally, a problem of collaboration among shippers in forward and reverse logistics is investigated and an algorithm is proposed, which is effective in terms of both solution quality and computation time. Numerical experiments demonstrate that this shipper collaboration can realize significant cost savings compared with the isolated operation of each shipper without cooperation. The proposed auction mechanisms and algorithms have the potential to help carriers and shippers improve their profitability through effective collaboration among them.
... This type of transportation is called Full-Truck-Load (FTL). In FTL transportation, the truck moves directly from the origin to the destination without visiting any intermediate locations ( Ramanatan, Subramanian, & Cheikhrouhou, 2015 ), as the truck utilization is sufficiently large. For FTL shipments, routing decisions are not needed but the vehicle loading and dispatching decisions still pose a challenge to be resolved. ...
Article
This paper introduces a multi-period, two-dimensional vehicle loading and dispatching problem, called Two-Dimensional Vehicle Loading and Dispatching Problem with Incompatibility Constraints (VLDP). The problem concerns preparing a single-origin single-destination transportation plan of loading required orders to vehicles at the origin and dispatching the vehicles to deliver the orders to the destination within their due dates. The decision maker uses their own fleet of vehicles, with each vehicle having a fixed transportation cost per trip, and may outsource additional vehicles at a higher cost. VLDP involves constraints regarding the due dates of the orders, pairwise incompatibility of orders packed in the same vehicle, incompatibility of orders and vehicles, as well as area and weight capacity of the vehicles. An order can be delivered earlier than its due date, incurring an earliness penalty due to storage requirements at the destination. The objective is to minimize the total vehicle usage and earliness penalty costs. A Mixed-Integer Linear Programming model (MILP) is provided, as well as an Adaptive Large Neighbourhood Search (ALNS) algorithm. Results of computational experiments on instances derived from real-world data show the effectiveness of the ALNS algorithm.
... This set of literature includes Guastaroba et al. (2009), Caplice et al. (2011, Lee and Po (2007), and Mulqueen (2006). For a review of the TL transportation service procurement modeling approaches including contract or spot agreements between shippers and carriers, the reader is referred to Basu et al. (2015). ...
Preprint
Full-text available
Dynamic macroeconomic conditions and non-binding truckload freight contracts enable both shippers and carriers to behave opportunistically. We present an empirical analysis of carrier reciprocity in the US truckload transportation sector to demonstrate whether consistent performance and fair pricing by shippers when markets are in their favor result in maintained primary carrier tender acceptance when markets turn. The results suggest carriers have short memories; they do not remember shippers' previous period pricing, tendering behavior, or performance when making freight acceptance decisions. However, carriers appear to be myopic and respond to shippers' current market period behaviors, ostensibly without regard to shippers' previous behaviors.
... Utilising vehicle capacity (truckload) for shipping orders from suppliers may yield significant cost savings to the firm. From the practitioners' point of view, service transportation procurement, particularly for TL (full truckload) vehicles, is critical, since it can extensively affect the overall business operating costs (Basu, Subramanian, and Cheikhrouhou 2015). Therefore, considering imperfect quality and vehicle capacity when making decisions, either strategic or tactical, provides an opportunity to further improve operational efficiency. ...
Article
In the current global market, managing supply is not a straightforward process and it becomes even more complex as uncertainty and disruptions occur. In order to mitigate their impact, the selection of suppliers of strategic items should have a more holistic view of the operations in the supply chain. We propose an integrated model for supplier selection, considering inventory management and inbound transportation. We approach this problem, incorporating stochastic demand and suppliers' imperfect quality. Imperfect quality triggers additional costs, including external failure and holding costs. Supply disruptions also affect the suppliers' lead time, resulting in delivery delays. We develop a methodology to address this challenge with simulation-optimisation. A genetic algorithm determines supplier selection decisions, while inventory decisions are computed analytically. Discrete-event simulation is used to evaluate the overall performance, as well as to update the lead time dynamically, according to the disruptions. Finally, sensitivity analysis providing managerial insights reveals that criteria in supplier selection should be given a different priority depending on the characteristics of the items, and the effectiveness of disruption mitigation strategies depends on the disruption characteristics.
... Plummer (2003) explores how carriers offer price discounts when submitting package bids vis-à-vis single lane bids in combinatorial auctions. Scott (2018) reports that small asset-based carriers place less frequent bids on spot auctions but when they do bid, their prices are low relative to 1 Our review excludes studies that discuss broader procurement issues (Basu et al. 2015) such as the use of combinatorial auctions (Caplice 2007;Sheffi 2003, 2006;Ledyard et al. 2002;Sheffi 2004;Song and Regan 2003), electronic marketplaces (Lin et al. 2002), and how to execute brokerage operations (Huang et al. 2011;Mahmassani 2015, 2017;Lindsey et al. 2014). We also do not review studies that examine developing freight futures for spot truckload shipments (Tibben-Lembke and Rogers 2006; Tsai et al. 2009Tsai et al. , 2011. ...
Article
Most truckload freight in the United States is priced using long‐term contracts. It is widely recognized in industry that contract prices evolve based on prices shippers pay for one‐time spot market transactions. This research examines whether the impact of spot market prices on contract prices has become more pronounced following the start of the electronic logging device (ELD) mandate. We draw on economic theories regarding how firms process information to explain why the ELD mandate, by reducing carriers’ ability to artificially adjust capacity up or down as spot prices changed, should strengthen this relationship. To test this prediction, we construct a database that combines monthly proprietary spot market pricing data from DAT Solutions with monthly public contract pricing data from the Bureau of Labor Statistics. We test our predictions using time series regression and evaluate the robustness of our findings using both instrumental variable estimation and seemingly unrelated regression to rule out reverse causality. Consistent with our theorizing, we further this relationship has become more pronounced since the ELD mandate started. We explain the importance of these findings to theory and practice.
... Combes [35] presented an analysis of inventory theory and freight transport modeling. Basu et al. [36] presented a review of the literature on full truckload transportation service procurement and provided a framework. Meersman et al. [37] investigated the importance and challenges on international freight transportation models. ...
Article
Full-text available
This article addresses the supplier selection and order quantity allocation problem. It introduces a model to minimize the total cost per time unit considering inventory and transportation costs. In selecting suppliers, two feasibility constraints are considered: capacity and perfect rate. The acceptable perfect rate of raw materials is ensured with a mathematical inequality in the model constraints. The proposed model addresses the desired perfect rate by including it as part of the order cycle parameters calculation and not as an individual constraint. Two main advantages of the proposed model are: (i) it leads to lower cost solutions compared to an existing model; and (ii) it effectively faces the low perfect rate situation, by providing feasible solutions when the perfect rate of suppliers is smaller than the minimum acceptable perfect rate required by the customer. A sensitivity analysis was carried out on the proposed model to analyze the effect of some parameters on the total cost per time unit. Results showed that transportation costs have an important effect on the order quantity and, also, that price levels do not necessarily affect the amount of purchased units. Hence the importance of considering transportation costs when making order quantity allocation decisions.
... Ye et al. [43] studied the winner determination and task allocation problem in a transportation procurement auction considering allocation fairness. Basu et al. [3] provided an extensive review of the related literature. Different from the above research, we study the design problem of multi-attribute multi-unit auction for transport/logistics service procurement when carriers have multi-unit supplies. ...
Article
This paper studies optimal efficient multi-attribute (price, delivery time, and service quality) transportation procurement auction design, given that the carriers have multi-unit supplies. A shipper wants to procure a certain amount of transportation service from a set of potential carriers that have private information on their own unit costs, transportation time, supply capacity, and service quality. We propose an auction to minimize the total cost incurred from procurement, delivery delay, and low service quality. We show that the auction is incentive-compatible, individually-rational, and allocative-efficient. Moreover, we discuss the optimality of the mechanism and show that it minimizes the shipper's expected cost among all the efficient mechanisms that are incentive-compatible and individually-rational. This study is the first that proposes an optimal and efficient multi-attribute multi-unit auction for transportation procurement in the setting where the carriers have multi-unit supplies and their capacity information is private.
Article
Full-text available
This paper provides a literature review of freight transportation service procurement and investigates the challenges and opportunities regarding transportation organization and procurement mechanism design in the context of E-commerce. A total of 78 articles published in academic journals between 1998 and 2017 were reviewed. A framework comprising seven classification criteria is proposed to analyze the articles. The results reveal that new business environments challenge the efficiency and effectiveness of the current leading procurement mechanisms. This work also identifies the trends and gaps from the viewpoints of practitioners and researchers and describes future prospects in new freight transportation markets and organizations.
Article
Full-text available
The performance of different sequential auction settings for the procurement of truckload services is compared. In this environment, demands arrive randomly over time and are described by pickup and delivery locations and hard time windows. When loads arrive, carriers compete for their transport. Different auction and information disclosure settings are studied. Learning methodologies are discussed and analyzed. Simulation results are presented.
Article
Full-text available
In this paper, vehicle microscopic simulation and emission models were combined with an air pollutant dispersion model and a health assessment tool to quantify some social costs resulting from urban freight transportation in the Alameda corridor that links the Ports of Los Angeles and Long Beach to downtown Los Angeles. Traffic on two busy freeways, the I-710 and the I-110, and some heavily trafficked arterial roads was analyzed to estimate the health impacts caused by drayage truck emissions of particulate matter (PM) for four different years: 2005, which serves as a baseline for various pollution inventories, as well as 2008, 2010 and 2012. These years correspond to deadlines for the Clean Truck Program (CTP), which was put in place to improve air quality in the Alameda corridor. Results show that the health costs from particulate matter (PM) emitted by drayage trucks exceeded 440 million dollars in 2005. However, these costs decreased by 36%, 90%, and 96% after accounting for the requirements of the 2008, 2010, and 2012 CTP deadlines. These results quantify the magnitude of the social costs generated by drayage trucks in the Alameda corridor, suggest that these costs justified replacing drayage trucks operating there, and indicate that the Clean Truck Program likely exceeded its target.
Article
Full-text available
In this thesis, we examine the use of sequential auctions for the dynamic allocation of transportation jobs. For all players, buyers and sellers, we develop strategies and examine their performance both in terms of individual benefits and with respect to the global logistical performance (resource utilization and delivery reliability).
Article
Most of the EPC contractors operate today based on construction driven schedules. The material/equipment should reach the site not only in time but in the correct sequence required for construction. This requires elaborate material movement planning and co-ordination efforts.
Article
This paper presents a double auction model to study transportation service procurement (TSP) in a dynamic single-lane transportation environment. Although this paper is motivated by a third-party logistics e-marketplace, the underlying model is applicable in the general bilateral exchange contexts. We first address TSP in a transportation spot market with stochastic but balanced or “symmetric” demand and supply. A periodic sealed double auction (PSDA) is proposed for TSP. Using a packing approach that considers possible bids and/or asks in an integral manner, we then devise a modified PSDA (M-PSDA) to address TSP with “asymmetric” demand and supply. We show that both PSDA and M-PSDA realize incentive compatibility and asymptotic efficiency. Also, the auctioneer is likely to gain higher profits from PSDA with a relatively short auction length. Under asymmetric demand and supply, this optimal auction length increases with the degree of supply–demand imbalance. However, it is optimal to run the auction (either PSDA or M-PSDA) with a relatively large auction length, when maximizing either the social welfare or the utility of shippers and carriers (agents). Finally, when the degree of supply–demand imbalance is low, the auctioneer’s myopic optimal expected profit per unit of time under supply–demand imbalance is larger than that under symmetric demand and supply. But the agents’ expected utility per unit of time under supply–demand imbalance significantly decreases when the degree of supply–demand imbalance increases, thereby resulting in a lower market efficiency.
Article
This paper analyzes an integrated inventory control and transportation problem with environmental considerations. Particularly, explicit transportation modeling is included with inventory control decisions to capture per truck costs and per truck capacities. Furthermore, a carbon cap constraint on the total emissions is formulated by considering emission characteristics of various trucks that can be used for inbound transportation. Due to complexity of the resulting optimization problem, a heuristic search method is proposed based on the properties of the problem. Numerical studies illustrate the efficiency of the proposed method. Furthermore, numerical examples are presented to show that both costs and emissions can be reduced by considering heterogeneous trucks for inbound transportation.
Article
There has been a growing interest in understanding how firms allocate their trucks across hauls, and how this allocation changes under various economic environments. This study investigates how variations in route/haul, carrier and vehicle characteristics affect the optimal vehicle size choice and the associated choice of shipment size. We show that the two choices are derived from the same optimization problem. There can be a continuum of shipment sizes, but decision-makers in freight transport have to choose from a limited number of vehicle alternatives. Therefore, we use a discrete–continuous econometric model where shipment size is modeled as a continuous variable, and vehicle size/type choice as a discrete variable. The results indicate that when faced with higher demand, and during longer trips firms are more likely to use heavier vehicles and ship in larger quantities which suggest that firms are realizing economies of scale and economies of distance. The study also discusses the effect of vehicle operating cost on the vehicle selection process and its policy implications.
Article
To survive under the ever increasing competitive and global pressures to operate more efficiently, transportation companies are obliged to adopt a collaborative focus. Various types of cooperative supply chain relationships have been discussed in both professional and academic literature over the last decades. However, research on horizontal cooperation in logistics remains scarce and scattered across various research domains. Companies operating at the same level of the supply chain and performing comparable logistics functions may cooperate horizontally to increase their productivity, improve their service level and enhance their market position. In this paper, the focus is on the operational planning of horizontal cooperations between road transportation carriers. Following a scientific literature review, a distinction may be made between two operational approaches to horizontal logistics collaboration: order sharing and capacity sharing. For both research streams, a detailed overview of solution techniques proposed in literature is presented. Moreover, some interesting opportunities for future research are identified.
Article
Many large shippers procure truckload (TL) service from carriers via a combinatorial auction. In order to determine the winners of the auction, they need to solve a combinatorial optimization problem known as winner determination problem (WDP). In practice, shippers must resolve the WDP under shipment volume uncertainty due to limited information of future demands. In this paper, we propose a sampling-based two-stage stochastic programming approach to solve WDP under shipment volume uncertainty. We propose a refined formulation of deterministic WDPs in which shortage in shipments and the associated penalty cost are explicitly modeled. We demonstrate that the refined model is more general and more feasible under uncertainty than the benchmarks. Theoretical results pertaining to problem feasibility are derived and their insights to TL service procurement are provided. We propose a sampling-based solution approach called Monte Carlo Approximation (MCA) and use numerical tests to show that MCA is numerically tractable for solving moderately sized instances of TL service procurement. Finally, we verify via Monte Carlo simulation that the solution to our proposed stochastic WDP yields lower procurement cost than the solution to the deterministic WDP.
Article
In lean and demand-responsive logistics systems, orders need to be delivered rapidly, accurately, and reliably, even under demand uncertainty. Increasing burdens on the industry motivate the introduction of new methods to manage transportation service contracts. One way to hedge transportation capacity and cost volatility is to create derivative contracts. To date, ocean transportation is the only mode of transportation where this type of contract has been applied. The purpose of this article is to provide an overview of freight transportation derivatives and to discuss some recent relevant research. We start by introducing the theory underlying derivative contracts, before reviewing the development of derivatives markets in the maritime industry. We then investigate the adoption of derivatives contracts in trucking (the dominant mode of freight transportation), which we call truckload options. A numerical example follows to illustrate how derivatives could help financially both shippers and carriers. Finally, this article discusses the conditions necessary for the emergence of a market for truckload options.