Stochastic Travel-time Vehicle Routing Problem with Simultaneous Pick-up and Delivery Considering Soft Time Windows

doi:10.11908/j.issn.0253-374x.22169

Home > Archive>Volume 51, Issue 8, 2023 >1278-1287. DOI:10.11908/j.issn.0253-374x.22169

Stochastic Travel-time Vehicle Routing Problem with Simultaneous Pick-up and Delivery Considering Soft Time Windows
DOI:
                        10.11908/j.issn.0253-374x.22169
                    
CSTR:
                        [cstr]
                    
Author:
                        ZHANG Tao1,2ZHANG Tao
School of Information Management and Engineering， Shanghai University of Finance and Economics， Shanghai 200433， China;Shanghai Key Laboratory of Financial Information Technology （Shanghai University of Finance and Economics）， Shanghai 200433， China
Find this author on All Journals
Find this author on BaiDu
Search for this author on this site
WANG Chuchu1WANG Chuchu
School of Information Management and Engineering， Shanghai University of Finance and Economics， Shanghai 200433， China
Find this author on All Journals
Find this author on BaiDu
Search for this author on this site

                    
Affiliation:1.School of Information Management and Engineering， Shanghai University of Finance and Economics， Shanghai 200433， China;2.Shanghai Key Laboratory of Financial Information Technology (Shanghai University of Finance and Economics)， Shanghai 200433， China
Clc Number:O223
Fund Project:

Article

Figures

Metrics

Reference

Cited by

Materials

Comments

Abstract:

According to the constraints of the total vehicle travel time， vehicle load， and the soft time windows， we studied the stochastic travel-time vehicle routing problem with simultaneous pick-up and delivery （STT-VRPSPD） considering soft time windows and established a chance-constrained programming model. Combining the tabu search algorithm with the scatter search algorithm， a hybrid scatter tabu search （HSTS） algorithm was constructed， and the C-W saving algorithm was used to generate initial solutions. Based on the classic Dethloff instances and Solomon time window generation method， 20 groups of instances including 50 customers and 20 groups of instances including 200 customers were generated respectively for numerical tests. The numerical results verify the effectiveness of the HSTS algorithm.

Key words:stochastic travel-time vehicle routing problem (STT-VRP);vehicle routing problem with simultaneous pick-up and delivery (VRPSPD);soft time windows;hybrid scatter tabu search (HSTS) algorithm

Get Citation

ZHANG Tao, WANG Chuchu. Stochastic Travel-time Vehicle Routing Problem with Simultaneous Pick-up and Delivery Considering Soft Time Windows[J].同济大学学报(自然科学版),2023,51(8):1278~1287

Copy

Article Metrics

Abstract:207
PDF: 693
HTML: 92
Cited by: 0

History

Received:April 12,2022
Revised:
Adopted:
Online: August 28,2023
Published:

Get Citation

Share

Article Metrics

History

Article QR Code