Solving a location, allocation, and capacity planning problem with dynamic demand and response time service level
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Article number | 492340 |
Journal / Publication | Mathematical Problems in Engineering |
Volume | 2014 |
Online published | 27 Aug 2014 |
Publication status | Published - 2014 |
Link(s)
DOI | DOI |
---|---|
Attachment(s) | Documents
Publisher's Copyright Statement
|
Link to Scopus | https://www.scopus.com/record/display.uri?eid=2-s2.0-84934947139&origin=recordpage |
Permanent Link | https://scholars.cityu.edu.hk/en/publications/publication(d8de1b40-900a-4210-a7b8-89145433373d).html |
Abstract
Logistic systems with uncertain demand, travel time, and on-site processing time are studied here where sequential trip travel is allowed. The relationship between three levels of decisions: facility location, demand allocation, and resource capacity (number of service units), satisfying the response time requirement, is analysed. The problem is formulated as a stochastic mixed integer program. A simulation-based hybrid heuristic is developed to solve the dynamic problem under different response time service level. An initial solution is obtained from solving static location-allocation models, followed by iterative improvement of the three levels of decisions by ejection, reinsertion procedure with memory of feasible and infeasible service regions. Results indicate that a higher response time service level could be achieved by allocating a given resource under an appropriate decentralized policy. Given a response time requirement, the general trend is that the minimum total capacity initially decreases with more facilities. During this stage, variability in travel time has more impact on capacity than variability in demand arrivals. Thereafter, the total capacity remains stable and then gradually increases. When service level requirement is high, the dynamic dispatch based on first-come-first-serve rule requires smaller capacity than the one by nearest-neighbour rule.
Research Area(s)
Citation Format(s)
Solving a location, allocation, and capacity planning problem with dynamic demand and response time service level. / Lin, Carrie Ka Yuk.
In: Mathematical Problems in Engineering, Vol. 2014, 492340, 2014.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Download Statistics
No data available