期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 185, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2023.109676
关键词
Delivery and installation; Mixed integer linear programming; Variable neighborhood search; Vehicle sharing; Synchronized delivery
This paper presents the real-life synchronized delivery and installation with vehicle sharing problem and proposes a mixed integer linear program and a heuristic algorithm for its solution. Extensive experimentation shows the superiority of the proposed methods in solving vehicle routing problems with time windows and the benefits of shared installation vehicles in reducing costs.
This paper presents the real-life synchronized delivery and installation with vehicle sharing problem (SDIVSP). Two fleets of vehicles serve a set of customers within their specified time windows. Delivery vehicles drop products to customers while installation vehicles drop and pick up technicians without necessarily waiting for them. Delivery must precede installation. This paper models SDIVSP as a mixed integer linear program, which solves small-sized instances. For large instances, this paper proposes a heuristic HALNS that hybridizes adaptive large neighborhood search and variable neighborhood search. Extensive experimentation provides computational evidence of the superiority of HALNS when solving well-known benchmark instances of (synchronized) vehicle routing problems with time windows and its effectiveness in tackling newly proposed SDIVSP instances. HALNS outperforms two state-of-the-art algorithms by an average 6.41% and 12.43% on synchronized vehicle routing with time windows benchmark sets. It further provides computational evidence of the benefits of shared installation vehicles: Total cost decreases by 41.72% and 35.35% as the installation vehicle capacity increases for tight and large time windows respectively.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据