An improved variable neighborhood search algorithm for the solid waste collection and transportation problem with split deliveries

Wencong Zhao; Renqian Zhang; Xi Yuan; Kaiping Luo

doi:10.1109/ICIST52614.2021.9440629

An improved variable neighborhood search algorithm for the solid waste collection and transportation problem with split deliveries

Wencong Zhao
, Renqian Zhang
, Xi Yuan
, Kaiping Luo

经济管理学院

Beihang University

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

3 引用（Scopus）

摘要

This study addresses the solid waste collection and transportation problem with split deliveries (SWCTPSD). To minimize the total fleet costs, a mixed-integer programming model is proposed. An improved variable neighborhood search (VNS) algorithm is proposed to obtain a high-quality collection and transportation plan quickly. To enhance the local exploitive ability, the VNS algorithm is hybridized with simulated annealing. The experimental results show that the proposed VNS algorithm is effective.

源语言	英语
主期刊名	2021 11th International Conference on Information Science and Technology, ICIST 2021
出版商	Institute of Electrical and Electronics Engineers Inc.
页	659-667
页数	9
ISBN（电子版）	9781665412667
DOI	https://doi.org/10.1109/ICIST52614.2021.9440629
出版状态	已出版 - 21 5月 2021
活动	11th International Conference on Information Science and Technology, ICIST 2021 - Chengdu, 中国期限: 21 5月 2021 → 23 5月 2021

出版系列

姓名	2021 11th International Conference on Information Science and Technology, ICIST 2021

会议

会议	11th International Conference on Information Science and Technology, ICIST 2021
国家/地区	中国
市	Chengdu
时期	21/05/21 → 23/05/21

联合国可持续发展目标

此成果有助于实现下列可持续发展目标：

可持续发展目标 12 负责任消费和生产

访问文件

10.1109/ICIST52614.2021.9440629

其它文件与链接

链接到 Scopus 的出版物

引用此

Zhao, W., Zhang, R., Yuan, X., & Luo, K. (2021). An improved variable neighborhood search algorithm for the solid waste collection and transportation problem with split deliveries. 在 2021 11th International Conference on Information Science and Technology, ICIST 2021 (页码 659-667). 文章 9440629 (2021 11th International Conference on Information Science and Technology, ICIST 2021). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICIST52614.2021.9440629

Zhao, Wencong ; Zhang, Renqian ; Yuan, Xi 等. / An improved variable neighborhood search algorithm for the solid waste collection and transportation problem with split deliveries. 2021 11th International Conference on Information Science and Technology, ICIST 2021. Institute of Electrical and Electronics Engineers Inc., 2021. 页码 659-667 (2021 11th International Conference on Information Science and Technology, ICIST 2021).

@inproceedings{6903a20e2e704a19a7d3726cea2ce828,

title = "An improved variable neighborhood search algorithm for the solid waste collection and transportation problem with split deliveries",

abstract = "This study addresses the solid waste collection and transportation problem with split deliveries (SWCTPSD). To minimize the total fleet costs, a mixed-integer programming model is proposed. An improved variable neighborhood search (VNS) algorithm is proposed to obtain a high-quality collection and transportation plan quickly. To enhance the local exploitive ability, the VNS algorithm is hybridized with simulated annealing. The experimental results show that the proposed VNS algorithm is effective.",

keywords = "SDVRP model, Threshold waste weight, VNS, waste collection",

author = "Wencong Zhao and Renqian Zhang and Xi Yuan and Kaiping Luo",

note = "Publisher Copyright: {\textcopyright} 2021 IEEE.; 11th International Conference on Information Science and Technology, ICIST 2021 ; Conference date: 21-05-2021 Through 23-05-2021",

year = "2021",

month = may,

day = "21",

doi = "10.1109/ICIST52614.2021.9440629",

language = "英语",

series = "2021 11th International Conference on Information Science and Technology, ICIST 2021",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "659--667",

booktitle = "2021 11th International Conference on Information Science and Technology, ICIST 2021",

address = "美国",

}

Zhao, W, Zhang, R, Yuan, X & Luo, K 2021, An improved variable neighborhood search algorithm for the solid waste collection and transportation problem with split deliveries. 在 2021 11th International Conference on Information Science and Technology, ICIST 2021., 9440629, 2021 11th International Conference on Information Science and Technology, ICIST 2021, Institute of Electrical and Electronics Engineers Inc., 页码 659-667, 11th International Conference on Information Science and Technology, ICIST 2021, Chengdu, 中国, 21/05/21. https://doi.org/10.1109/ICIST52614.2021.9440629

An improved variable neighborhood search algorithm for the solid waste collection and transportation problem with split deliveries. / Zhao, Wencong; Zhang, Renqian; Yuan, Xi 等.
2021 11th International Conference on Information Science and Technology, ICIST 2021. Institute of Electrical and Electronics Engineers Inc., 2021. 页码 659-667 9440629 (2021 11th International Conference on Information Science and Technology, ICIST 2021).

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

TY - GEN

T1 - An improved variable neighborhood search algorithm for the solid waste collection and transportation problem with split deliveries

AU - Zhao, Wencong

AU - Zhang, Renqian

AU - Yuan, Xi

AU - Luo, Kaiping

PY - 2021/5/21

Y1 - 2021/5/21

N2 - This study addresses the solid waste collection and transportation problem with split deliveries (SWCTPSD). To minimize the total fleet costs, a mixed-integer programming model is proposed. An improved variable neighborhood search (VNS) algorithm is proposed to obtain a high-quality collection and transportation plan quickly. To enhance the local exploitive ability, the VNS algorithm is hybridized with simulated annealing. The experimental results show that the proposed VNS algorithm is effective.

AB - This study addresses the solid waste collection and transportation problem with split deliveries (SWCTPSD). To minimize the total fleet costs, a mixed-integer programming model is proposed. An improved variable neighborhood search (VNS) algorithm is proposed to obtain a high-quality collection and transportation plan quickly. To enhance the local exploitive ability, the VNS algorithm is hybridized with simulated annealing. The experimental results show that the proposed VNS algorithm is effective.

KW - SDVRP model

KW - Threshold waste weight

KW - VNS

KW - waste collection

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

U2 - 10.1109/ICIST52614.2021.9440629

DO - 10.1109/ICIST52614.2021.9440629

M3 - 会议稿件

AN - SCOPUS:85108018063

T3 - 2021 11th International Conference on Information Science and Technology, ICIST 2021

SP - 659

EP - 667

BT - 2021 11th International Conference on Information Science and Technology, ICIST 2021

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 11th International Conference on Information Science and Technology, ICIST 2021

Y2 - 21 May 2021 through 23 May 2021

ER -

Zhao W, Zhang R, Yuan X, Luo K. An improved variable neighborhood search algorithm for the solid waste collection and transportation problem with split deliveries. 在 2021 11th International Conference on Information Science and Technology, ICIST 2021. Institute of Electrical and Electronics Engineers Inc. 2021. 页码 659-667. 9440629. (2021 11th International Conference on Information Science and Technology, ICIST 2021). doi: 10.1109/ICIST52614.2021.9440629

An improved variable neighborhood search algorithm for the solid waste collection and transportation problem with split deliveries

摘要

出版系列

会议

联合国可持续发展目标

访问文件

其它文件与链接

指纹

引用此