New construction heuristic algorithm for solving the vehicle routing problem with time windows | |
Liu J(刘军) | |
刊名 | IET Collaborative Intelligent Manufacturing |
2019 | |
卷号 | 1期号:3页码:90-96 |
关键词 | Heuristic algorithms Optimization Routing algorithms Sales Vehicle routing |
DOI | 10.1049/iet-cim.2019.0035 |
英文摘要 | The vehicle routing problem with time windows (VRPTW) is the most important and widely studied combinational optimisation problem. However, most constructive heuristics create a new path when the customer violates the constraint and cannot insert into any existing path, causing the time window constraint to be tight and generating more paths. Aiming at the above problems, a new constructive heuristic algorithm is proposed. The algorithm firstly uses the convex hull of the customer location to determine the initial seed client and reduces the redundant path; meanwhile, the calculation method of the traditional |
语种 | 英语 |
出版者 | Institution of Engineering and Technology |
内容类型 | 期刊论文 |
源URL | [http://ir.lut.edu.cn/handle/2XXMBERH/103342] |
专题 | 机电工程学院 |
作者单位 | 兰州理工大学 |
推荐引用方式 GB/T 7714 | Liu J. New construction heuristic algorithm for solving the vehicle routing problem with time windows[J]. IET Collaborative Intelligent Manufacturing,2019,1(3):90-96. |
APA | Liu J.(2019).New construction heuristic algorithm for solving the vehicle routing problem with time windows.IET Collaborative Intelligent Manufacturing,1(3),90-96. |
MLA | Liu J."New construction heuristic algorithm for solving the vehicle routing problem with time windows".IET Collaborative Intelligent Manufacturing 1.3(2019):90-96. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论