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

14th IEEE International Conference on Tools with Artificial Intelligence

作者： Tounsi, M David, P Ecole Mines Dept Comp Sci F-44307 Nantes France

ISBN: (纸本)0769518494

In this paper, we present a new cooperative framework based on using successively two local search algorithms to solve constraint satisfaction and optimization problems. Our technique is based on the integration of local search algorithms as a mechanism to diversify the search instead of using a build on diversification mechanisms. Thus we avoid tuning the multiple parameters to escape from a local optimum. This technique improves the existing methods: it is generic especially when the given problem can be expressed as a constraint satisfaction problem. We present the way the local search algorithm can be used to diversify the search in order to solve real examination timetabling problems. We describe how the local search algorithm can be used to assist any other specific local search algorithm to escape from local optimality.

关键词： constraint satisfaction local search algorithm tabu search timetabling problem.

来源：评论

学校读者我要写书评

暂无评论

Operational optimization at signalized metering roundabouts using cuckoo search/local search algorithm

引用

MEASUREMENT & CONTROL 2022年第9-10期55卷 1110-1123页

作者： An, Hong Ki Liu, Yao Kim, Dong Sun Huaiyin Inst Technol Fac Transportat Engn 1 East Meicheng Rd Huaian 223003 Jiangsu Peoples R China Huaiyin Inst Technol Fac Engn Management Huaian Jiangsu Peoples R China Daejin Univ Sch Civil & Environm Engn Gyeonggi Gyeonggi Do South Korea

A metering roundabout where traffic is controlled by traffic lights with phase times influenced by queue detector occupancy might be the solution to enhance performance when there are unbalanced traffic flows at roundabouts. There have, however, been minimal studies on how the distance of the queue detector from the stop line affects signal phase time durations and the queuing lengths. This research, therefore, seeks to develop a Cuckoo search/local search algorithm using parameters such as arrival volumes, conflicting volumes, detector distance and phase time to investigate the relationship of signal setting, detector location and queuing formulations. Also, some additional statistical tests were performed for the fitness of the data. In order to conduct solid model calibrations and validations, model output data was compared against the AIMSUN model. The results from the analyses demonstrated that the queue detector distance can affect phase time durations and vehicle queuing lengths on the controlling approach as well as queuing lengths on the metered approach. This study showed that, based on the study for the Old Belair Road roundabout, the total queue length (controlling + metered) will be minimized from 689 to 499 m by the proposed methods when the detector is relocated at 210 m from the roundabout stop line, giving longer phase green times and resulting in decreased intersection queuing lengths.

关键词： Metering roundabout detector location AIMSUN cuckoo search local search algorithm

来源：评论

学校读者我要写书评

暂无评论

A multiexchange local search algorithm for the capacitated facility location problem

引用

MATHEMATICS OF OPERATIONS REsearch 2005年第2期30卷 389-403页

作者： Zhang, JW Chen, B Ye, YY NYU Stern Sch Business IOMS Operat Management New York NY 10012 USA Univ Warwick Warwick Business Sch Coventry W Midlands England Stanford Univ Dept Management Sci & Engn Stanford CA 94305 USA

We present a multiexchange local search algorithm for approximating the capacitated facility location problem (CFLP), where a new local improvement operation is introduced that possibly exchanges multiple facilities simultaneously. We give a tight analysis for our algorithm and show that the performance guarantee of the algorithm is between 3 + 2 root 2- epsilon and 3 + 2 root 2- + epsilon for any given constant epsilon > 0. The previously known best approximation ratio for the CFLP is 7.88, as shown by Mahdian and Pal (2003. Universal facility location. Proc. 11th Annual Eur. Sympos. algorithms (ESA), 409-421), based on the operations proposed by Pal et al. (2001. Facility location with hard capacities. Proc. 42nd IEEE Sympos. Foundations Comput. Sci. (FOCS), 329-338). Our upper bound 3+2 root 2-+epsilon also matches the best-known ratio, obtained by Chudak and Williamson (1999. Improved approximation algorithm for capacitated facility location problems. Proc. 7th Conf Integer Programming Combin. Optim. (IPCO), 99-113), for the CFLP with uniform capacities. In order to obtain the tight bound of our new algorithm, we make interesting use of the notion of exchange graph of Pal et al. and techniques from the area of parallel machine scheduling.

关键词： capacitated facility location approximation algorithm local search algorithm

来源：评论

学校读者我要写书评

暂无评论

Parallel heuristic local search algorithm on OTIS hyper hexa-cell and OTIS mesh of trees optoelectronic architectures

引用

APPLIED INTELLIGENCE 2019年第2期49卷 661-688页

作者： Al-Adwan, Aryaf Sharieh, Ahmad Mahafzah, Basel A. Univ Jordan King Abdullah II Sch Informat Technol Comp Sci Dept Amman 11942 Jordan

Heuristic local search algorithms have achieved good results in tackling combinatorial optimization problems, such as Travelling Salesman Problem (TSP). One of the well-known local search algorithms is the 2-opt algorithm. As a local search algorithm, 2-opt has achieved approximate optimal solutions for TSP within a reasonable time, especially for small data instances. However, solving large data instances of TSP using 2-opt requires extensive computation and considerable CPU time. Therefore, this paper presents a parallel version of the 2-opt algorithm, exploiting the features of Optical Transpose Interconnection System (OTIS) in solving the TSP. In this paper, we present the Parallel Repetitive 2-Opt (PRTO) algorithm for solving symmetric TSP on OTIS Hyper Hexa-Cell (OTIS-HHC) and OTIS Mesh of Trees (OTIS-MOT) optoelectronic architectures. We assess the performance of our algorithm analytically in terms of parallel time complexity, speedup, efficiency, cost, and communication cost on both optoelectronic architectures. Furthermore, a set of simulation experiments is conducted on various instances from the standard TSP library. The simulation results confirm that our algorithm is efficient regarding speedup and efficiency. For instance, the PRTO algorithm achieves a speedup of 32.9 for 6880 cities over OTIS-HHC with 36 processors. Moreover, the superiority of PRTO algorithm is shown through solving the TSP on OTIS-HHC and OTIS-MOT;its performance has been compared with the performance of the Parallel Repetitive Nearest Neighbor (PRNN) algorithm in terms of speedup, efficiency, and solution quality. For example, as a best case, the PRTO algorithm has shown 34 times improved speedup over the PRNN algorithm.

关键词： local search algorithm 2-opt algorithm Repetitive nearest neighbor algorithm Travelling salesman problem Interconnection network Optoelectronic architecture

来源：评论

学校读者我要写书评

暂无评论

A local search algorithm for finding optimal transit routes configuration with elastic demand

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL REsearch 2018年第5期25卷 1491-1514页

作者： Zarrinmehr, Amirali Saffarzadeh, Mahmoud Seyedabrishami, Seyedehsan Tarbiat Modares Univ Dept Civil & Environm Engn Tehran Iran

This paper proposes a new local search algorithm for finding the optimal configuration of subroutes from a set of candidate transit routes in a transportation network. It is intended to maximize the transit ridership while holding the budget constraint. In each iteration of the algorithm, route segments that are likely to absorb more transit passengers are added to the configuration and less-contributing segments are removed, instead. A path-based model with elastic demand is applied for traffic assignment problem. The algorithm takes advantage of the equilibrium paths information to speed up the calculations for emerging configurations. A numerical experiment on Sioux-Falls network indicates that the proposed algorithm can achieve high-quality solutions at different levels of budget. Also, the run-time and performance of the algorithm are reported over a large problem instance of the Chicago sketch network with 55 artificial candidate routes.

关键词： transit route optimal configuration elastic demand local search algorithm traffic assignment

来源：评论

学校读者我要写书评

暂无评论

Honey Badger algorithm using lens opposition based learning and local search algorithm

引用

EVOLVING SYSTEMS 2024年第2期15卷 335-360页

作者： Majumdar, Parijata Mitra, Sanjoy Bhattacharya, Diptendu Natl Inst Technol Agartala 799046 West Tripura India Tripura Inst Technol Agartala 799009 West Tripura India

Honey Badger algorithm (HBA) is a recently developed metaheuristic algorithm inspired by the intelligent foraging behavior of Honey Badgers where its digging and honey-finding strategies are simulated in the exploration and exploitation of the search space. However, HBA may suffer from slow convergence speed, unbalanced exploration and exploitation, and local optima stagnation problems. To overcome these limitations, we proposed a modified variant of HBA (LOLSHBA) where Lens Opposition Based Learning is used at the initialization phase to enhance the population quality and diversity and better exploration. The exponential decay function is used as a density factor for accelerating the global convergence speed and for controlling the smooth time-varying transition from exploration to the exploitation phase. A time-varying acceleration constant is also incorporated in the density factor to maintain the balance of local searching and global convergence by emulating a natural reflex action in the movement of honey badgers and guiding the hunting process in each iteration. Finally, to increase exploitation, the local search algorithm is used to boost the search in the local neighborhood of the global best solution at the end of every iteration. For performance evaluation, we utilized well-known benchmark functions where the proposed LOLSHBA performs better in 12 out of 19 functions and 26 out of 29 IEEE CEC 2017 functions. Statistical analyses also validate the superior performance of LOLSHBA. Besides, LOLSHBA is also tested for problem-solving which proves that LOLSHBA is more suitable to handle constrained engineering design problems compared to other optimization algorithms.

关键词： Honey Badger algorithm Lens opposition based learning Exponential decay function Time varying acceleration constant local search algorithm

来源：评论

学校读者我要写书评

暂无评论

AN INTEGRATED DYNAMIC FACILITY LAYOUT AND JOB SHOP SCHEDULING PROBLEM: A HYBRID NSGA-II AND local search algorithm

引用

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 2020年第4期16卷 1801-1834页

作者： Erfani, Behrad Ebrahimnejad, Sadoullah Moosavi, Amirhossein Islamic Azad Univ Karaj Branch Dept Ind Engn Karaj Iran

The aim of this research is to study the dynamic facility layout and job-shop scheduling problems, simultaneously. In fact, this paper intends to measure the synergy between these two problems. In this paper, a multi-objective mixed integer nonlinear programming model has been proposed where areas of departments are unequal. Using a new approach, this paper calculates the farness rating scores of departments beside their closeness rating scores. Another feature of this paper is the consideration of input and output points for each department, which is crucial for the establishment of practical facility layouts in the real world. In the scheduling problem, transportation delay between departments and machines' setup time are considered that affect the dynamic facility layout problem. This integrated problem is solved using a hybrid two-phase algorithm. In the first phase, this hybrid algorithm incorporates the non-dominated sorting genetic algorithm. The second phase also applies two local search algorithms. To increase the efficacy of the first phase, we have tuned the parameters of this phase using the Taguchi experimental design method. Then, we have randomly generated 20 instances of different sizes. The numerical results show that the second phase of the hybrid algorithm improves its first phase significantly. The results also demonstrate that the simultaneous optimization of those two problems decreases the mean flow time of jobs by about 10% as compared to their separate optimization.

关键词： Dynamic facility layout planning job shop scheduling multi-objective optimization unequal area NSGA-II local search algorithm

来源：评论

学校读者我要写书评

暂无评论

A multi-exchange local search algorithm for the capacitated facility location problem - (Extended abstract)

引用

10th International Integer Programming and Combinatorial Optimization Conference

作者： Zhang, JW Chen, B Ye, YY Stanford Univ Dept Management Sci & Engn Sch Engn Stanford CA 94305 USA Univ Warwick Warwick Business Sch Coventry CV4 7AL W Midlands England

ISBN: (纸本)3540221131

We present a multi-exchange local search algorithm for approximating the capacitated facility location problem (CFLP), where a new local improvement operation is introduced that possibly exchanges multiple facilities simultaneously. We give a tight analysis for our algorithm and show that the performance guarantee of the algorithm is between 3 + 2root2 - epsilon and 3 + 2 root2 + epsilon for any given constant epsilon > 0. Previously known best approximation ratio for the CFLP is 7.88, due to Mahdian and Pal (2003), based on the operations proposed by Pal, Tardos and Wexler (2001). Our upper bound 3 + 2root2 + epsilon also matches the best known ratio, obtained by Chudak and Williamson (1999), for the CFLP with uniform capacities. In order to obtain the tight bound of our new algorithm, we make interesting use of the notion of exchange graph of Pal et al. and techniques from the area of parallel machine scheduling.

关键词： capacitated facility location approximation algorithm local search algorithm

来源：评论

学校读者我要写书评

暂无评论

VLSs: A local search algorithm for Distributed Constraint Optimization Problems

引用

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE 2022年第3期36卷

作者： Li, Fukui He, Jingyuan Zhou, Mingliang Fang, Bin Chongqing Univ Sch Comp Sci Chongqing 400044 Peoples R China

local search algorithms are widely applied in solving large-scale distributed constraint optimization problem (DCOP). Distributed stochastic algorithm (DSA) is a typical local search algorithm to solve DCOP. However, DSA has some drawbacks including easily falling into local optima and the unfairness of assignment choice. This paper presents a novel local search algorithm named VLSs to solve the issues. In VLSs, sampling according to the probability corresponding to assignment is introduced to enable each agent to choose other promising values. Besides, each agent alternately performs a greedy choice among multiple parallel solutions to reduce the chance of falling into local optima and a variance adjustment mechanism to guide the search into a relatively good initial solution in a periodic manner. We give the proof of variance adjustment mechanism rationality and theoretical explanation of impact of greed among multiple parallel solutions. The experimental results show the superiority of VLSs over state-of-the-art DCOP algorithms.

关键词： Multi-agent system distributed constraint optimization problem local search algorithm incomplete algorithm

来源：评论

学校读者我要写书评

暂无评论

A local search Approximation algorithm for the Restricted Universal Facility Location Problem 3

A Local Search Approximation Algorithm for the Restricted Un...

引用

3rd International Conference on Data Science and Engineering (ICDSE)

作者： Kanodia, Uttam Shukla, K. K. IIT BHU Comp Sci & Engn Varanasi Uttar Pradesh India

ISBN: (纸本)9781509012817

This paper deals with a specialized universal facility location problem. In the general universal facility location problem, we are given a set of clients D and a set of facilities F, where each client has a certain demand, and each facility has a certain capacity. Each client has to be assigned to facilities from where it will be served. The additional restriction considered in this paper is that each client can fulfill only one unit of its demand from each facility.

关键词： universal facility problem approximation ratio performance guarantee local search algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：