ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

The vehicle routing problem with simultaneous pickup and delivery and occasional drivers

Yu, Vincent F.; Aloina, Grace; Jodiawan, Panca*; Gunawan, Aldy; Huang, Tsung-Chi
EXPERT SYSTEMS WITH APPLICATIONS2023-3-15DOI: 10.1016/j.eswa.2022.119118
18被引4阅读
引用收藏
分享

摘要

This research addresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Occasional Drivers (VRPSPDOD), which is inspired from the importance of addressing product returns and the emerging notion of involving available crowds to perform pickup and delivery activities in exchange for some compen-sation. At the depot, a set of regular vehicles is available to deliver and/or pick up customers' goods. A set of occasional drivers, each defined by their origin, destination, and flexibility, is also able to help serve the cus-tomers. The objective of VRPSPDOD is to minimize the total traveling cost of operating regular vehicles and total compensation paid to employed occasional drivers. We cast the problem into a mixed integer linear program-ming model and propose a simulated annealing (SA) heuristic with a mathematical programming-based con-struction heuristic to solve newly generated VRPSPDOD benchmark instances. The proposed SA incorporates a set of neighborhood operators specifically designed to address the existence of regular vehicles and occasional drivers. Extensive computational experiments show that the proposed SA obtains comparable results with the state-of-the-art algorithms for solving VRPSPD benchmark instances - i.e., the special case of VRPSPDOD - and outperforms the off-the-shelf exact solver - i.e., CPLEX - in terms of solution quality and computational time for solving VRPSPDOD benchmark instances. Lastly, sensitivity analyses are presented to understand the impact of various OD parameters on the objective value of VRPSPDOD and to derive insightful managerial insights.

学科与关键词

关键词
Simultaneous pickup and deliveryOccasional driverSimulated AnnealingVehicle routing problem
相关
加载中…
  • A review of vehicle routing with simultaneous pickup and delivery
    Koc, Cagri; Laporte, Gilbert; Tukenmez, IlknurCOMPUTERS & OPERATIONS RESEARCH, 2020, 122: 104987.被引 108
  • The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers
    Yu, Vincent F.; Susanto, Hadi; Yeh, Yu-Hsuan; Lin, Shih-Wei*; Huang, Yu-TsungMathematics, 2022, 10(6): 920.被引 16
  • Solving Generalized Vehicle Routing Problem With Occasional Drivers via Evolutionary Multitasking
    Feng, Liang*; Zhou, Lei; Gupta, Abhishek; Zhong, Jinghui; Zhu, Zexuan; Tan, Kay-Chen; Qin, KaiIEEE Transactions on Cybernetics, 2021, 51(6): 3171-3184.被引 54
查看全部 →

发表信息

论文状态
公开发表
期刊
EXPERT SYSTEMS WITH APPLICATIONS
发表日期
2023-03-15
卷期
第 214 卷
页码
119118
DOI
10.1016/j.eswa.2022.119118
语言
ENGLISH
成果收录
SCIE
资助标注
Ministry of Science and Technology of the Republic of China (Taiwan) [MOST 109- 2410-H-011-010-MY3]; Featured Areas Research Center Program; Ministry of Education (MOE) in Taiwan

作者

  • Y

    Yu, Vincent F. (第一作者)

  • A

    Aloina, Grace

查看全部 5 位作者收起作者
  • J

    Jodiawan, Panca (通讯)

  • G

    Gunawan, Aldy

  • H

    Huang, Tsung-Chi

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417