Eliiyi - Basili - Hal Transportation
Eliiyi - Basili - Hal Transportation
Eliiyi - Basili - Hal Transportation
net/publication/258530990
CITATIONS READS
4 1,744
3 authors, including:
Some of the authors of this publication are also working on these related projects:
Solution Approaches for Container Shipping Line Network Design and Integrated Container Terminal Operations View project
Future Sales Forecasting based on Past Sales and Current Statistical Information - Univera A.Ş. R&D Center View project
All content following this page was uploaded by Deniz T Eliiyi on 16 December 2014.
ABSTRACT
Supply chain management is one of the main sources of competitive advantage for companies. As a useful tool for inventory and
transportation management in supply chains, transshipment points provide an effective mechanism for correcting discrepancies between
demand and available inventory. This study aims to model the transshipment problem of a company in the apparel industry with multiple
subcontractors and customers, and a transshipment depot in between. Unlike a typical transshipment problem that considers only the
total cost of transportation, our model also considers the supplier lead times and the customer due dates in the system and it can be used
for both supplier selection and timely distribution planning. The proposed model can also be adapted easily by other companies in the
industry.
Keywords: Transshipment problem, Lead time constraints, Apparel industry.
ÖZET
Tedarik zinciri yönetimi şirketler için rekabet avantajı sağlamadaki temel kaynaklardan birini oluşturmaktadır. Tedarik
zincirlerinde envanter ve ulaştırma yönetimi konusunda faydalı kullanımları olan aktarım noktaları özellikle talep ve envanter miktarı
arasındaki farkı kapatma konusunda etkin bir mekanizma sunmaktadır. Bu çalışmanın amacı hazır giyim sektöründe birden çok fason
imalatçı ve müşteri ile faaliyet gösteren ve aktarım deposuna sahip bir şirketin aktarım probleminin modellenmesidir. Yalnızca toplam
maliyeti minimize etmeyi amaçlayan tipik aktarım modellerinden farklı olarak modelimiz tedarik sürelerini ve müşterilerin termin
zamanlarını da dikkate almakta, bu sayede hem tedarikçi seçiminde hem de zamanında dağıtım planlamasında kullanılabilmektedir.
Önerilen model sektördeki diğer firmalar için de kolaylıkla adapte edilebilir.
Anahtar Kelimeler: Aktarım problemi, Tedarik süresi kısıtları, Hazır giyim sektörü.
1. INTRODUCTION terms of both the customers and the reduce its costs and improve the level
organization on the other (2, 3). of service without increasing the stock
Supply chain management is one of
level and bearing additional costs (5).
the main sources of competitive Supply chain management entails
advantage for companies and its effective replenishment and inventory Transshipment problems are variations
importance is increasing due to its policies. The use of transshipment of transportation problems in which
effects on solving problems faced by points in supply chains renders goods and services are distributed
many companies in terms of monitored movement of stocks to between sources, storage points and
mismatches between customer intermediary storage locations between destinations. Like in many cases, the
demand and supply, which will lead to two echelon levels. Transshipments objective function of transshipment
low levels of customer satisfaction and are effective policies for correcting problems is to minimize cost.
eventually decreasing sales and discrepancies between demand and Transshipments problems were first
market share (1). Logistics is a critical inventory available at specific defined by Orden (6) as an extension
part of supply chain management, and locations, serving as a tool for effective of transportation problems with
is used to control the flow of materials, management of stocks that are already transshipment points between the
services and information taking into procured and delivered into the system sources and the destinations (7).
account the cost of these activities on (4). By using transshipments as a tool Transshipment models can be used to
one side and the value created in for utilizing stocks, a company can enhance cost efficient movement of
s: supplier index
t: transshipment point index
c: customer index
p: product type index
Dcp: Demand quantity depending on customer and product type.
DDcp: Deadline of order depending on customer and product type.
lsp: Lead time of production depending on supplier and product type.
cst: Cost of shipping one unit from supplier point to transshipment point.
csc: Cost of shipping one unit from supplier point to the customer.
ctc: Cost of shipping one unit from transshipment point to the customer.
tst: Shipping time from supplier point to transshipment point.
tsc: Shipping time from supplier point to the customer.
ttc: Shipping time from transshipment point to the customer.
prp: The percentage of volume a specific product p occupies in a package.
Batch-shipment-cost is represented by three different cost components: The total cost of sending packages directly, the total
cost of sending packages from suppliers to transshipment points and the total cost of sending packages from transshipment
points to customers.
Every customer must be served with each product either directly from a supply point or through the transshipment point. This
constraint is reflected by the following equation:
∑X
s =1
scp + ∑ Z cpt = 1 , ∀c, p
t =1
(2)
Constraint set 3 below ensures time limits for direct shipments. The company works with strict deadlines for each order.
These time constraints make our model different from the typical transshipment problems. Sum of the lead time and the
shipping time from supplier to customer cannot exceed the deadline of an order. Note that, instead of including due dates
and related penalty costs in the objective function, strict deadlines are included as constraints in the model. This is due to
the fact that there are very high penalty costs for late orders, and the company decision makers never prefer this situation
regarding future relationships with customers. So it can be said that the company actually has deadlines rather than due
dates.
Constraint set 4 ensures time limits for shipments via transshipment points. Sum of the lead time, the shipping time from
supplier to transshipment point and the shipping time from transshipment point to the customer cannot exceed the deadline
of an order.
The next constraint set assures that, at every transshipment point, if a product p for customer c is sent from one of the
possible suppliers to the transshipment point, then it must be sent out from the transshipment point to customer c. Hence,
these constraints ensure the conservation of flow for the transshipment points.
n
∑Y
s =1
cpst = Z cpt , ∀c, p , t (5)
Xpcs denotes the number of packages shipped from the supplier to the customer directly. The next constraint set settles the
total number of packages to be shipped, depending on the number of products to be shipped and their capacity usage in a
package.
n
Xpsc ≥ ∑ X scp * Dcp * Prp , ∀s, c (6)
p =1
Ypst denotes the number of packages shipped from the supplier to the transshipment point, and Zptc denotes the number of
packages shipped from the transshipment point to the customer. Constraint sets 7 and 8 compute the total number of
packages to be shipped in a similar way similar as constraint set 6.
n n
Ypst ≥ ∑∑ Ycpst * Dcp * Prp , ∀s, t (7)
c =1 p =1
n
Zptc ≥ ∑ Z cpt * Dcp * Prp , ∀t , c (8)
p =1
Not all suppliers can provide all product types. Product p can only be sent from a supplier s if that supplier is eligible to
provide that product. There may be more than one eligible supplier for a product, and our model makes optimal supplier
selections based on transportation cost, lead times and transshipment times. The following constraint sets ensure that only
eligible suppliers are selected for each product in both direct shipments and shipments through the transshipment points.
Ycpst ≤ E ps , ∀c, p, s, t
(10)
Finally, types of variables in the model are defined.
Xpcs, Ypst, Zptc, ≥ 0 and integer, X scp , Ycpst , Z cpt binary, ∀c, p, s, t
(11)
4. PROBLEM DATA In this problem instance with a 20-day customers changes between 25 and
planning horizon, there are 13 31 monetary units and the shipping
The data used is obtained from the potential suppliers, 11 customers and takes 2 to 3 days. The unit shipment
company by taking a recent snapshot 5 product types. The unit direct costs from the suppliers to the
of the system involving many orders. shipment cost from the suppliers to the transshipment point is between 3 to 7
p1 p2 p3 p4 p5
c1 0 0 46 0 138
c2 48 0 0 0 16
c3 1136 852 35 0 101 Figure 3. Solution of the company.
c4 54 36 18 0 0
c5 42 32 15 0 0
The solution time of the model in
c6 0 4 2 0 0
GAMS for this size of an instance with
c7 21 14 8 0 0
c8 6 4 1 0 0
334 variables is ignorable due to the
c9 21 8 14 0 0
simplistic network-type formulation of
c10 18 12 3 0 0
the problem. The optimization model
c11 0 0 0 5 0 Figure 2. The optimal solution. provides a cost advantage to the
company as well as improving customer
Next, we explain how the company satisfaction related with the timely
5. COMPUTATIONAL RESULTS actually proceeded in this specific shipments. When the actual cost of the
The problem is modeled and solved problem instance and compare their company is compared to the results
using GAMS 22.5 optimization software. intuitive solution with the optimal obtained from the optimization model,
As it was stated in the previous solution. Because of the tight due it can be observed that there is a
section, the gathered real life data dates and since one of their most reduction in the transportation costs
includes a planning horizon where the important accounts is among these 11 almost by 35%. This means that using
orders from 11 customers should be customers, the company actually did the transshipment point provides cost
fulfilled using 13 supplier nodes not use transshipment point and advantage and operational efficiency.
REFERENCES
1. Reyes P.M., 2006, “A game theory approach for solving the transshipment problem: a supply chain management strategy teaching tool”, Supply Chain
Management: An International Journal, 11, 288–293.
2. Wu Y., 2008, “A mixed-integer programming model for global logistics transportation problems”, International Journal of Systems Science, 39, 217–228.
3. Harrison T.P., 2003, “Principles for the strategic design of supply chains”, in: The Practice of Supply Chain Management: Where Theory and Application
Converge, T.P. Harrison, H.L. Lee and J.J. Neale (Eds), USA: Kluwer Academic Publishers, 3-12.
4. Herer Y.T., Rashit A., 1999, “Lateral Stock Transshipments in a Two-Location Inventory System with Fixed and Joint Replenishment Costs”, Naval
Research Logistics, 46, 525-547.
5. Ozdemir D., Yucesan E., Herer Y.T., 2006, “Multi-location transshipment problem with capacitated transportation”, European Journal of Operational
Research, 175, 602-621.
7. Hemaida R.S., Kwak N.K., 1994, “A Linear Goal Programming Model for Trans-Shipment Problems with Flexible Supply and Demand Constraints”, Journal
of the Operational Research Society, 45, 215-224.
8. Herer Y.T., Tzur M., 2001, “The Dynamic Transshipment Problem”, Naval Research Logistics, 48, 386-408.
9. Herer Y.T., Tzur M., 2003, “Optimal and heuristic algorithms for the multi-location dynamic transshipment problem with fixed transshipment costs”, IIE
Transactions, 35, 419-432.
Bu araştırma, Bilim Kurulumuz tarafından incelendikten sonra, oylama ile saptanan iki hakemin görüşüne sunulmuştur. Her iki hakem
yaptıkları incelemeler sonucunda araştırmanın bilimselliği ve sunumu olarak “Hakem Onaylı Araştırma” vasfıyla yayımlanabileceğine
karar vermişlerdir.