Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/93554
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Land Surveying and Geo-Informatics | en_US |
dc.creator | Cheng, C | en_US |
dc.creator | Zhu, R | en_US |
dc.creator | Costa, AM | en_US |
dc.creator | Thompson, RG | en_US |
dc.creator | Huang, X | en_US |
dc.date.accessioned | 2022-07-08T01:03:04Z | - |
dc.date.available | 2022-07-08T01:03:04Z | - |
dc.identifier.issn | 2324-9935 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/93554 | - |
dc.language.iso | en | en_US |
dc.publisher | Taylor & Francis | en_US |
dc.rights | © 2021 Singapore-MIT Alliance for Research and Technology. Published by Informa UK Limited, trading as Taylor & Francis Group | en_US |
dc.rights | This is an Accepted Manuscript of an article published by Taylor & Francis in Transportmetrica A: Transport Science on 3 May 2021 (Published online), available online: http://www.tandfonline.com/10.1080/23249935.2021.1916644. | en_US |
dc.subject | Disaster waste management | en_US |
dc.subject | Two-echelon location routing | en_US |
dc.subject | Problem | en_US |
dc.subject | MIP | en_US |
dc.subject | Genetic algorithm | en_US |
dc.subject | Greedy algorithm | en_US |
dc.title | Multi-period two-echelon location routing problem for disaster waste clean-up | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 1053 | en_US |
dc.identifier.epage | 1083 | en_US |
dc.identifier.volume | 18 | en_US |
dc.identifier.issue | 3 | en_US |
dc.identifier.doi | 10.1080/23249935.2021.1916644 | en_US |
dcterms.abstract | Waste clean-up after a disaster is one of the most critical tasks in the response stage of disaster management. We develop a model to minimise the cost and duration of disaster waste clean-up considering using Temporary Disaster Waste Management Sites (TDWMSs), which can store and process waste before it is sent to the final disposal sites. The problem that arises can be seen as a Multi-Period Two-echelon Location Routing Problem (MP-2ELRP) in which the main decisions are the location of the TDWMSs and the routing of vehicles in both echelons. In this paper, we propose both a mixed-integer program and a Genetic Algorithm (GA) to model and solve the problem. Computational tests indicate: (i) the performance of proposed GA is robust; (ii) the use of TDWMSs can reduce both total waste clean-up cost and duration; and (iii) the capacities of TDWMSs have a significant impact on the total waste clean-up time and duration. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Transportmetrica A: Transport Science, 2022, v. 18, no. 3, p. 1053-1083 | en_US |
dcterms.isPartOf | Transportmetrica. A, Transport science | en_US |
dcterms.issued | 2022 | - |
dc.identifier.scopus | 2-s2.0-85105178920 | - |
dc.identifier.eissn | 2324-9943 | en_US |
dc.description.validate | 202207 bcfc | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | LSGI-0064 | - |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | National Research Foundation, Prime Minister’s Office, Singapore | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 56141427 | - |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Zhu_Multi-period_Two-echelon_Location.pdf | Pre-Published version | 1.45 MB | Adobe PDF | View/Open |
Page views
57
Last Week
0
0
Last month
Citations as of May 12, 2024
Downloads
85
Citations as of May 12, 2024
SCOPUSTM
Citations
17
Citations as of May 16, 2024
WEB OF SCIENCETM
Citations
18
Citations as of May 16, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.