Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Teimoury, Ebrahim; * | Rashid, Reza
Affiliations: Department of Industrial Engineering, Iran University of Science and Technology, Narmak, Tehran, Iran
Correspondence: [*] Corresponding author. Ebrahim Teimoury. Tel.: +98 21 7322 5022. E-mail: [email protected].
Abstract: In recent years, e-commerce has become increasingly popular, and consumers expect quick and affordable delivery, placing additional pressure on city logistics activities. An innovative approach is proposed to coordinate ground vehicles and drones for delivery services, which has gained tremendous attention from academia and logistic service providers. This paper introduces a variant of this problem: the two-echelon truck and drone routing problem, characterized by stochastic demand existence and soft time windows. A Markov chain is used to model the problem, and a linear mathematical model is presented. This work employs a hybrid large-neighborhood search approach. Numerous computational experiments are conducted to evaluate the performance of the proposed solution method, and the results demonstrate its efficacy.
Keywords: Last-mile delivery, truck and drone routing, stochastic optimization, Markov chain, large-neighborhood search
DOI: 10.3233/JIFS-224307
Journal: Journal of Intelligent & Fuzzy Systems, vol. 44, no. 6, pp. 10197-10211, 2023
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]