Container leasing decision for orders

Stephen C. H. Leung; Ligang Zhou; Kin Keung Lai

doi:10.1109/ICSSSM.2007.4280128

Container leasing decision for orders

Stephen C. H. Leung
, Ligang Zhou
, Kin Keung Lai

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

Abstract

Many companies' distribution center need to lease containers to delivery the cargos according to the received orders and cargoes need to be packed into containers before they are delivered by airplane. In this study, a dynamic programming method is brought forward to solve this problem based on the solution of a mix-integer linear programming sub-problem. The mix-integer linear programming sub-problem is used to select container selection and optimize cargo loading, and dynamic programming method is used to optimize container leasing plan for orders within a certain period. The numerical tests show the method is efficient and great cost can be saved. © 2007 IEEE.

Original language	English
Title of host publication	Proceedings - ICSSSM'07: 2007 International Conference on Service Systems and Service Management
DOIs	https://doi.org/10.1109/ICSSSM.2007.4280128
Publication status	Published - 2007
Event	2007 International Conference on Service Systems and Service Management (ICSSSM'07) - Changdu, China Duration: 9 Jun 2007 → 11 Jun 2007

Conference

Conference	2007 International Conference on Service Systems and Service Management (ICSSSM'07)
Abbreviated title	ICSSSM
Place	China
City	Changdu
Period	9/06/07 → 11/06/07

Research Keywords

Container leasing
Dynamic programming
Linear programming

Access Output

10.1109/ICSSSM.2007.4280128

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{edbb13e23b904fd98e849fc8261ebe10,

title = "Container leasing decision for orders",

abstract = "Many companies' distribution center need to lease containers to delivery the cargos according to the received orders and cargoes need to be packed into containers before they are delivered by airplane. In this study, a dynamic programming method is brought forward to solve this problem based on the solution of a mix-integer linear programming sub-problem. The mix-integer linear programming sub-problem is used to select container selection and optimize cargo loading, and dynamic programming method is used to optimize container leasing plan for orders within a certain period. The numerical tests show the method is efficient and great cost can be saved. {\textcopyright} 2007 IEEE.",

keywords = "Container leasing, Dynamic programming, Linear programming",

author = "Leung, \{Stephen C. H.\} and Ligang Zhou and Lai, \{Kin Keung\}",

year = "2007",

doi = "10.1109/ICSSSM.2007.4280128",

language = "English",

isbn = "1424408857",

booktitle = "Proceedings - ICSSSM'07: 2007 International Conference on Service Systems and Service Management",

note = "2007 International Conference on Service Systems and Service Management (ICSSSM'07), ICSSSM ; Conference date: 09-06-2007 Through 11-06-2007",

}

TY - GEN

T1 - Container leasing decision for orders

AU - Leung, Stephen C. H.

AU - Zhou, Ligang

AU - Lai, Kin Keung

PY - 2007

Y1 - 2007

N2 - Many companies' distribution center need to lease containers to delivery the cargos according to the received orders and cargoes need to be packed into containers before they are delivered by airplane. In this study, a dynamic programming method is brought forward to solve this problem based on the solution of a mix-integer linear programming sub-problem. The mix-integer linear programming sub-problem is used to select container selection and optimize cargo loading, and dynamic programming method is used to optimize container leasing plan for orders within a certain period. The numerical tests show the method is efficient and great cost can be saved. © 2007 IEEE.

AB - Many companies' distribution center need to lease containers to delivery the cargos according to the received orders and cargoes need to be packed into containers before they are delivered by airplane. In this study, a dynamic programming method is brought forward to solve this problem based on the solution of a mix-integer linear programming sub-problem. The mix-integer linear programming sub-problem is used to select container selection and optimize cargo loading, and dynamic programming method is used to optimize container leasing plan for orders within a certain period. The numerical tests show the method is efficient and great cost can be saved. © 2007 IEEE.

KW - Container leasing

KW - Dynamic programming

KW - Linear programming

UR - https://www.scopus.com/pages/publications/40549124329

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

U2 - 10.1109/ICSSSM.2007.4280128

DO - 10.1109/ICSSSM.2007.4280128

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 1424408857

SN - 9781424408856

BT - Proceedings - ICSSSM'07: 2007 International Conference on Service Systems and Service Management

T2 - 2007 International Conference on Service Systems and Service Management (ICSSSM'07)

Y2 - 9 June 2007 through 11 June 2007

ER -

Container leasing decision for orders

Abstract

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this