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

An adaptive structure on a new local branching algorithm using instantaneous dimensions and convergence speed: a case study for multi-commodity network design problems

引用

SN APPLIED SCIENCES 2020年第6期2卷 1-14页

作者： Hajiyan, Hooria Yaghini, Masoud McMaster Univ Continuing Educ Hamilton ON Canada Iran Univ Sci & Technol Dept Rail Transportat Engn Tehran Iran

This study presents an adaptive parameter control structure for the New local branching algorithm (NLBA) to enhance the overall efficiency of the algorithm by implementing an exploitation and exploration approach within solution search subspaces. In other words, the optimization problem is divided into several sub-problems and the proposed adaptive parameter control structure introduces some deterministic rules to check the convergence speed and adapt the performance of the algorithm in each subspace. So, the proposed adaptive structure uses an exploration approach to avoid becoming trapped at local optimum that may not be the global optimum, as well as an exploitation approach to look near good solutions for even better ones at each iteration. To evaluate the performance of the proposed adaptive parameter control structure, 26 multi-commodity network design problems are tested. The experimental results of this adaptive structure for NLBA (ANLBA) confirm that its performance compared to the original NLBA, a hybrid structure that consists of the Self-Adaptive Harmony Search (SAHS) algorithm as a parameter tuning method for NLBA, and CPLEX is significantly improved.

关键词： local branching algorithm Parameter setting Adaptive parameter control Exploitation Exploration

来源：评论

学校读者我要写书评

暂无评论

An improved local branching approach for train formation planning

引用

APPLIED MATHEMATICAL MODELLING 2013年第4期37卷 2300-2307页

作者： Yaghini, Masoud Momeni, Mohsen Sarmadi, Mohammadreza Iran Univ Sci & Technol Dept Rail Transportat Engn Tehran Iran

The train formation plan (TFP) determines routing and frequency of trains, and assigns the demands to trains. In this paper, an improved local branching algorithm is proposed for the TFP model in Iranian railway. This solution strategy is exact in nature, although it is designed to improve the heuristic behavior of the mixed integer programming (MIP) solver at hand. In the local branching algorithm, additional constraints are built in the model for the binary variables, but in the improved local branching algorithm, the additional constraints are built in the model for integer variables. A state-of-the-art method is applied for parameter tuning using design of experiments approach. To evaluate the proposed solution method, we have simulated and solved twenty test problems. The results show the efficiency and effectiveness of the proposed approach. The proposed algorithm is implemented for Iranian Railway network as a case study. (C) 2012 Elsevier Inc. All rights reserved.

关键词： Rail transportation planning Train formation plan local branching algorithm Capacitated service network design problem Metaheuristic Iranian railway

来源：评论

学校读者我要写书评

暂无评论

Capacity Consumption Analysis Using Heuristic Solution Method for Under Construction Railway Routes

引用

NETWORKS & SPATIAL ECONOMICS 2014年第3-4期14卷 317-333页

作者： Yaghini, Masoud Sarmadi, Mohammadreza Nikoo, Nariman Momeni, Mohsen Iran Univ Sci & Technol Sch Railway Engn Dept Rail Transportat Engn Tehran Iran

In this paper, a compressed timetable is generated to calculate capacity consumption for under construction railway routes using an optimization approach. Since the detailed timetable for under construction routes does not exist, the timetable is not required in the applied model. The model generates a compressed timetable based on UIC 406 method. The capacity consumption problem is formulated as a multicommodity network design model on a space-discrete time network. A local branching heuristic algorithm is proposed to solve the model. The main idea underlining the local branching algorithm is the utilization of a general mixed integer programming solver to explore neighborhoods and locally search around the best-known solution by employing tree search. The parameters of the algorithm are tuned by using design of experiments. The proposed method is implemented in Iran Railways and the results are reported.

关键词： Railway routes Capacity consumption UIC capacity calculation method Train timetabling Discrete-time multicommodity network design model local branching algorithm

来源：评论

学校读者我要写书评

暂无评论

A hybrid solution method for fuzzy train formation planning

引用

APPLIED SOFT COMPUTING 2015年 31卷 257-265页

作者： Yaghini, Masoud Momeni, Mohsen Sarmadi, Mohammadreza Iran Univ Sci & Technol Dept Rail Transportat Engn Tehran Iran

The train formation plan (TFP) determines the routing and frequency of trains, and assigns the demands to trains. In this paper, in order to consider the real-life condition of railways, a mathematical model with fuzzy costs is proposed for train formation planning in Iranian railway. In this fuzzy model, the costs are considered in three scenarios, namely optimistic, normal and pessimistic. The model is formulated based on the fixed-charge capacitated multicommodity network design problem. Since the TFP problem is NP-hard, an efficient hybrid algorithm combining local branching and relaxation induced neighborhood search methods is presented. A three-step method is applied for parameter tuning using design of experiments approach. To evaluate the efficiency and effectiveness of the proposed algorithm, the results are compared with those of the state-of-the-art optimization software. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Fuzzy train formation model Hybrid algorithm local branching algorithm Relaxation induced neighborhood search method Design of experiments

来源：评论

学校读者我要写书评

暂无评论

An efficient heuristic algorithm for the capacitated median problem

引用

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 2013年第3期11卷 229-248页

作者： Yaghini, Masoud Momeni, Mohsen Sarmadi, Mohammadreza Ahadi, Hamid Reza Iran Univ Sci & Technol Sch Railway Engn Dept Rail Transportat Engn Tehran Iran

The capacitated -median problem (CPMP) is one of the well-known facility-location problems. The objective of the problem is to minimize total cost of locating a set of capacitated service points and allocating a set of demand points to the located service points, while the total allocated demand for each service point is not be greater than its capacity limit. This paper presents an efficient heuristic algorithm based on the local branching and relaxation induced neighborhood search methods for the CPMP. The proposed algorithm is a heuristic technique that utilizes a general mixed integer programming solver to explore neighborhoods. The parameters of the proposed algorithm are tuned by design of experiments. The proposed method is tested on a large set of benchmark instances. The results show that the method outperforms the best method found in the literature.

关键词： Location-allocation problem Capacitated p-median problem Heuristic algorithm local branching algorithm Relaxation induced neighborhood search method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：