| 注册
首页|期刊导航|哈尔滨商业大学学报(自然科学版)|具有时间窗的取送货问题建模和大邻域搜索算法

具有时间窗的取送货问题建模和大邻域搜索算法

程谦 张大力 侯立文

哈尔滨商业大学学报(自然科学版)2016,Vol.32Issue(6):734-739,751,7.
哈尔滨商业大学学报(自然科学版)2016,Vol.32Issue(6):734-739,751,7.

具有时间窗的取送货问题建模和大邻域搜索算法

Study on model for pickup and delivery problem with time windows and large neighborhood search algorithm

程谦 1张大力 1侯立文2

作者信息

  • 1. 上海交通大学中美物流研究院,上海200030
  • 2. 上海交通大学安泰经济与管理学院,上海200030
  • 折叠

摘要

Abstract

In order to solve the newly emerged route optimization problem in logistics indus-try, a model of pickup and delivery problem with time windows was built in this paper , in which vehicles were assigned with different originations and destinations .Time windows for drivers are also taken into account .According to the characteristic of this model , a large neighborhood search algorithm was proposed , in which matching rate is introduced to in-crease search efficiency .Finally, a comparative test was conducted between the algorithm and exact solver .The effectiveness of the algorithm was verified .

关键词

取送货问题/时间窗/大邻域搜索算法

Key words

pickup and delivery problem/time window/large neighborhood search algorithm

分类

管理科学

引用本文复制引用

程谦,张大力,侯立文..具有时间窗的取送货问题建模和大邻域搜索算法[J].哈尔滨商业大学学报(自然科学版),2016,32(6):734-739,751,7.

基金项目

国家自然科学基金资助项目 ()

哈尔滨商业大学学报(自然科学版)

1672-0946

访问量0
|
下载量0
段落导航相关论文