
Vehicle Routing Problem with Time Windows Arising in Urban Delivery
Author(s) -
Yin Cao,
Xiangfei Zhang,
Zhanyuan Guo
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1626/1/012097
Subject(s) - vehicle routing problem , wright , computer science , routing (electronic design automation) , plan (archaeology) , operations research , city logistics , window (computing) , travel time , simulation , transport engineering , mathematical optimization , engineering , embedded system , mathematics , operating system , archaeology , history , programming language
Delivery is an important part of logistics operation. The way to plan the vehicle route with consideration of the demand, time window and total travel cost will directly affect the operation cost and the efficiency of delivery. In this paper, a mathematical model of the vehicle routing with time windows arising in urban delivery was formulated, and Clarke and Wright saving algorithm was used to solve it. A real case of a company was used to test its performance. The result shows that the Clarke and Wright saving algorithm is more effective than the actual operation of the company.