Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.omega.2017.01.006
DC Field | Value | |
---|---|---|
dc.title | The two-dimensional vector packing problem with general costs | |
dc.contributor.author | Qian Hu | |
dc.contributor.author | Lijun Wei | |
dc.contributor.author | Lim Leong Chye, Andrew | |
dc.date.accessioned | 2020-05-04T10:24:10Z | |
dc.date.available | 2020-05-04T10:24:10Z | |
dc.date.issued | 2018-01-01 | |
dc.identifier.citation | Qian Hu, Lijun Wei, Lim Leong Chye, Andrew (2018-01-01). The two-dimensional vector packing problem with general costs. Omega 74 : 59-69. ScholarBank@NUS Repository. https://doi.org/10.1016/j.omega.2017.01.006 | |
dc.identifier.issn | 0305-0483 | |
dc.identifier.uri | https://scholarbank.nus.edu.sg/handle/10635/167673 | |
dc.description.abstract | 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. | |
dc.language.iso | en | |
dc.publisher | Elsevier | |
dc.subject | Application | |
dc.subject | Bin packing | |
dc.subject | Two-dimensional vector packing | |
dc.subject | General costs | |
dc.subject | Memetic algorithm | |
dc.type | Article | |
dc.contributor.department | INDUSTRIAL SYSTEMS ENGINEERING AND MANAGEMENT | |
dc.description.doi | 10.1016/j.omega.2017.01.006 | |
dc.description.sourcetitle | Omega | |
dc.description.volume | 74 | |
dc.description.page | 59-69 | |
dc.published.state | Published | |
dc.grant.id | NRF-RSS2016004 | |
dc.grant.id | R266000096133 | |
dc.grant.id | R266000096731 | |
dc.grant.id | R266000100646 | |
dc.grant.fundingagency | NRF of Singapore | |
dc.grant.fundingagency | MOE | |
Appears in Collections: | Staff Publications Elements |
Show simple item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
2dvpp-gc.pdf | 744.12 kB | Adobe PDF | OPEN | Pre-print | View/Download |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.