期刊
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
卷 85, 期 -, 页码 99-111出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.engappai.2019.06.006
关键词
Transportation; Particle swarm optimization; Vehicle routing problem; Selective problem; Transfers
类别
资金
- ANR (French National Research Agency), France
- program of the China Scholarship Council [201504490057]
- Pole Velicule du Futur [ANR-14-CE22-0017]
In pickup and delivery problems, all the demands should be transported from pickup points (suppliers) to delivery points (customers) by vehicles while respecting a set of constraints. Honoring all demands is sometimes impossible when taking all the constraints into account. Therefore, the selective aspect is added to relax the constraint that all the demands should be satisfied. This paper studies a variant called the selective pickup and delivery problem with transfers (SPDPT). The transfers mean that some demands can be transferred from one vehicle to another one, which gives a chance to find more solutions. A mixed integer linear program is firstly proposed to describe the studied problem. Two objectives have been considered in the paper, maximizing the profit and minimizing the distance. The model is then validated on new generated instances. Due to the complexity of the problem, large instances could not be solved to optimality in a reasonable time. As an alternative, a new metaheuristic based on a hybrid particle swarm optimization is developed to tackle this bi-objective problem. The results show that this proposed method is efficient and competitive.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据