Open Access
This article is

- freely available
- re-usable

*Sustainability*
**2017**,
*9*(9),
1675;
doi:10.3390/su9091675

Article

Shipment Consolidation Policy under Uncertainty of Customer Order for Sustainable Supply Chain Management

^{1}

Graduate School of Information Security, Korea University, Seongbuk-gu, Seoul 02841, Korea

^{2}

Graduate School of Management of Technology, Korea University, Seongbuk-gu, Seoul 02841, Korea

^{3}

Graduate School of Industrial Management Engineering, Korea University, Seongbuk-gu, Seoul 02841, Korea

^{4}

Division of Industrial Management Engineering, Korea University, Seongbuk-gu, Seoul 02841, Korea

^{*}

Author to whom correspondence should be addressed.

Received: 26 August 2017 / Accepted: 18 September 2017 / Published: 20 September 2017

## Abstract

**:**

With increasing concern over the environment, shipment consolidation has become one of a main initiative to reduce CO

_{2}emissions and transportation cost among the logistics service providers. Increased delivery time caused by shipment consolidation may lead to customer’s order cancellation. Thus, order cancellation should be considered as a factor in order uncertainty to determine the optimal shipment consolidation policy. We develop mathematical models for quantity-based and time-based policies and obtain optimality properties for the models. Efficient algorithms using optimal properties are provided to compute the optimal parameters for ordering and shipment decisions. To compare the performances of the quantity-based policy with the time-based policy, extensive numerical experiments are conducted, and the total cost is compared.Keywords:

inventory control; shipment consolidation; quantity-based policy; order cancellation## 1. Introduction

With increasing concern over the environment, many companies worldwide are improving their supply chain sustainability under pressure from the government or from their own shareholders [1]. In logistics systems, transportation is considered to be the largest source of environmental hazards [2]. The smart use of logistics systems has much to offer in greening the supply chain by means of various efficient distribution and transportation strategies. Shipment consolidation is one of a main initiative toward environmental sustainability among the logistics service providers [3].

Shipment consolidation is a transportation strategy that can reduce environmental hazards. “Shipment consolidation is a logistics strategy that combines two or more orders or shipments so that a larger quantity can be dispatched on the same vehicle” [4]. The main motivation for shipment consolidation is decreased unit dispatch cost due to economies of scale in transportation. Shipment consolidation can also reduce adverse environmental impacts of business processes, as it can reduce harmful emissions affecting air quality, such as CO

_{2}, emitted from delivery vehicle exhausts [5]. Moreover, shipment consolidation could accelerate corporate social responsibility performance [6].Shipment consolidation strategy should be chosen in state of supply chain coordination [7]. To keep up with this trend, integrated policies with transportation decision and inventory control have been studied. Shipment consolidation does not always decrease a firm’s cost. Delivery time and inventory holding time increase while several small orders are consolidated into a larger shipment. Many recent e-commerce providers such as 11 Street, the largest e-commerce provider in South Korea, allow order cancellation if order is not yet shipped for the sake of better customer service. Since better customer service results in higher customer satisfaction, and since customer satisfaction leads to customer loyalty and profitability [8], allowing order cancellation, whether from a flood of information about goods and prices shared among customers or from simple changes of customers’ opinion, is beneficial for companies in the long term, even at the cost of increased order uncertainty. Since uncertainty is caused by many factors including inventory management, vendor selection, transport planning, production planning, distribution planning, and procurement planning, it thus is important to understand, manage, and reduce uncertainty in supply chain to improve performance [9]. Hence, such trade-offs must be considered when making decisions about shipment consolidation [10].

Previous studies on shipment consolidation do not consider order cancellation due to longer delivery time. Thus, it is assumed that all customers are willing to wait during shipment consolidation, and all orders would be met. However, impatient customers may cancel their orders when delivery time increases [11], and delivery time uncertainty decreases customer satisfaction [12]. There is a trade-off between minimizing the cost of having a customer to wait and the cost of providing service [13]. Thus, the order cancellation needs to be considered in shipment consolidation policy.

In this paper, we consider order cancellation scheme and develop both quantity-based shipment consolidation policy and time-based shipment consolidation policy to minimize the total cost incurred and to reduce environmental hazards such as CO

_{2}emission caused during transportation. In addition, we analyze the results of both policies and assess the effects of dispatch cost and order cancellation cost on total cost for each increment to provide basis for managerial decision making under each of both policies.This paper is organized as follows: Section 2 provides an overview of shipment consolidation and inventory policy under order cancellation literature. In Section 3, we developed quantity-based and time-based policies by incorporating order cancellation to minimize the total cost with consideration of environmental cost. Mathematical models are developed and efficient algorithms are provided to obtain the optimal parameters for the proposed policies. To gain further insight, in Section 4, we conducted computational experiments and analyze the sensitivity of the optimal decisions with respect to the model parameters. In addition, to compare the performances of the quantity-based policy with the time-based policy, extensive numerical experiments are conducted, and the total cost is compared. Our conclusions are provided in Section 5.

## 2. Literature Review

Over the last two decades, environmental or “green” factors have become increasingly incorporated into analyses in supply chain management [14]. In addition, recent global markets are greatly affected by swift changes in technology and customer demand, which cause shorter product life cycle that result in increased uncertainty of supply chain, requiring adequate control of risks to minimize uncertainty [15]. Such situation puts more emphasis on “green” factor than ever before, resulting many logistics companies to realize the value of greening their operations. For example, Wal-Mart, the world’s biggest retailer, undertook a green supply chain management (GSCM) project and asked its 60,000 suppliers worldwide to reduce their use of packaging by 5%, which amounts to removing 667,000 ${\mathrm{m}}^{3}$ of CO

_{2}from the air and 213,000 trucks from the road, resulting in a huge savings of $3.4 billion [16]. In the scope of environmental sustainability, much focus has been given to greenhouse gas (GHG) emission, particularly carbon dioxide (CO_{2}) emissions [17]. Radio Frequency Identification (RFID) technology is a good example that can be applied to such case for more information regarding sustainability since introducing RFID benefits supply chain for all of its echelons by effectively controlling uncertainties and complexities, which in this case is greenhouse gas emission [18]. However, adopting RFID technology does not necessarily result in improvement since feasibility study may turn out to be negative in some cases [19]. Thus, different approach is needed to acquire sustainability in transportation.Motivated by the apparent importance of reducing environmental damage caused by transportation, many studies explored the impact of shipment consolidation. McKinnon [20] surveyed opportunities to improve the use of road vehicles and suggested that the impact of freight transportation on the environment can be reduced by “increasing the share of freight moved in less environmentally damaging ways, by increasing vehicle load factors”. He reported that increasing truck load, such as shipment consolidation, could yield greater environmental benefits than a modal shift. He also showed that increasing the maximum truck weight can further yield economic and environmental benefits. Merrick and Bookbinder [21] reported the reduction of CO

_{2}emissions caused by the shipment consolidation. The finding showed that, for any given speed, the quantity of CO_{2}emissions is a concave increasing function of consolidated load's weight. Furthermore, Pan et al. [22] show that the consolidation of truck freight among supply chains (namely pooling supply chains) can be a solution to significantly reduce CO_{2}emissions and transportation cost.In industry, two different types of shipment consolidation policies are commonly used: quantity-based and time-based [23]. In addition, in general, consolidation policies are differentiated into these two policies by many existing literature, and each of the two policies has distinctive characteristics [24]. The quantity-based policy ships accumulated loads when a predetermined economical dispatch quantity, is accumulated, whereas the time-based policy ships accumulated loads (all outstanding orders) every period. Under the time-based policy, each order is dispatched on pre-specified shipment release dates, even if the dispatch quantity does not necessarily satisfy transportation scale economies. On the other hand, under the quantity-based policy, the dispatch quantity assures transportation scale economies, but a specific dispatch time cannot be guaranteed. An alternative to these two policies is a hybrid policy aimed at balancing the trade-offs between the timely delivery of the time-based policy and the transportation cost savings associated with the quantity-based policy. Under the hybrid policy, a dispatch decision is made either when the size of a consolidated load exceeds pre-specified dispatch quantity, or when the time since the last dispatch exceeds pre-specified dispatch time.

Cetinkaya and Bookbinder [25], Chen et al. [26], Cetinkaya and Lee [27], Moon et al. [28], Ching and Tai [29], and Cetinkaya et al. [23] have developed the optimization models for shipment consolidation. For the demand arrival following a Poisson process, Cetinkaya and Bookbinder [25], and Chen et al. [26] have developed the optimal quantity based policy. Cetinkaya and Lee [27] present an optimization model for coordinating inventory and transportation decisions at an outbound distribution warehouse that serves a group of customers located in a given market. Moon et al. [28] developed joint replenishment and consolidated freight delivery policies for a TPW that handles multiple items. They extended the results of Cetinkaya and Lee [27] to consider the joint replenishment of multiple items and introduce two time-based policies (stationary policy and non-stationary policy) for the warehouse. The optimal hybrid dispatch policy with stochastic demand is studied by Ching and Tai [29] and Cetinkaya et al. [23]. They analyzed the advantages and the disadvantages of the quantity-based policy and the time-based policy, and they proposed hybrid policies since combination of the two most popular policies (quantity-based and time-based) in logistics literature may yield another option for consolidation policy. However, it is found that hybrid policies are not superior to quantity-based policies when resulting cost is the variable on comparison [23]. Günther and Seiler [30] investigated an operational transportation planning problem based on a real industry case on shipment consolidation.

Recently, ÜLKÜ and Bookbinder [31] investigated the effects of different pricing schemes for a Third Party Logistics (3PL) provider who tenders a consolidated load to a carrier. They present an optimization model for integrating pricing and transportation decisions, and they derive the optimal quotations that should be made for price and delivery time with the objective of maximizing the profit. Mutlu et al. [32] investigated pure consolidation problem that can be confronted by a 3PL company and found a special case of time-and-quantity-based policy, which is quantity-based policy, is the optimal policy in terms of cost. Hong and Lee [33] considered a single-item inventory system where shipments are consolidated to reduce the transportation cost using a time-based consolidation policy. They showed that additional profit can be obtained using shipment consolidation policy. Centinkaya et al. [34] examined the trade-off between average order delay and expected delivery frequency, as measured by the expected shipment consolidation cycle length. They proposed service-based performance criteria such as maximum waiting time and average order delay and compared the performance of shipment consolidation policies. Cetinkaya and Lee [35] also extensively computed time-based consolidation policy by incorporating replenishment quantity, which is presented as a basis for future analytical work. However, these previous studies on shipment consolidation have assumed that all customers are willing to wait during shipment consolidation and that all orders would be met. However, in real life, customers may cancel their orders when delivery time increases. Thus, the order cancellation should be considered to determine the optimal shipment consolidation policy. Unlike the existing research on shipment consolidation, we develop the optimization models to determine the optimal shipment consolidation policies with consideration of order cancellation.

Generally, there is a dearth of literature considering the impact of demand cancellation on the optimal ordering policy of the inventory model. Cheung and Zhang [36] study the impact of cancellation of customer orders via assuming an (s, S) policy and Poisson demands. They develop a Bernoulli type cancellation behavior in which a reservation will be canceled with probability p. In addition, the timing to cancellation is considered. In particular, they show that a stochastically larger elapsed time from reservation to cancellation increases the system’s penalty and holding costs. Yuan and Cheung [37] consider a periodic review inventory model in which all demands are reserved with one-period lead time, but orders can be canceled during the reservation period. They formulated a dynamic programming model and show that the order-up-to policy is optimal. You [38] investigates a joint ordering and pricing problem for a single period model in which the system sells perishable products over a short sales season. He proves that the optimal ordering policy has an order-up-to structure. You and Hsieh [39] develop a continuous time model to determine the production level and pricing decision by considering constant rate of demand cancellation. They formulate a system of differential equations for inventory level so that holding cost and penalty cost can be calculated. Recently, Yeo and Yuan [40] consider a periodic review model where the firm manages its inventory under supply uncertainty and demand cancellation, and they explore the structure of the optimal inventory policy in the presence of demand cancellation and supply uncertainty in the multiple period framework. However, they did not address the impact of cancellation on the optimal cost of managing the system. These models did not consider outbound shipment scheduling. Our study differs from these models in that we consider shipment consolidation and obtain the optimal shipment policy.

In this paper, we consider a single-item inventory system where shipments are consolidated to reduce the transportation cost, and we develop optimization models where the shipment and ordering policies are optimized all together. In addition, we conduct sensitivity analysis for a couple of variables to find optimal zone where total cost is not heavily impacted by variability.

## 3. Mathematical Models

#### 3.1. Quantity-Based Policy to Consideration of Order Cancellation

In this study, we consider an inventory system operated by a shipment consolidation policy. The time between two successive dispatch decisions is called a dispatch cycle, and all orders arriving during a dispatch cycle are combined to form a large outbound load. In order to employ a shipment consolidation, we assume that the customer order fulfillment may be postponed during a dispatch cycle. However, the postponement of order may result in customer waiting. This postponement has negative impact on customer demand. Thus, the customer may cancel the order.

In this paper, we assume that each customer requests one unit of the product, and the demand arrives according to a Poisson process with mean λ. We also assume that the shipment cost is irrespective of the customer location (transportation distance). In this paper, we assume that the delivery lead time is negligible (i.e., customers are located in a relatively close proximity). Under this assumption, the shipment cost consists of a fixed cost of hiring trucks (or other transportation means) and a variable cost that is determined by volume, not by distance.

The following notations are employed in this study:

- ${F}_{R}$: fixed cost of replenish inventory
- ${C}_{R}$: unit replenish cost
- ${F}_{D}$: fixed cost of dispatching shipment to customer
- ${C}_{D}$: unit dispatch cost
- $h$: holding cost per unit per unit time
- $\lambda $: Poisson demand rate
- ${O}_{c}$: order cancellation cost per unit
- $\gamma $: order cancellation rate per unit time ($0<\gamma <1$)
- ${C}_{E}$: unit environmental cost during dispatch

In this section, we present a mathematical model for optimal quantity-based dispatch policy. Figure 1 shows the inventory level under the quantity-based dispatch policy. Note that accumulated loads are shipped after economic freight quantity is accumulated in a quantity-based policy.

The following additional notations are employed in the quantity-based dispatch policy:

- $q$: dispatch quantity (integer, decision variable, $1\le q$)
- $n$: number of dispatch cycles within an inventory replenishment cycle (integer, decision variable, $1\le n$)
- $Q$: replenishment quantity ($Q=nq$)

During a dispatch cycle, customers may cancel their orders (we assume that order cancellation occurs in proportion to remaining order quantity for every unit time). The remaining order quantity is $q(1-\gamma )$ at the first unit time after the beginning of a dispatch cycle, $q(1-\gamma )(1-\gamma )$ at the second unit time, and $q{(1-\gamma )}^{q/\lambda}$ at the end of dispatch cycle (note that $q/\lambda $ is dispatch cycle time). Thus, when the sum of received order’s quantity reaches the dispatch quantity (q), units that a vendor should ship to customer are $q{(1-\gamma )}^{q/\lambda}$. When the inventory level reaches zero, stock is replenished.

As a result, the problem is to compute the optimal number of dispatch cycles within a replenishment cycle, n, and the optimal dispatch quantity, q, in order to minimize the total cost.

As shown in Figure 1, the process under consideration is a renewal process. Thus, using the Renewal Reward Theorem, the long-run average cost, $TC(n,q)$, is determined by dividing E(Replenishment Cycle Cost) by E(Replenishment Cycle Length).

Since demand process is a Poisson process, the expectation of the dispatch cycle length is $q/\lambda $. Since the number of dispatch cycles within an inventory replenishment cycle is n, the expectation of the replenishment cycle length is:

$$E(ReplenishmentCycleLength)=nq/\lambda $$

We now compute four different cost elements (replenishment, dispatch, inventory holding, and order cancellation) during a replenishment cycle:

**Order Cancellation Cost**: Since the company will not dispatch its products until q units of demand accumulate, the order cancellation rate is $[1-{(1-\gamma )}^{q/\lambda}]$. Thus, the order cancellation cost per dispatch cycle is ${O}_{c}\cdot q[1-{(1-\gamma )}^{q/\lambda}]$. Since there are n dispatch cycles in a replenishment cycle, the customer waiting cost per replenishment cycle is:$$OrderCancellationCost=n\cdot {O}_{c}\cdot q\left[1-{(1-\gamma )}^{q/\lambda}\right]$$**Replenishment Cost**: Since the replenishment quantity, Q, is equal to $nq{(1-\gamma )}^{q/\lambda}$ (see Figure 1), the replenishment cost is:$$ReplenishmentCost={F}_{R}+{C}_{R}\cdot nq{(1-\gamma )}^{q/\lambda}$$**Dispatch Cost**: Since the dispatch quantity is $q{(1-\gamma )}^{q/\lambda}$, the dispatch cost in a dispatch cycle is ${F}_{D}+{C}_{D}\cdot q{(1-\gamma )}^{q/\lambda}$. There are n dispatch cycles during a replenishment cycle, and, thus, the dispatch cost during the cycle is:$$DispatchCost=n\left[{F}_{D}+{C}_{D}\cdot q{(1-\gamma )}^{q/\lambda}\right]$$**Inventory Holding Cost**: At the beginning of a replenishment cycle, the inventory level is $(n-1)q{(1-\gamma )}^{q/\lambda}$. This implies that the inventory level is kept at $(n-1)q{(1-\gamma )}^{q/\lambda}$ throughout the first dispatch cycle, and incurs expected holding cost of $h\cdot (n-1)q{(1-\gamma )}^{q/\lambda}\cdot q/\lambda $. For the ith dispatch cycle, the expected holding cost is $h\cdot (n-i)q{(1-\gamma )}^{q/\lambda}\cdot q/\lambda $. Hence, the total expected inventory holding cost is given by:$$\begin{array}{l}InventoryHoldingCost={\displaystyle \sum _{i=1}^{n-1}\left[h\cdot (n-i)q{(1-\gamma )}^{q/\lambda}\cdot q/\lambda \right]}\\ =\frac{h\cdot n(n-1)\cdot {q}^{2}{(1-\gamma )}^{q/\lambda}}{2\lambda}\end{array}$$Using the above results, the expected cost during a replenishment cycle is computed by:$$\begin{array}{l}E(ReplenishmentCycleCost)=\left[{F}_{R}+{C}_{R}\cdot nq{(1-\gamma )}^{q/\lambda}\right]+n\left[{F}_{D}+{C}_{D}\cdot q{(1-\gamma )}^{q/\lambda}\right]+\\ \frac{h\cdot n(n-1)\cdot {q}^{2}{(1-\gamma )}^{q/\lambda}}{2\lambda}+n\cdot {O}_{c}\cdot q\left[1-{(1-\gamma )}^{q/\lambda}\right]\end{array}$$Conversely, the expression for the long-run average profit, $TP(\hspace{0.17em}n,\hspace{0.17em}q)$, is given by:$$\begin{array}{l}TC(n,q)=\frac{\begin{array}{l}\left[{F}_{R}+{C}_{R}\cdot nq{(1-\gamma )}^{q/\lambda}\right]+n\left[{F}_{D}+{C}_{D}\cdot q{(1-\gamma )}^{q/\lambda}\right]+\\ \frac{h\cdot n(n-1)\cdot {q}^{2}{(1-\gamma )}^{q/\lambda}}{2\lambda}+n\cdot {O}_{c}\cdot q\left[1-{(1-\gamma )}^{q/\lambda}\right]\end{array}}{nq/\lambda}\\ =\frac{{F}_{R}\lambda}{nq}+{C}_{R}\lambda {(1-\gamma )}^{q/\lambda}+\frac{{F}_{D}\lambda}{q}+{C}_{D}\lambda {(1-\gamma )}^{q/\lambda}+\\ \frac{h(n-1)q{(1-\gamma )}^{q/\lambda}}{2}+{O}_{c}\cdot \lambda \cdot \left[1-{(1-\gamma )}^{q/\lambda}\right]\end{array}$$

We assume that the environmental cost mainly depends on carbon emission during transportation, and we assume carbon emission is linear to loads transported. Since the dispatch quantity is $q{(1-\gamma )}^{q/\lambda}$ and the dispatch cycle is $q/\lambda $, the long-run average environmental cost is ${C}_{E}$·$q{(1-\gamma )}^{q/\lambda}$/($q/\lambda $). Hence, the long-run average cost with consideration of environmental cost, $T{C}_{e}(n,q)$, is given by:

$$\begin{array}{l}T{C}_{e}(n,q)={C}_{E}\cdot q{(1-\gamma )}^{q/\lambda}/(q/\lambda )+TC(n,q)\\ \hspace{1em}\hspace{1em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}=\frac{{F}_{R}\lambda}{nq}+{C}_{R}\lambda {(1-\gamma )}^{q/\lambda}+\frac{{F}_{D}\lambda}{q}+({C}_{E}+{C}_{D})\lambda {(1-\gamma )}^{q/\lambda}+\\ \hspace{1em}\hspace{1em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\frac{h(n-1)q{(1-\gamma )}^{q/\lambda}}{2}+{O}_{c}\cdot \lambda \cdot \left[1-{(1-\gamma )}^{q/\lambda}\right]\end{array}$$

For the sake of simplicity, we substitute ${C}_{{D}^{\prime}}={C}_{E}+{C}_{D}$, and the expected long-run average cost with the consideration of environmental cost is:

$$\begin{array}{l}TCe(n,q)=\frac{{F}_{R}\lambda}{nq}+{C}_{R}\lambda {(1-\gamma )}^{q/\lambda}+\frac{{F}_{D}\lambda}{q}+{C}_{{D}^{\prime}}\lambda {(1-\gamma )}^{q/\lambda}+\\ \hspace{1em}\hspace{1em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\frac{h(n-1)q{(1-\gamma )}^{q/\lambda}}{2}+{O}_{c}\cdot \lambda \cdot \left[1-{(1-\gamma )}^{q/\lambda}\right]\end{array}$$

The value of n and q that minimizes the total cost per unit time follows the optimality conditions below.

**Lemma**

**1.**

For a given value of q, the optimal value of n always satisfies the following condition:

$${n}^{*}({n}^{*}-1)\le \frac{2{F}_{R}\lambda}{h{q}^{2}{(1-\gamma )}^{q/\lambda}}\le {n}^{*}({n}^{*}+1)$$

**Proof.**

For given values of q, the optimal value of n always satisfies the following:

$$TCe({n}^{*}-1)\ge TCe({n}^{*})\mathrm{and}TCe({n}^{*}+1)\ge TCe({n}^{*})$$

Using Equation (7), an optimality condition for n is:
$${n}^{*}({n}^{*}-1)\le \frac{2{F}_{R}\lambda}{h{q}^{2}{(1-\gamma )}^{q/\lambda}}\le {n}^{*}({n}^{*}+1)$$

**Lemma**

**2.**

The upper bound of n satisfies the following condition:
where ${n}_{\mathrm{max}}$ denotes the upper bound of n.

$${n}_{\mathrm{max}}({n}_{\mathrm{max}}-1)\le \frac{2{F}_{R}\lambda}{h{(1-\gamma )}^{1/\lambda}}\le {n}_{\mathrm{max}}({n}_{\mathrm{max}}+1)$$

**Proof.**

The value $\frac{2{F}_{R}\lambda}{h{q}^{2}{(1-\gamma )}^{q/\lambda}}$ in Equation (10) is a non-increasing function of q. Thus, the maximum value of possible n is determined when q = 1.

**Lemma**

**3.**

For a given value n, the total cost function is a convex function of q. Thus, the optimal dispatch quantity, q, is obtained by taking the first order derivative of the total profit function.

**Proof.**

Taking the first order and the second order partial derivatives of Equation (7) with respect to q, we have:

$$\begin{array}{l}\frac{\partial T{C}_{e}(n,q)}{\partial q}=-\frac{{F}_{R}\lambda}{n{q}^{2}}-\frac{{F}_{D}\lambda}{{q}^{2}}+\frac{h(n-1){(1-\gamma )}^{q/\lambda}}{2}\\ \hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}+\frac{h(n-1)q{(1-\gamma )}^{q/\lambda}}{2}\mathrm{ln}{(1-\gamma )}^{1/\lambda}+({C}_{R}+{C}_{{D}^{\prime}}+{O}_{c})\cdot \lambda \cdot {(1-\gamma )}^{q/\lambda}\mathrm{ln}{(1-\gamma )}^{1/\lambda}\end{array}$$

$$\begin{array}{l}\frac{{\partial}^{2}T{C}_{e}(n,q)}{\partial {q}^{2}}=\frac{2{F}_{R}\lambda}{n{q}^{3}}+\frac{2{F}_{D}\lambda}{{q}^{3}}+h(n-1){(1-\gamma )}^{q/\lambda}\mathrm{ln}{(1-\gamma )}^{1/\lambda}\left[1+\frac{q\mathrm{ln}{(1-\gamma )}^{1/\lambda}}{2}\right]\\ \hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}+({C}_{R}+{C}_{{D}^{\prime}}-{O}_{c})\cdot \lambda \cdot {(1-\gamma )}^{q/\lambda}{[\mathrm{ln}{(1-\gamma )}^{1/\lambda}]}^{2}\end{array}$$

Since the second order derivative is always larger than zero, $T{C}_{e}(n,q)$ is convex with respect to q for a given value of n.

Using the above optimality conditions, we develop a simple enumeration algorithm to obtain the optimal parameters for the proposed policy. The simple enumeration algorithm always guarantees the optimal solution. The procedure is as follows.

- The simple enumeration algorithm (SEA_Q)

Step 1: Compute the upper bound of n using Equation (11).

Step 2: For all $n(n=1,\dots {n}_{\mathrm{max}})$, compute the optimal q using Lemma 3.

Step 3: For given combination of n and q, compute the total cost $T{C}_{e}(n,q)$ using Equation (9).

Step 4: Select the $(n,q)$ with the minimum $T{C}_{e}(n,q)$.

#### 3.2. Time-Based Policy to Consideration of Order Cancellation

In this section, we present a mathematical model for optimal time-based dispatch policy. Figure 2 shows the inventory level under the time-based dispatch policy. Unlike quantity-based policy, time-based policy ships out accumulated load in every period that is predetermined and can guarantee delivery time. Thus, the amount of accumulation is not fixed.

The following additional notations are employed in the time-based dispatch policy:

- $T$: dispatch cycle time (decision variable)
- $K$: number of dispatch cycles within an inventory replenishment cycle
- $Q$: replenishment quantity (integer, decision variable)
- ${D}_{i}(T)$: demand during dispatch cycles

Figure 2 shows the vendor’s inventory level. Under the time-based policy, a new dispatch cycle starts at every T time unit. During the dispatch cycle (T), customers may cancel their orders (we assume that order cancellation occurs in proportion to remaining order quantity for every unit time). The remaining order quantity in ith T period is ${D}_{i}(T)(1-\gamma )$ at the first unit time after the beginning of a dispatch cycle, ${D}_{i}(T)(1-\gamma )(1-\gamma )$ at the second unit time, and ${D}_{i}(T){(1-\gamma )}^{T}$ at the end of a dispatch cycle (note that T is dispatch cycle time). Thus, when time reaches the end of a dispatch cycle (T), units that a vendor should ship to customers are ${D}_{i}(T){(1-\gamma )}^{T}$.

Let K denote the number of dispatch cycles within a given inventory replenishment cycle. When the inventory level reaches zero, K is computed by:

$$K=\mathrm{inf}\left\{k:{\displaystyle \sum _{i=1}^{k}{D}_{i}(T){(1-\gamma )}^{T}>Q}\right\}$$

The objective is to develop an optimization model to jointly determine the optimal replenishment quantity, Q, and the optimal dispatch cycle, T, in order to minimize the total cost.

We first compute the expected replenishment cycle length. By the definition, K is a random variable representing the number of dispatch cycles within an inventory replenishment cycle. Thus, the expected replenishment cycle length is:

$$E(ReplenishmentCycleLength)=E[K]T$$

We now compute four different cost elements (replenishment, dispatch, inventory holding, and order cancellation) during a replenishment cycle:

**Order Cancellation Cost**: Since the company will not dispatch its products until T units of time lapses, the order cancellation rate is $[1-{\left(1-\gamma \right)}^{T}]$. Thus, the order cancellation cost per dispatch cycle is ${O}_{c}*E\left[{D}_{i}\left(T\right)*\left(1-{\left(1-\gamma \right)}^{T}\right)\right]$. Since there are n dispatch cycles in a replenishment cycle, the customer waiting cost per replenishment cycle is:$$\mathrm{Order}\mathrm{Cancellation}\mathrm{Cost}=E[K]\cdot {O}_{c}\cdot E\left[{D}_{i}(T)\right]\left[1-{(1-\gamma )}^{T}\right]=E[K]\cdot {O}_{c}\cdot \lambda T\left[1-{(1-\gamma )}^{T}\right]$$**Replenishment Cost**: The expected replenishment quantity is equal to the expected total demand within a replenishment cycle (see Figure 2). The expected replenishment cost is computed by:$$\mathrm{Replenishment}\mathrm{Cost}={F}_{R}+{C}_{R}\cdot E[K]\cdot E[{D}_{i}(T)]{(1-\gamma )}^{T}={F}_{R}+{C}_{R}\cdot E[K]\cdot \lambda T{(1-\gamma )}^{T}$$**Dispatch Cost**: The expected dispatch quantity in a dispatch cycle is $E[{D}_{i}(T)]{(1-\gamma )}^{T}$, and the expected dispatch cost in a dispatch cycle is ${F}_{D}+{C}_{D}\cdot E[{D}_{i}(T)]{(1-\gamma )}^{T}$. There are $E[K]$ dispatch cycles during a replenishment cycle, and, thus, the expected dispatch cost during a replenishment cycle is computed by:$$\mathrm{Dispatch}\mathrm{Cost}={F}_{D}\cdot E[K]+{C}_{D}\cdot E[K]\cdot E[{D}_{i}(T)]{(1-\gamma )}^{T}={F}_{D}\cdot E[K]+{C}_{D}\cdot E[K]\cdot \lambda T{(1-\gamma )}^{T}$$**Inventory Holding Cost**: Let I(t) denote the inventory level at time t.$$I(t)=\{\begin{array}{ll}Q& \mathrm{if}\text{}0\le t\le T\\ Q-{D}_{1}(T){(1-\gamma )}^{T}& \mathrm{if}\text{}Tt\le 2T\\ \dots & \\ Q-{\displaystyle {\sum}_{j=1}^{K-1}{D}_{j}(T){(1-\gamma )}^{T}}& \mathrm{if}\text{}(K-1)Tt\le KT\end{array}$$Since holding cost is h, the inventory holding cost is given by:$$InventoryHoldingCost=h\times \left\{E(K)QT-\lambda {T}^{2}{(1-\gamma )}^{T}\frac{E(K)\left[E(K)-1\right]}{2}\right\}$$Using the above results, the expected cost during a replenishment cycle is computed by:$$\begin{array}{l}E(ReplenishmentCycleCost)={F}_{R}+{C}_{R}\cdot E[K]\cdot \lambda T{(1-\gamma )}^{T}+{F}_{D}\cdot E[K]+{C}_{D}\cdot E[K]\cdot \lambda T{(1-\gamma )}^{T}\\ +h\times \left\{E[K]QT-\lambda {T}^{2}{(1-\gamma )}^{T}\frac{E[K]\left[E[K]-1\right]}{2}\right\}+E[K]\cdot {O}_{c}\cdot \lambda T\left[1-{(1-\gamma )}^{T}\right]\end{array}$$Conversely, the expression for the long-run average profit, TP(Q,T), is given by:$$\begin{array}{l}TC(Q,T)=\frac{{F}_{R}}{E[K]T}+{C}_{R}\lambda {(1-\gamma )}^{T}+\frac{{F}_{D}}{T}+{C}_{D}\lambda {(1-\gamma )}^{T}\\ \hspace{0.17em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}+h\times \left\{Q-\frac{\lambda T{(1-\gamma )}^{T}\left[E(K)-1\right]}{2}\right\}+{O}_{c}\lambda \left[1-{(1-\gamma )}^{T}\right]\end{array}$$

**Lemma**

**4.**

A continuous approximation for K is provided by an Erlang random variable with a scale parameter $\lambda T{(1-\gamma )}^{T}$ and a shape parameter Q.

$$E[K]\approx \frac{Q+1}{\lambda T{(1-\gamma )}^{T}}$$

**Proof.**

Let $f(\cdot )$ denote the distribution function of ${D}_{i}(T){(1-\gamma )}^{T}$, and ${f}^{(k)}(\cdot )$ denote the k-fold convolution of $f(\cdot )$. From $K=\mathrm{inf}\left\{k:{\displaystyle \sum _{i=1}^{k}{D}_{i}(T){(1-\gamma )}^{T}>Q}\right\}$, we have $P[K\ge k+1]={f}^{(k)}(Q)$, and thus $P[K\le k]=1-{f}^{(k)}(Q)$. Since $f(\cdot )$ is a Poisson distribution with parameter $\lambda T{(1-\gamma )}^{T}$, k-fold convolution of $f(\cdot )$ is a Poisson distribution with parameter $k\lambda T{(1-\gamma )}^{T}$.

$${f}^{(k)}(Q)={\displaystyle \sum _{i=0}^{Q}\frac{{[k\lambda T{(1-\gamma )}^{T}]}^{i}{e}^{k\lambda T{(1-\gamma )}^{T}}}{i!}}$$

From Equation (23), we can obtain:

$$P[K\le k]=1-{\displaystyle \sum _{i=0}^{Q}\frac{{[k\lambda T{(1-\gamma )}^{T}]}^{i}{e}^{k\lambda T{(1-\gamma )}^{T}}}{i!}},k=1,2,\dots $$

Treating k as a continuous variable, the right hand side of the above expression is a Q-stage Erlang distribution function with parameter $\lambda T{(1-\gamma )}^{T}$ and mean $(Q+1)/\lambda T{(1-\gamma )}^{T}$ (refer to [35]).

From Equations (21) and (22), we obtain:

$$\begin{array}{l}TC(Q,T)=\frac{{F}_{R}\lambda {(1-\gamma )}^{T}}{Q+1}+{C}_{R}\lambda {(1-\gamma )}^{T}+\frac{{F}_{D}}{T}+{C}_{D}\lambda {(1-\gamma )}^{T}\\ \hspace{0.17em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}+h\times \left\{\frac{Q-1+\lambda T{(1-\gamma )}^{T}}{2}\right\}+{O}_{c}\lambda \left[1-{(1-\gamma )}^{T}\right]\end{array}$$

For the sake of simplicity, we substitute $\overline{Q}=Q+1$, and the expected long-run average cost is:

$$\begin{array}{l}TC(\overline{Q},T)=\frac{{F}_{R}\lambda {(1-\gamma )}^{T}}{\overline{Q}}+{C}_{R}\lambda {(1-\gamma )}^{T}+\frac{{F}_{D}}{T}+{C}_{D}\lambda {(1-\gamma )}^{T}\\ \hspace{0.17em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}+h\times \left\{\frac{\overline{Q}-2+\lambda T{(1-\gamma )}^{T}}{2}\right\}+{O}_{c}\lambda \left[1-{(1-\gamma )}^{T}\right]\end{array}$$

Since the dispatch quantity is $\lambda T{(1-\gamma )}^{T}$ and the dispatch cycle is T, the long-run average environmental cost is ${C}_{E}\cdot \lambda T{(1-\gamma )}^{T}/T$. Hence, the long-run average cost with the consideration of environmental cost, $T{C}_{e}(n,q)$, is given by:

$$\begin{array}{l}T{C}_{e}(\overline{Q},T)={C}_{E}\cdot \lambda T{(1-\gamma )}^{T}/T+TC(\overline{Q},T)\\ \hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}=\frac{{F}_{R}\lambda {(1-\gamma )}^{T}}{\overline{Q}}+{C}_{R}\lambda {(1-\gamma )}^{T}+\frac{{F}_{D}}{T}+({C}_{E}+{C}_{D})\lambda {(1-\gamma )}^{T}\\ \hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}+h\times \left\{\frac{\overline{Q}-2+\lambda T{(1-\gamma )}^{T}}{2}\right\}+{O}_{c}\lambda \left[1-{(1-\gamma )}^{T}\right]\end{array}$$

For the sake of simplicity, we substitute ${C}_{{D}^{\prime}}={C}_{E}+{C}_{D}$, and the expected long-run average cost with the consideration of environmental cost is:

$$\begin{array}{l}T{C}_{e}(\overline{Q},T)=\frac{{F}_{R}\lambda {(1-\gamma )}^{T}}{\overline{Q}}+{C}_{R}\lambda {(1-\gamma )}^{T}+\frac{{F}_{D}}{T}+{C}_{{D}^{\prime}}\lambda {(1-\gamma )}^{T}\\ \hspace{0.17em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}+h\times \left\{\frac{\overline{Q}-2+\lambda T{(1-\gamma )}^{T}}{2}\right\}+{O}_{c}\lambda \left[1-{(1-\gamma )}^{T}\right]\end{array}$$

**Lemma**

**5.**

For a given value of T, the optimal value of $\overline{Q}$ satisfies the following condition:

$${\overline{Q}}^{*}({\overline{Q}}^{*}-1)\le \frac{2{F}_{R}\lambda {(1-\gamma )}^{T}}{h}\le {\overline{Q}}^{*}({\overline{Q}}^{*}+1)$$

**Proof.**

For a given value of T, the optimal value of $\overline{Q}$ follows:

$$TCe({\overline{Q}}^{*}-1)\ge TCe({\overline{Q}}^{*})\mathrm{and}TCe({\overline{Q}}^{*}+1)\ge TCe({\overline{Q}}^{*})$$

Similarly, from Equation (10), an optimality condition for $\overline{Q}$ is:
$${\overline{Q}}^{*}({\overline{Q}}^{*}-1)\le \frac{2{F}_{R}\lambda {(1-\gamma )}^{T}}{h}\le {\overline{Q}}^{*}({\overline{Q}}^{*}+1)$$

**Lemma**

**6.**

The upper bound of $\overline{Q}$ satisfies the following condition:
where ${\overline{Q}}_{\mathrm{max}}$ denotes the upper bound of $\overline{Q}$.

$${\overline{Q}}_{\mathrm{max}}({\overline{Q}}_{\mathrm{max}}-1)\le \frac{2{F}_{R}\lambda}{h}\le {\overline{Q}}_{\mathrm{max}}({\overline{Q}}_{\mathrm{max}}+1)$$

**Proof.**

The value $\frac{2{F}_{R}\lambda {(1-\gamma )}^{T}}{h}$ in Equation (28) is a non-increasing function of T. Thus, the maximum value of possible $\overline{Q}$ is determined when T = 0.

**Lemma**

**7.**

For a given value of $\overline{Q}$, the total cost function is a convex function of T. Thus, the optimal dispatch cycle, T, is obtained by taking the first order derivative of the total cost function.

**Proof.**

Taking the first order and the second order partial derivatives of Equation (23) with respect to T, we have:

$$\begin{array}{l}\frac{\partial T{C}_{e}(\overline{Q},T)}{\partial T}=\left(\frac{{F}_{R}}{\overline{Q}}+{C}_{R}+{C}_{{D}^{\prime}}-{O}_{c}\right)\lambda {(1-\gamma )}^{T}\mathrm{ln}(1-\gamma )-\frac{{F}_{D}}{{T}^{2}}\\ \hspace{0.17em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}+\frac{h\lambda {(1-\gamma )}^{T}}{2}+\frac{h\lambda T{(1-\gamma )}^{T}}{2}\mathrm{ln}(1-\gamma )\end{array}$$

$$\begin{array}{l}\frac{{\partial}^{2}T{C}_{e}(\overline{Q},T)}{\partial {T}^{2}}=\left(\frac{{F}_{R}}{\overline{Q}}+{C}_{R}+{C}_{{D}^{\prime}}-{O}_{c}\right)\lambda {(1-\gamma )}^{T}{[\mathrm{ln}(1-\gamma )]}^{2}\\ \hspace{0.17em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}+\frac{{F}_{D}}{{T}^{3}}+h\lambda {(1-\gamma )}^{T}\left[\mathrm{ln}(1-\gamma )+\frac{{[\mathrm{ln}(1-\gamma )]}^{2}}{2}\right]0\end{array}$$

Since the second order derivative is always larger than zero, $T{C}_{e}(\hspace{0.17em}\overline{Q},T)$ is convex with respect to T for a given value of $\overline{Q}$.

Using the above optimality conditions, we develop a simple enumeration algorithm to obtain the optimal parameters for the proposed policy. The simple enumeration algorithm always guarantees the optimal solution. The procedure is as follows.

- The simple enumeration algorithm (SEA_T)

Step 1: Compute the upper bound of $\overline{Q}$ using Equation (29).

Step 2: For all $\overline{Q}(\overline{Q}=1,\dots {\overline{Q}}_{\mathrm{max}})$, compute the optimal T using Lemma 7.

Step 3: For given combination of $\overline{Q}$ and T, compute the total cost $T{C}_{e}(\overline{Q},T)$ using Equation (27).

Step 4: Select the $(\overline{Q},T)$ with the minimum $T{C}_{e}(\overline{Q},T)$.

## 4. Numerical Results

#### 4.1. Sensitivity Analysis

In this section, we conduct extensive numerical experiments, and examine the effects of the parameters on the optimal solutions. For the experiments, the same data set used in Cetinkaya et al. (2006) and Hong et al. (2012) is employed. The data set consists of 1024 problem instances, which is a full factorial design of ${C}_{R}$ = 1; ${C}_{{D}^{\prime}}$ = 1; $\gamma $ = 0.1; ${F}_{R}$ = 40, 80, 160, 320; ${F}_{D}$ = 5, 10, 20, 40; h = 1, 2, 4, 8; and ${O}_{c}$ = 2, 4, 8, 16. Table 1 summarizes the results of sensitivity analysis.

Table 1 (left side) shows the performance of the optimal quantity-based shipment consolidation policy with different parameter values. The replenishment quantity ($Q=nq$) and cost increase as ${F}_{R}$ increases from 40 to 320. This agrees with the intuition that if fixed cost of replenishing inventory is high, we order more products to reduce the replenishment cost. In addition, the shipment quantity (q) increases as ${F}_{D}$ increases from 5 to 40. This agrees with the intuition that if the fixed cost of dispatch shipment is high, we dispatch more orders to reduce the transportation cost. Table 1 also shows that the replenishment quantity decrease as the unit holding cost increases from one to eight. This agrees with the intuition that if the unit holding cost is high, we keep fewer inventories to reduce the holding cost while the shipment quantity decrease as the unit order cancellation cost increases from 2 to 16. This agrees with the intuition that, if the unit order cancellation cost is high, we dispatch fewer orders to reduce the total order cancellation cost because the order cancellation cost increases as shipment quantity increases.

In Table 1 (right side), we observe that the replenishment quantity for optimal time-based shipment consolidation policy and the total cost increase as ${F}_{R}$ increases from 40 to 320. This trend is observed for all choices of ${F}_{D}$, $h$, and ${O}_{c}$. This agrees with the intuition that if fixed cost of replenishing inventory is high, we order more products to reduce the replenishment cost.

As ${F}_{D}$ increases, we observe that the dispatch cycle time and the total cost increase. This agrees with the intuition that if ${F}_{D}$ is high, we dispatch more orders to reduce the transportation cost. The same trend is also observed for all choices of ${F}_{R}$, $h$ and ${O}_{c}$.

Given a fixed ${F}_{R}$, ${F}_{D}$ and ${O}_{c}$, we observe that the replenishment quantity decreases as $h$ increases from one to eight. This trend is observed for all choices of ${F}_{R}$, ${F}_{D}$ and ${O}_{c}$. This agrees with the intuition that if the unit holding cost is high, we keep fewer inventories to reduce the holding cost.

As ${O}_{c}$ increases, we observe that the dispatch cycle time decreases. This agrees with the intuition that if ${O}_{c}$ is high, we dispatch fewer orders to reduce the total order cancellation cost because the order cancellation cost increases as dispatch cycle increases. The same trend is also observed for all choices of ${F}_{R}$, ${F}_{D}$ and h.

Since the effect of changes in ${F}_{D}$ is the main motivation of shipment consolidation, and since order cancellation is the main theme in our paper, we analyzed the performance of the consolidation policy with ${F}_{D}$ and ${O}_{c}$ separately. Table 2 shows the increase of total cost (TC) and the decrease of ΔTC as ${F}_{D}$ increases from 5 to 75. Table 3 shows the impact made to the same variables (TC and ΔTC) as ${O}_{c}$ increases from 2 to 30.

Table 3 shows that optimal dispatch quantity decreases to 1 (i.e., no-consolidation) as order cancellation cost increases. This result can be interpreted as high order cancellation cost deteriorates benefit of shipment consolidation.

In Table 2 and Table 3, $\Delta TC/\Delta {F}_{D}$ and $\Delta TC/\Delta Oc$ show the amount of changes made to total cost, which is induced by the changes made to ${F}_{D}$ and ${O}_{c}$. $\Delta TC/\Delta {F}_{D}$ and $\Delta TC/\Delta Oc$ are tracked at each value of ${F}_{D}$ and ${O}_{c}$ in Figure 3. To compare the effects of ${F}_{D}$ and ${O}_{c}$ on $\Delta TC/\Delta {F}_{D}$ and $\Delta TC/\Delta Oc$, respectively, the two variables (${F}_{D}$ and ${O}_{c}$) are normalized to (0, 100).

As shown in Figure 3, total cost is more sensitive to increase in order cancellation cost (${O}_{c}$) than fixed dispatching cost (${F}_{D}$). Other things being equal, reducing the order cancellation cost is more advantageous than reducing the fixed dispatching cost in this situation. This finding can help logistics service providers, who are performing shipment consolidation policy, to make decisions to select the cost they should reduce first to minimize total cost.

#### 4.2. Comparison of the Quantity-Based and the Time-Based Policies

To compare the performances of the optimal quantity-based policy with those of the optimal time-based policy, numerical experiments are conducted, and the total costs are compared. For this comparison, we will use the same data in Section 4.1. In total, 1024 problems are generated and solved using both the quantity-based policy with time-based policy. The cost difference is computed by

$$\mathrm{Cos}\mathrm{t}\text{}\mathrm{Difference}\text{}=\text{}\mathrm{Total}\text{}\mathrm{cos}\mathrm{t}\text{}\mathrm{of}\text{}\mathrm{time}\text{-}\mathrm{based}\text{}\mathrm{policy}\text{}-\text{}\mathrm{Total}\text{}\mathrm{cos}\mathrm{t}\text{}\mathrm{of}\text{}\mathrm{quantity}\text{-}\mathrm{based}\text{}\mathrm{policy}\text{}$$

As shown in Figure 3, total cost is more sensitive to increase in order cancellation cost (${O}_{c}$) than fixed dispatching cost (${F}_{D}$). Other things being equal, reducing the order cancellation cost is more advantageous than reducing the fixed dispatching cost in this situation. This finding can help logistics service providers, who are performing shipment consolidation policy, to make decisions to select the cost they should reduce first to minimize total cost.

Figure 4 shows the total cost difference between quantity-based and time-based policies, and the total cost difference decreases as the order cancellation rate increases. As shown in Figure 3, if the customer is less sensitive to the waiting time, i.e., the order cancellation rate is small, the quantity-based consolidation policy shows the better performance in terms of the total cost compare with time-based consolidation policy. However, if the order cancellation rate increases, the performance of time-based consolidation policy is better than that of quantity-based policy.

## 5. Conclusions

In this paper, we considered a single-item inventory system where shipments are consolidated to reduce the transportation cost using quantity-based and time-based consolidation policies for the purpose of the sustainability enhancement. We developed mathematical models for quantity-based and time-based policies with order cancellation to minimize the total cost, and optimality properties for the models are then obtained. Efficient algorithms using optimal properties are provided to compute the optimal parameters for ordering and shipment decision. To compare the performances of the quantity-based policy with the time-based policy, extensive numerical experiments are conducted, and the total cost is compared. Numerical results show that the performance of time-based consolidation policy is better than that of quantity-based policy when the order cancellation rate increases.

## Acknowledgments

This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2015R1D1A1A09058818).

## Author Contributions

Chulung Lee came up with the research ideas and initiated the research project as a corresponding author. Kyunghoon Kang developed the research ideas for the results and drew conclusions. Ki-sung Hong developed the mathematical models. Ki Hong Kim proofread and revised the manuscript.

## Conflicts of Interest

The authors declare no conflict of interest.

## References

- Delmas, M.; Montiel, I. Greening the supply chain: When is customer pressure effective? J. Econ. Manag. Strategy
**2009**, 18, 171–201. [Google Scholar] [CrossRef] - Aronsson, H.; Brodin, M.H. The environmental impact of changing logistics structures. Int. J. Logist. Manag.
**2006**, 17, 394–415. [Google Scholar] [CrossRef] - Colicchia, C. Building environmental sustainability: Empirical evidence from logistics service providers. J. Clean. Prod.
**2013**, 59, 197–209. [Google Scholar] [CrossRef] - Higginson, J.K.; Bookbinder, J.H. Markovian decision processes in shipment consolidation. Transp. Sci.
**1995**, 29, 242–255. [Google Scholar] [CrossRef] - Ülkü, M.A. Dare to care: Shipment consolidation reduces not only costs, but also environmental damage. Int. J. Prod. Econ.
**2012**, 139, 438–446. [Google Scholar] [CrossRef] - Lewis, A.; Fell, M.; Palmer, D. Freight Consolidation Centre Study; Transport and Travel Research Ltd.: London, UK, 2010. [Google Scholar]
- Çetinkaya, S. Coordination of inventory and shipment consolidation decisions: A review of premises, models, and justification. In Applications of Supply Chain Management and E-Commerce Research; Springer: Boston, MA, USA, 2005; pp. 3–51. [Google Scholar]
- Hallowell, R. The relationships of customer satisfaction, customer loyalty, and profitability: An empirical study. Int. J. Serv. Ind. Manag.
**1996**, 7, 27–42. [Google Scholar] [CrossRef] - Fera, M.; Fruggiero, F.; Lambiase, A.; Macchiaroli, R.; Miranda, S. The role of uncertainty in supply chains under dynamic modeling. Int. J. Ind. Eng. Comput.
**2016**, 8, 119–140. [Google Scholar] [CrossRef] - Hong, K.-S. Integrated inventory and transportation decision for ubiquitous supply chain management. J. Intell. Manuf.
**2012**, 23, 977–988. [Google Scholar] [CrossRef] - Benjaafar, S.; Gayon, J.-P.; Tepe, S. Optimal control of a production–inventory system with customer impatience. Oper. Res. Lett.
**2010**, 38, 267–272. [Google Scholar] [CrossRef] - Ritchie-Dunham, J. A strategic supply chain simulation model. In Proceedings of the 32nd Conference on Winter Simulation; Society for Computer Simulation International: San Diego, CA, USA, 2000; pp. 1260–1264. [Google Scholar]
- Davis, T.R. Internal service operations: Strategies for increasing their effectiveness and controlling their cost. Organ. Dyn.
**1991**, 20, 5–22. [Google Scholar] [CrossRef] - Thöni, A.; Tjoa, A.M. Information technology for sustainable supply chain management: A literature survey. Enter. Inf. Syst.
**2017**, 11, 828–858. [Google Scholar] [CrossRef] - Martino, G.; Fera, M.; Iannone, R.; Miranda, S. Supply chain risk assessment in the fashion retail industry: An analytic network process approach. Int. J. Appl. Eng. Res.
**2017**, 12, 140–154. [Google Scholar] - Hoffman, W. Who’s Carbon-Free? Traffic World
**2007**, 22, 1–2. [Google Scholar] - Darom, N.A.; Hishamuddin, H. Integration of economic and environmental aspects in sustainable supply chain management: A review. In Proceedings of the 6th International Conference on Industrial Engineering and Operations Management, Kuala Lumpur, Malaysia, 8–10 March 2016. [Google Scholar]
- Fera, M.; Macchiaroli, R.; Fruggiero, F.; Lambiase, A.; Miranda, S. Application of a business process model (BPM) method for a warehouse rfid system implementation. Int. J. Technol.
**2017**, 8, 57–77. [Google Scholar] [CrossRef] - Busato, D.; Fera, M.; Iannone, R.; Mancini, V.; Schiraldi, M.M. Evaluating rfid opportunity through process analysis. Int. J. Technol.
**2013**, 5, 81–105. [Google Scholar] - Mckinnon, A.C. The economic and environmental benefits of increasing maximum truck weight: The british experience. Transp. Res. Part D Transp. Environ.
**2005**, 10, 77–95. [Google Scholar] [CrossRef] - Merrick, R.J.; Bookbinder, J.H. Environmental assessment of shipment release policies. Int. J. Phys. Distrib. Logist. Manag.
**2010**, 40, 748–762. [Google Scholar] [CrossRef] - Pan, S.; Ballot, E.; Fontane, F. The reduction of greenhouse gas emissions from freight transport by pooling supply chains. Int. J. Prod. Econ.
**2013**, 143, 86–94. [Google Scholar] [CrossRef] - Çetinkaya, S.; Mutlu, F.; Lee, C.-Y. A comparison of outbound dispatch policies for integrated inventory and transportation decisions. Eur. J. Oper. Res.
**2006**, 171, 1094–1112. [Google Scholar] [CrossRef] - Higginson, J.K.; Bookbinder, J.H. Policy recommendations for a shipment consolidation program. J. Bus. Logist.
**1994**, 15, 87–112. [Google Scholar] - Çetinkaya, S.; Bookbinder, J.H. Stochastic models for the dispatch of consolidated shipments. Transp. Res. Part B Methodol.
**2003**, 37, 747–768. [Google Scholar] [CrossRef] - Chen, F.Y.; Wang, T.; Xu, T.Z. Integrated inventory replenishment and temporal shipment consolidation: A comparison of quantity-based and time-based models. Ann. Oper. Res.
**2005**, 135, 197–210. [Google Scholar] [CrossRef] - Çetinkaya, S.; Lee, C.-Y. Optimal outbound dispatch policies: Modeling inventory and cargo capacity. Naval Res. Logist.
**2002**, 49, 531–556. [Google Scholar] [CrossRef] - Moon, I.K.; Cha, B.C.; Lee, C.U. The joint replenishment and freight consolidation of a warehouse in a supply chain. Int. J. Prod. Econ.
**2011**, 133, 344–350. [Google Scholar] [CrossRef] - Ching, W.-K.; Tai, A.H. A quantity-time-based dispatching policy for a VMI system. In Proceedings of the International Conference on Computational Science and Its Applications, Singapore, 9–12 May 2005; Springer: Berlin/Heidelberg, Germany, 2005; pp. 342–349. [Google Scholar]
- Günther, H.-O.; Seiler, T. Operative transportation planning in consumer goods supply chains. Flex. Serv. Manuf. J.
**2009**, 21, 51–74. [Google Scholar] [CrossRef] - Ülkü, M.A.; Bookbinder, J.H. Optimal quoting of delivery time by a third party logistics provider: The impact of shipment consolidation and temporal pricing schemes. Eur. J. Oper. Res.
**2012**, 221, 110–117. [Google Scholar] [CrossRef] - Mutlu, F.; Cetinkaya, S.; Bookbinder, J.H. An analytical model for computing the optimal time-and-quantity-based policy for consolidated shipments. Iie Trans.
**2010**, 42, 367–377. [Google Scholar] [CrossRef] - Hong, K.-S.; Lee, C. Optimal time-based consolidation policy with price sensitive demand. Int. J. Prod. Econ.
**2013**, 143, 275–284. [Google Scholar] [CrossRef] - Çetinkaya, S.; Mutlu, F.; Wei, B. On the service performance of alternative shipment consolidation policies. Oper. Res. Lett.
**2014**, 42, 41–47. [Google Scholar] [CrossRef] - Çetinkaya, S.; Lee, C.-Y. Stock replenishment and shipment scheduling for vendor-managed inventory systems. Manag. Sci.
**2000**, 46, 217–232. [Google Scholar] [CrossRef] - Cheung, K.L.; Zhang, A.X. The impact of inventory information distortion due to customer order cancellations. Naval Res. Logist.
**1999**, 46, 213–231. [Google Scholar] [CrossRef] - Yuan, X.-M.; Cheung, K.L. Optimal inventory policy for systems with demand cancellations. Iie Trans.
**2003**, 35, 739–747. [Google Scholar] [CrossRef] - You, P.-S. Dynamic pricing of inventory with cancellation demand. J. Oper. Res. Soc.
**2003**, 54, 1093–1101. [Google Scholar] [CrossRef] - You, P.-S.; Hsieh, Y.-C. A lot size model for deteriorating inventory with back-order cancellation. In Proceedings of the International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, Kyoto, Japan, 26–29 June 2007; Springer: Berlin/Heidelberg, Germany, 2007; pp. 1002–1011. [Google Scholar]
- Yeo, W.M.; Yuan, X.-M. Optimal inventory policy with supply uncertainty and demand cancellation. Eur. J. Oper. Res.
**2011**, 211, 26–34. [Google Scholar] [CrossRef]

**Figure 3.**Decrease in total cost induced by decrease of ${F}_{D}$ and ${O}_{c}$ in quantity-based policy and time-based policy.

Quantity-Based Policy | Time-Based Policy | |||||
---|---|---|---|---|---|---|

n | q | Total Cost | $\overline{\mathit{Q}}$ | T | Total Cost | |

${F}_{R}$ | increases | increases | increases | increases | No impact | increases |

${F}_{D}$ | No impact | increases | increases | No impact | increases | increases |

h | decreases | decreases | increases | decreases | decreases | increases |

${O}_{c}$ | No impact | decreases | increases | No impact | decreases | increases |

i | ${\mathit{F}}_{\mathit{D}}$ | Quantity-Based Policy | Time-Based Policy | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|

n | q | Total Cost (TC) | $\mathbf{\Delta}\mathit{T}\mathit{C}$ (=TC_{i} − TC_{i−1}) | $\mathbf{\Delta}\mathit{T}\mathit{C}\mathbf{/}\mathbf{\Delta}{\mathit{F}}_{\mathit{D}}$ | $\overline{\mathit{Q}}$ | T | Total Cost (TC) | $\mathbf{\Delta}\mathit{T}\mathit{C}$ (=TC_{i} − TC_{i−1}) | $\mathbf{\Delta}\mathit{T}\mathit{C}\mathbf{/}\mathbf{\Delta}{\mathit{F}}_{\mathit{D}}$ | ||

1 | 5 | 4 | 4 | 16.36 | - | - | 11 | 1.74 | 25.61 | - | - |

2 | 10 | 6 | 4 | 20.45 | 4.09 | 0.82 | 11 | 2.26 | 29.67 | 4.06 | 0.81 |

3 | 15 | 7 | 4 | 23.85 | 3.40 | 0.68 | 10 | 2.66 | 32.04 | 3.07 | 0.61 |

4 | 20 | 8 | 6 | 26.73 | 2.88 | 0.58 | 10 | 2.96 | 34.44 | 2.40 | 0.48 |

5 | 25 | 8 | 8 | 29.20 | 2.47 | 0.49 | 10 | 3.22 | 36.55 | 2.11 | 0.42 |

6 | 30 | 8 | 8 | 31.34 | 2.14 | 0.43 | 10 | 3.46 | 38.49 | 1.94 | 0.39 |

7 | 35 | 9 | 9 | 33.21 | 1.87 | 0.37 | 10 | 3.67 | 40.25 | 1.76 | 0.35 |

8 | 40 | 10 | 9 | 34.86 | 1.65 | 0.33 | 9 | 3.90 | 40.50 | 1.60 | 0.32 |

9 | 45 | 10 | 9 | 36.33 | 1.47 | 0.29 | 9 | 4.08 | 42.04 | 1.54 | 0.31 |

10 | 50 | 11 | 9 | 37.64 | 1.31 | 0.26 | 9 | 4.26 | 43.41 | 1.37 | 0.27 |

11 | 55 | 12 | 9 | 38.82 | 1.18 | 0.24 | 9 | 4.42 | 44.71 | 1.30 | 0.26 |

12 | 60 | 12 | 9 | 39.89 | 1.07 | 0.21 | 9 | 4.58 | 45.96 | 1.25 | 0.25 |

13 | 65 | 13 | 9 | 40.86 | 0.97 | 0.19 | 9 | 4.73 | 47.16 | 1.20 | 0.24 |

14 | 70 | 14 | 10 | 41.74 | 0.88 | 0.18 | 9 | 4.87 | 48.31 | 1.15 | 0.23 |

15 | 75 | 14 | 11 | 42.55 | 0.81 | 0.16 | 8 | 5.05 | 47.59 | 1.07 | 0.21 |

i | ${\mathit{F}}_{\mathit{D}}$ | Quantity-Based Policy | Time-Based Policy | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|

n | q | Total Cost (TC) | $\mathbf{\Delta}\mathit{T}\mathit{C}$ (=TC_{i} − TC_{i−1}) | $\mathbf{\Delta}\mathit{T}\mathit{C}\mathbf{/}\mathbf{\Delta}{\mathit{O}}_{\mathit{c}}$ | $\overline{\mathit{Q}}$ | T | Total Cost (TC) | $\mathbf{\Delta}\mathit{T}\mathit{C}$ (=TC_{i} − TC_{i−1}) | $\mathbf{\Delta}\mathit{T}\mathit{C}\mathbf{/}\mathbf{\Delta}{\mathit{O}}_{\mathit{c}}$ | ||

1 | 2 | 5 | 6 | 17.17 | - | - | 11 | 1.74 | 25.61 | - | - |

2 | 4 | 6 | 5 | 19.22 | 2.05 | 1.03 | 11 | 1.62 | 28.61 | 3.00 | 1.50 |

3 | 6 | 7 | 4 | 20.83 | 1.61 | 0.81 | 11 | 1.51 | 31.75 | 3.14 | 1.57 |

4 | 8 | 8 | 4 | 22.21 | 1.38 | 0.69 | 12 | 1.34 | 35.07 | 3.32 | 1.66 |

5 | 10 | 9 | 3 | 23.42 | 1.21 | 0.61 | 12 | 1.32 | 38.54 | 3.38 | 1.69 |

6 | 12 | 10 | 3 | 24.50 | 1.08 | 0.54 | 12 | 1.25 | 41.98 | 3.44 | 1.72 |

7 | 14 | 11 | 3 | 25.50 | 1.00 | 0.50 | 12 | 1.19 | 45.50 | 3.52 | 1.76 |

8 | 16 | 12 | 3 | 26.43 | 0.93 | 0.47 | 12 | 1.13 | 49.09 | 3.59 | 1.80 |

9 | 18 | 13 | 2 | 27.30 | 0.87 | 0.44 | 12 | 1.09 | 52.71 | 3.62 | 1.81 |

10 | 20 | 14 | 2 | 28.12 | 0.82 | 0.41 | 12 | 1.04 | 56.38 | 3.67 | 1.84 |

11 | 22 | 15 | 2 | 28.90 | 0.78 | 0.39 | 12 | 1.00 | 60.09 | 3.71 | 1.86 |

12 | 24 | 16 | 2 | 29.66 | 0.76 | 0.38 | 12 | 0.97 | 63.82 | 3.73 | 1.87 |

13 | 26 | 17 | 2 | 30.38 | 0.72 | 0.36 | 12 | 0.94 | 67.58 | 3.76 | 1.88 |

14 | 28 | 18 | 1 | 31.08 | 0.70 | 0.35 | 12 | 0.91 | 71.37 | 3.79 | 1.90 |

15 | 30 | 19 | 1 | 31.75 | 0.67 | 0.34 | 12 | 0.88 | 75.17 | 3.80 | 1.90 |

© 2017 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).