检索结果-南通市图书馆

taboo search algorithm for Item Assignment in Synchronized Zone Automated Order Picking System

Chinese Journal of Mechanical Engineering 2014年第4期27卷 860-866页

作者： WU Yingying WU Yaohua School of Control Science and Engineering Shandong University

The idle time which is part of the order fulfillment time is decided by the number of items in the zone; therefore the item assignment method affects the picking efficiency. Whereas previous studies only focus on the balance of number of kinds of items between different zones but not the number of items and the idle time in each zone. In this paper, an idle factor is proposed to measure the idle time exactly. The idle factor is proven to obey the same vary trend with the idle time, so the object of this problem can be simplified from minimizing idle time to minimizing idle factor. Based on this, the model of item assignment problem in synchronized zone automated order picking system is built. The model is a form of relaxation of parallel machine scheduling problem which had been proven to be NP-complete. To solve the model, a taboo search algorithm is proposed. The main idea of the algorithm is minimizing the greatest idle factor of zones with the 2-exchange algorithm. Finally, the simulation which applies the data collected from a tobacco distribution center is conducted to evaluate the performance of the algorithm. The result verifies the model and shows the algorithm can do a steady work to reduce idle time and the idle time can be reduced by 45.63% on average. This research proposed an approach to measure the idle time in synchronized zone automated order picking system. The approach can improve the picking efficiency significantly and can be seen as theoretical basis when optimizing the synchronized automated order picking systems.

关键词： taboo search algorithm synchronized zone order picking idle time idle factor

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Improved taboo search algorithm for designing DNA sequences

引用

Progress in Natural Science:Materials International 2008年第5期18卷 623-627页

作者： Kai Zhang a, Jin Xu a,b, Xiutang Geng a, Jianhua Xiao a, Linqiang Pana, a The Key Laboratory of Image Processing and Intelligent Control, Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China b School of Electronic Engineering and Computer Science, Peking University, Beijing 100871, China The Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China School of Electronic Engineering and Computer Science Peking University Beijing 100871 China

The design of DNA sequences is one of the most practical and important research topics in DNA computing. We adopt taboo search algorithm and improve the method for the systematic design of equal-length DNA sequences, which can satisfy certain combinatorial and thermodynamic constraints. Using taboo search algorithm, our method can avoid trapping into local optimization and can nd a set of good DNA sequences satisfying required constraints.

关键词： DNA computing taboo search algorithm DNA sequence design

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

A Study on the taboo search algorithm for the Open Vehicle Routing Problem with Hard Time Windows

A Study on the Taboo Search Algorithm for the Open Vehicle R...

引用

2012年计算机应用与系统建模国际会议

作者： Wang Shuxia Xiong ying Wang Zengqiang Departmet of computer science Tonhua Normal University Qinghe Middle School in Ji'an

In this paper studying open vehicle routing problem, a taboo search algorithm for the open vehicle routing problem with hard time windows is proposed. After constructing a mathematical model for the problem, this paper focuses on the introduction of the design procedure of TS algorithm for solving the problem. In the searching process of this algorithm, infeasible solution is allowed by adding a penalizing factor, to reduce the probability of local optimal. The computational results are provided. It shows that in most of cases this algorithm can find better solutions.

关键词： open vehicle routing problem hard time windows taboo search algorithm

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

LOCATING TRANSPORT TERMINALS IN A CITY

LOCATING TRANSPORT TERMINALS IN A CITY

引用

第一届交通运输工程国际学术会议

作者： YANG Zhongzhen1 and WU Weiqing2 1Transportation and Logistics College, Dalian Maritime University 2Transportation and Logistics College, Dalian Maritime University

This paper optimizes the number, location and scale of transport terminals in a city with traffic planning theories and super transport network. Based on the super-network and trip OD, a bi-level planning model to locate transport terminals is developed, where the upper model maximizes social benefit and minimizes the cost of the terminals while the lower model assigns the trip OD of all modes on the super-network. To solve the model, an improved taboo search algorithm is used to realize the iterations between the upper and the lower sub-models.

关键词： Super transportation network transportation terminal bi-level planning model taboo search algorithm

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

A Selection-route Model and Its algorithm for Military Logistics Delivery in an Emergency

A Selection-route Model and Its Algorithm for Military Logis...

引用

2012年计算机应用与系统建模国际会议

作者： Wang guiqiang Qi Jidong Zhang Yuyi Li Jinhua Yang Fuqian Dept.of Handling Facilities Military Transportation University

A vehicle routing problem in a war is discussed, in which some routes may be destroyed uncertainly by competitor. A two-stage integer program model is constructed. The value of a route in a uncertain situation is analyzed. Find a method to simply the computation of the object value of the model. In the method, only the maximum value and the minimum value are countered into the object value. A two-stage taboo search algorithm is designed. In the end, an example is given.

关键词： Emergency logistics vehicle routing problem uncertain decision taboo search algorithm

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：