A heuristic to the multiple container loading problem with preference

Tian Tian; Andrew Lim; Wenbin Zhu

doi:10.1007/978-3-319-00651-2_30

A heuristic to the multiple container loading problem with preference

Tian Tian, Andrew Lim, Wenbin Zhu

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 12 - Chapter in an edited book (Author) › peer-review

Abstract

In this paper, we address the Multiple Container Loading Problem with Preference (MCLPP). It is derived from the real problems proposed by an audio equipment manufacturer. In the MCLPP, the numbers of various types of boxes can be adjusted based on box preferences.We need to add or delete boxes in a restricted way so that the ratio of the total preference of boxes to the total cost of containers is maximized.We develop a three-step search scheme to solve this problem. Test data is modified from existing benchmark test data for the multiple container loading cost minimization problem. Computational experiments show our approach is able to provide high quality solutions and they satisfy the need of the manufacturer. © 2013 Springer International Publishing Switzerland.

Original language	English
Title of host publication	Contemporary Challenges and Solutions in Applied Artificial Intelligence
Publisher	Springer
Pages	219-224
ISBN (Print)	9783319006505
DOIs	https://doi.org/10.1007/978-3-319-00651-2_30
Publication status	Published - 2013

Publication series

Name	Studies in Computational Intelligence
Volume	489
ISSN (Print)	1860-949X

Access Output

10.1007/978-3-319-00651-2_30

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inbook{b03a1f47f4944612a2bbdedac0c1750e,

title = "A heuristic to the multiple container loading problem with preference",

abstract = "In this paper, we address the Multiple Container Loading Problem with Preference (MCLPP). It is derived from the real problems proposed by an audio equipment manufacturer. In the MCLPP, the numbers of various types of boxes can be adjusted based on box preferences.We need to add or delete boxes in a restricted way so that the ratio of the total preference of boxes to the total cost of containers is maximized.We develop a three-step search scheme to solve this problem. Test data is modified from existing benchmark test data for the multiple container loading cost minimization problem. Computational experiments show our approach is able to provide high quality solutions and they satisfy the need of the manufacturer. {\textcopyright} 2013 Springer International Publishing Switzerland.",

author = "Tian Tian and Andrew Lim and Wenbin Zhu",

year = "2013",

doi = "10.1007/978-3-319-00651-2_30",

language = "English",

isbn = "9783319006505",

series = "Studies in Computational Intelligence",

publisher = "Springer ",

pages = "219--224",

booktitle = "Contemporary Challenges and Solutions in Applied Artificial Intelligence",

}

A heuristic to the multiple container loading problem with preference. / Tian, Tian; Lim, Andrew; Zhu, Wenbin.
Contemporary Challenges and Solutions in Applied Artificial Intelligence. Springer , 2013. p. 219-224 (Studies in Computational Intelligence; Vol. 489).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 12 - Chapter in an edited book (Author) › peer-review

TY - CHAP

T1 - A heuristic to the multiple container loading problem with preference

AU - Tian, Tian

AU - Lim, Andrew

AU - Zhu, Wenbin

PY - 2013

Y1 - 2013

N2 - In this paper, we address the Multiple Container Loading Problem with Preference (MCLPP). It is derived from the real problems proposed by an audio equipment manufacturer. In the MCLPP, the numbers of various types of boxes can be adjusted based on box preferences.We need to add or delete boxes in a restricted way so that the ratio of the total preference of boxes to the total cost of containers is maximized.We develop a three-step search scheme to solve this problem. Test data is modified from existing benchmark test data for the multiple container loading cost minimization problem. Computational experiments show our approach is able to provide high quality solutions and they satisfy the need of the manufacturer. © 2013 Springer International Publishing Switzerland.

AB - In this paper, we address the Multiple Container Loading Problem with Preference (MCLPP). It is derived from the real problems proposed by an audio equipment manufacturer. In the MCLPP, the numbers of various types of boxes can be adjusted based on box preferences.We need to add or delete boxes in a restricted way so that the ratio of the total preference of boxes to the total cost of containers is maximized.We develop a three-step search scheme to solve this problem. Test data is modified from existing benchmark test data for the multiple container loading cost minimization problem. Computational experiments show our approach is able to provide high quality solutions and they satisfy the need of the manufacturer. © 2013 Springer International Publishing Switzerland.

UR - http://www.scopus.com/inward/record.url?scp=84883696047&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84883696047&origin=recordpage

U2 - 10.1007/978-3-319-00651-2_30

DO - 10.1007/978-3-319-00651-2_30

M3 - RGC 12 - Chapter in an edited book (Author)

SN - 9783319006505

T3 - Studies in Computational Intelligence

SP - 219

EP - 224

BT - Contemporary Challenges and Solutions in Applied Artificial Intelligence

PB - Springer

ER -

A heuristic to the multiple container loading problem with preference

Abstract

Publication series

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this