检索结果-南通市图书馆

THE PERIODIC CAPACITATED ARC ROUTING PROBLEM LINEAR PROGRAMMING MODEL, METAHEURISTIC AND LOWER BOUNDS

Systems Science and Systems Engineering 2004年第4期13卷 423-435页

作者： Nacima LABADI Christian PRINS fre cnrs 2732 istit-osi university of technology of troyes 12 rue marie curie BP2060 10010 Troyes France FRE CNRS 2732 ISTIT-OSI University of Technology of Troyes 12 rue Marie Curie BP2060 10010 Troyes France

The Periodic Capacitated Arc Routing Problem (PCARP) generalizes the well known NP-hard Capacitated Arc Routing Problem (CARP) by extending the single period to multi-period horizon. The Capacitated Arc Routing Problem (CARP) is defined on an undirected network in which a fleet of identical vehicles is based at a depot node. A subset of edges, called tasks, must be serviced by a vehicle. The CARP consists of determining a set of feasible vehicle trips that minimizes the total cost of traversed edges. The PCARP involves the assignment of tasks to periods and the determination of vehicles trips in each period, to minimize the total cost on the whole horizon. This new problem arises in various real life applications such as waste collection, mail delivery, etc. In this paper, a new linear programming model and preliminary lower bounds based on graph transformation are proposed. A meta-heuristic approach - Scatter Search (SS) is developed for the PCARP and evaluated on a large variety of instances.

关键词： PCARP linear programming lower bound transformed graph scatter search

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

The Periodic Capacitated Arc Routing Problem: Linear Programming Model, Metaheuristic and Lower Bounds

The Periodic Capacitated Arc Routing Problem: Linear Program...

引用

ICSSSM'04国际会议

作者： Nacima LABADI Christian PRINS fre cnrs 2732 istit-osi-university of technology of troyes 12 rue marie curie BP 2060 F-10010 Troyes Cedex France fre cnrs 2732 istit-osi-university of technology of troyes 12 rue marie curie BP 2060 F-10010 Troyes Cedex France

＜正＞ The Periodic Capacitated Arc Routing Problem （PCARP） generalizes the well known NP-hard Capacitated Arc Routing Problem （CARP） by extending the single period to multi-period horizon. The Capacitated Arc Routing Problem （CARP） is defined on an undirected network in which a fleet of identical vehicles is based at a depot node. A subset of edges, the tasks, must be serviced by a vehicle. The CARP consists of determining a set of feasible vehicle trips that minimizes the total cost of traversed edges. The PCARP involves the assignment of tasks to periods and the determination of vehicles trips of in each period, to minimize the total cost on the whole horizon. This new problem is encountered in various real life applications such as waste collection, mail delivery, etc. In this paper, a new linear programming model and the first lower bounds based on a graph transformation are proposed. A metaheuristic approach-Scatter Search （SS）-for the PCARP is developed and evaluated on a large variety of instances.

关键词： PCARP Linear Programming Lower bound Transformed Graph Scatter Search

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：