The benchmark algorithm gave results

Running head: ARTICLE SUMMARY 1
Article Summary
Name of Student
Institution affiliation

ARTICLE SUMMARY ` 2
Article Summary
Introduction
Technological advancement in the present world has led to the adoption of algorithm-
based decision-making in fashion industry operations. In the competitive world of the fashion
efficient and logical operations in distribution and effective reverse and forward logistics designs
for fashion commodities. Distribution of a wide variety of fashion products is the challenge
facing the fashion industry with a reduction of distribution lead time of great concern, which
leads to the adoption of the assort-packing where packaging is done considering stores where
they will be distributed. Many operations involved in packaging lengthen distribution lead time,
such as unpacking, repacking, and product assortment. The summary defines the problem,
mathematical model, the approach to solve the problem and the results from the article.
Problem Definition
The distribution of the products, which are varied and involves many operations is the
key problem facing the fashion industry. The adoption of an algorithm to help in the decision
making process is applied in order to minimize the costs while maximizing profits within the
constraints of the company. The assort-packing packing problem is complex as it requires the
consideration of pack configurations, store demands, and factory constraints. The adoption of the
assort-packaging and distribution problem (APDP) to minimize the over- and under-shipments to
stores considering shipment schedule and business requirements by the fashion industry has
enabled to keep up with competitors in the whole industry. The heuristic algorithm is used to
implement the assort-packaging and distribution problem and solve it in a timely manner (Sung

ARTICLE SUMMARY ` 3
& Jang, 2018). The assort-packaging and distribution problem is examined, its basic
optimization formulated together with its complexity analysis, and then its solution using the
heuristic approach determined as discussed in summary.
Mathematical Model
Solving an APDP which is a linear programming problem which is solved systematically
following the three steps; Decision variables which are mathematical symbols representing a
firm’s activity levels, Objective function which is a relationship that is linear in mathematics that
defines the firms’ objectives in accordance to the decision variables and Model constraints. The
model constraints shows relationships (linear) of the firm’s decision variables that represents the
restrictions on the company from the area of operation.
i. The decision variables are S, B and K which represents the stores, different assort-
packing configurations packs and a set of possible box capacities respectively.
ii. Objective function is to minimize over-shipment and under-shipment to stores. It’s
given by;
minimize ∑
s ∈ S
∑
s∈ S
(uis +ois)
iii. Constraints are;
a. Over and under-shipment calculated on comparison of distribution amount and
demand
∑
i ∈ I
yib xbs−ois+uis=dis ∀ i∈ Ι , ∀ s ∈ S
b. Possible capacity of the assort-pack