检索结果-内蒙古大学图书馆

Optimal location-multi-allocation-routing in capacitated transportation networks under population-dependent travel times

引用

INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING 2016年第6期29卷 652-676页

作者： Shiripoura, Saber Mahdavi-Amiri, Nezam Mahdavi, Iraj Mazandaran Univ Sci & Technol Dept Ind Engn Babol Sar Iran Sharif Univ Technol Fac Math Sci Tehran Iran

A capacitated location-multi-allocation-routing model is presented for a transportation network with travel times between the nodes represented by links on the network. The concept of multi-allocation arises from the possibility of allocating the population in a demand node to more than one server node. In normal conditions, travel time between two nodes is a fixed value. However, since the flow of population in a link can affect the travel time, here the impact of the population flow on link time is considered to be simultaneous. This way, distribution of the population over the network has a direct influence on the travel link times. It is assumed that all links are two-way and capacities of the server nodes and arcs for accepting population are limited. Our aim is to ?nd optimal locations of server node(s), optimal allocation of the population in demand nodes to the server(s) and optimal allocation of the population of the nodes to different routes to reach the assigned servers so that total transportation time is minimised. First, the proposed problem is formulated as a mixed-integer non-linear programming model, followed by its suitable transformation into a mixed-integer linear programming problem. Then, a standard genetic algorithm (GA) and a heuristic algorithm combining genetic algorithm and local search (GALS) are presented to solve large instances of the problem. Finally, three sets of numerical experiments are made to compare the results obtained by CPLEX, standard GA and GALS. Numerical results show outperformance of GALS over CPLEX and the standard GA.

关键词： genetic algorithm mixed-integer linear programming local search population-dependent travel times capacitated location-multi-allocation-routing problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：