TY - JOUR
T1 - The two-dimensional vector packing problem with general costs
AU - Hu, Qian
AU - Wei, Lijun
AU - Lim, Andrew
PY - 2018/1
Y1 - 2018/1
N2 - The two-dimensional vector packing problem with general costs (2DVPP-GC) arises in logistics where shipping items of different weight and volume are packed into cartons before being transported by a courier company. In practice, the delivery cost of a carton of items is usually retrieved from a cost table. The costs may not preserve any known mathematical function since it could specify arbitrary price at any possible weight. Such a general pricing scheme meets a majority of real-world bin packing applications, where the price of delivery service is determined by many complicated and correlated factors. Compared to the classical bin packing problem and its variants, the 2DVPP-GC is more complex and challenging. To solve the 2DVPP-GC with minimizing the total cost, we propose a memetic algorithm to compute solutions of high quality. Fitness functions and improved operators are proposed to achieve effectiveness. Computational experiments on a variety of test instances show that the algorithm is competent to solve the 2DVPP-GC. In particular, optimal solutions are found in a second for all the test instances that have a known optimal solution.
AB - The two-dimensional vector packing problem with general costs (2DVPP-GC) arises in logistics where shipping items of different weight and volume are packed into cartons before being transported by a courier company. In practice, the delivery cost of a carton of items is usually retrieved from a cost table. The costs may not preserve any known mathematical function since it could specify arbitrary price at any possible weight. Such a general pricing scheme meets a majority of real-world bin packing applications, where the price of delivery service is determined by many complicated and correlated factors. Compared to the classical bin packing problem and its variants, the 2DVPP-GC is more complex and challenging. To solve the 2DVPP-GC with minimizing the total cost, we propose a memetic algorithm to compute solutions of high quality. Fitness functions and improved operators are proposed to achieve effectiveness. Computational experiments on a variety of test instances show that the algorithm is competent to solve the 2DVPP-GC. In particular, optimal solutions are found in a second for all the test instances that have a known optimal solution.
KW - Application
KW - Bin packing
KW - General costs
KW - Memetic algorithm
KW - Two-dimensional vector packing
UR - http://www.scopus.com/inward/record.url?scp=85011031844&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85011031844&origin=recordpage
U2 - 10.1016/j.omega.2017.01.006
DO - 10.1016/j.omega.2017.01.006
M3 - 21_Publication in refereed journal
VL - 74
SP - 59
EP - 69
JO - Omega
JF - Omega
SN - 0305-0483
ER -