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

School of Economics and Management

Beihang University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

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.

Original language	English
Title of host publication	2021 11th International Conference on Information Science and Technology, ICIST 2021
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	659-667
Number of pages	9
ISBN (Electronic)	9781665412667
DOIs	https://doi.org/10.1109/ICIST52614.2021.9440629
State	Published - 21 May 2021
Event	11th International Conference on Information Science and Technology, ICIST 2021 - Chengdu, China Duration: 21 May 2021 → 23 May 2021

Publication series

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

Conference

Conference	11th International Conference on Information Science and Technology, ICIST 2021
Country/Territory	China
City	Chengdu
Period	21/05/21 → 23/05/21

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 12 Responsible Consumption and Production

Keywords

SDVRP model
Threshold waste weight
VNS
waste collection

Access to Document

10.1109/ICIST52614.2021.9440629

Cite this

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. In 2021 11th International Conference on Information Science and Technology, ICIST 2021 (pp. 659-667). Article 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 et al. / 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. pp. 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. in 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., pp. 659-667, 11th International Conference on Information Science and Technology, ICIST 2021, Chengdu, China, 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 et al.
2021 11th International Conference on Information Science and Technology, ICIST 2021. Institute of Electrical and Electronics Engineers Inc., 2021. p. 659-667 9440629 (2021 11th International Conference on Information Science and Technology, ICIST 2021).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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. In 2021 11th International Conference on Information Science and Technology, ICIST 2021. Institute of Electrical and Electronics Engineers Inc. 2021. p. 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

Abstract

Publication series

Conference

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this