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

Solving the Permutation Flow Shop Problem with Makespan Criterion using Grids

INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING 2011年第2期4卷 53-64页

作者： Kouki, Samia Jemni, Mohamed Ladhari, Talel Univ Tunis Ecole Super Sci & Tech Tunis Res Lab UTIC Tunis Tunisia Polytech Sch Tunisia ROI Combinatorial Optimizat Res Grp La Marsa Tunisia King Saud Univ Coll Engn Dept Ind Engn Princess Fatimah Al Nijriss Res Adv Mfg Technol Riyadh 11421 Saudi Arabia

The optimization of scheduling problems is based on different criteria to optimize. One of the most important criteria is the minimization of completion time of the last task on the last machine called makespan. In this paper, we present a parallel algorithm for solving the permutation flow shop problem. Our algorithm is a basic parallel distributed algorithm deployed in a grid of computer (Grid' 5000). The objective of this work is minimizing the total makespan of the tasks. Our algorithm uses the exact branch and bound method to find optimal solutions of the problem through the distribution of the tasks among the available processors. Computational results of our parallel algorithm using well known Taillard's benchmarks, showed encouraging results. In particular, we succeeded to solve two new instances to optimality which had never been resolved before neither in sequential nor in parallel [29].

关键词： Permutation Flow Shop problem branch and bound algorithm parallel algorithms Parallel computing grid computing

来源：评论

学校读者我要写书评

暂无评论

An Improved algorithm of Integer Programming to Solve the Cournot Model

An Improved Algorithm of Integer Programming to Solve the Co...

引用

2008 International Seminar on Business and Information Management

作者： Wang Zhu-fang,Liu Ying-jie Management School Shenyang University of Technology Shenyang,P.R.China

Nash Equilibrium is the solution of the Cournot Model considering the reaction functions provided that outputs are *** in practice,the outputs of some products are not *** improved branch and bound algorithm is proposed combining the Nash Equilibrium,considering the discontinuous *** proposed algorithm is different from the traditional algorithm where the respond functions would be converted into *** the improved algorithm is used to calculate the output of each manufacturer,the worst solution arising in the mid-process of calculation will be removed firstly,and then the final common integer solution of all manufactures will be the optimal *** procedure of the proposed algorithm is explicated in this *** example where two manufactures exist is studied,and the results validate the effectiveness of the method.

关键词： quantitative economics cournot model branch and bound algorithm integer program game

来源：评论

学校读者我要写书评

暂无评论

Improved Model for Strategic-loading-station Location Problem under Incomplete Information

Improved Model for Strategic-loading-station Location Proble...

引用

2011 International Conference on Advanced Materials and Computer Science(ICAMCS 2011)

作者： REN Qi-liang LI Ming-ming LI Qing CHEN JIN Shan LI Bo School of Traffic & Transportation Chongqing Jiaotong University

In order to realize scientific planning the layout of strategic loading station,the strategic-loading-station location problem was proposed,which is related to determine the location of each stay with station and the transportation plan on the precise of satisfying the general location constraints and problem related special constraintsBased on theory of capacitated facility location with multiple souring in two stage supply chain,one mixed integer linear programming model was established which took whole logistic cost embedding transportation and location costs as objectiveWhen confronted with small and medium size problem,this model could be exactly solved by optimization software using branch and bound algorithm,and when the problem size was big,this model could be heuristically solved by genetic algorithm which used 0-1 and priority-based combined encoding method to represent solution,cost-based and random-generated combined method to generate initial solution,solution repaired strategy and penalty method and special fitness function to deal illegal individual,and greedy based method to heuristically solve transshipment problemAt last,according to computational tests on randomly generated data demonstrated the practical feasibility of this method

关键词： strategic loading station location model branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved Differential Characteristic Searching Methods

Improved Differential Characteristic Searching Methods

引用

IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)

作者： Jiageng Chen Atsuko Miyaji Chunhua Su Jesen Teh Computer School Central China Normal University Wuhan China Hokuriku Sentan Kagaku Gijutsu Daigakuin Daigaku Nomi Ishikawa JP School of Information Science Japan Advanced Institute of Science and Technology Nomi Japan Information Security Lab Universiti Sains Malaysia Malaysia

ISBN: (纸本)9781467393010

The success probability of differential and linear cryptanalysis against block ciphers heavily depend on finding differential or linear paths with high statistical bias compared with uniform random distribution. For large number of rounds, it is not a trivial task to find such differential or linear paths. Matsui first investigated this problem and proposed a solution based on a branch and bound algorithm in 1994. Since then, the research on finding good concrete differential or linear path did not receive much attention. In this paper, we revisit the differential attack against several S-Box based block ciphers by carefully studying the differential characteristics. Inspired by Matsui's algorithm, we provide an improved solution with the aid of several searching strategies, which enable us to find by far the best differential characteristics for the two investigated ciphers (LBlock, TWINE) efficiently. Furthermore, we provide another way to evaluate the security of ciphers against differential attack by comparing the strength of the ciphers from differential characteristic's point of view, and we also investigate the accuracy when using the active S-Box to evaluate the security margin against differential attack, which is the common method adapted when new ciphers are designed.

关键词： Differential Path branch and bound algorithm Active S-box LBlock TWINE differential attack Passwords branch and bound algorithms S-box Search methods round number Differential linear cryptanalysis Block cipher

来源：评论

学校读者我要写书评

暂无评论

Collaborative optimization method for multiple feeder buses timetables for bridging rail transit

引用

Multimodal Transportation 2024年第4期3卷

作者： Yuan, Jiyuan Weng, Jiancheng Shi, Qingshuai Guo, Cong Di, Xiaojian Beijing Key Laboratory of Traffic Engineering Beijing University of Technology Haidian Transportation Management Branch of Beijing Municipal Commission of Transport Faculty of Architecture Civil and Transportation Engineering Beijing University of Technology Transport Planning and Research Institute Ministry of Transport

Urban multimodal public transport system with rail transit as the backbone and bus as the collaborative operation is an important carrier for the travel of urban residents. For improving efficiency of urban public transport services, it is important to optimize the feeder bus operation plans and promote efficient bridging. A quantitative method based on the data envelope analysis (DEA) algorithm was proposed to effectively evaluate the transfer efficiency of transit hubs and identify service bottlenecks, which used multi-source data including smart card transaction data, bus vehicle operation data and public transport trip chain data based on multimodal individual travel transaction data. Considering the passenger transfer and supply capacity of the feeder bus, and balancing between transfer and regular travel needs, a collaborative optimization model based on the branch and bound (BB) algorithm which can quickly obtain the absolute optimal solution of small-scale optimization problems is established to combinatorial optimize less efficient feeder bus line groups. The Tiantongyuan North transit hub and its feeder bus line in Beijing were selected as the case analysis. The results indicated that the main reasons for the failure of public transport to achieve DEA effectiveness are the departure frequency and the number of operating buses. With the collaborative optimization of the bus routing schedule, the average total transfer time for the transfer passengers is reduced by 19.9%, while the transfer time and waiting time are reduced by 22.8%, 16.1% respectively, which will help improve the efficiency and service level of multimodal public transport collaborative operation. © 2024 The Author(s)

关键词： branch and bound algorithm Bus operation scheduling Collaborative optimization of timetable Feeder bus Public transport

来源：评论

学校读者我要写书评

暂无评论

A Method of Quadratic Programming for Mapping on NoC Architecture

A Method of Quadratic Programming for Mapping on NoC Archite...

引用

2011 IEEE 9th International Conference on ASIC(2011年第九届IEEE国际专用集成电路大会)

作者： Jiayi Sheng Liulin Zhong Ming'e Jing Zhiyi Yu Xiaoyang Zeng State Key Laboratory of ASIC & System Fudan University Shanghai China

Network-on-Chip (NoC) architecture is drawing intensive attention since it promises to maintain high performance in handling complex communication issues as the number of on-chip components increases. An effective method of mapping multitask applications on multicores is necessary to effectively use the NoC potential. In this paper, we propose an approach of quadratic programming (QP) formulation at the first time for the mapping problem, and it can overcome the unacceptable complexity of Integer Linear Programming (ILP) in dealing with problems with large size due to the decrease in the number of variables. Experimental results show that, QP method is at least 10 times faster than ILP method for 20 given benchmarks.

关键词： NoC Mapping algorithm Quadratic Programming Method Integer Linear Programming Method branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

MODELING AND SENSITIVITY ANALYSIS FOR PLANNING DECISIONS IN WATER RESOURCES EXPANSION

引用

JAWRA Journal of the American Water Resources Association 1972年第4期8卷 653-668页

作者： Himmelblau, David M. Department of Chemical Engineering The University of Texas at Austin Austin Texas 78712 United States

ABSTRACT. Individuals and organizations concerned with the expansion of the facilities of a river basin (such as a river basin authority) need to determine optimal strategies of operation and capital investment. They also need to examine the sensitivity of whatever planning decisions are contemplated. This paper extends the applicability of an algorithm that had been previously applied to the deterministic river‐basin expansion problem to include the feature of a sensitivity analysis. The algorithm, containing a partial enumeration search technique and a network analysis code, gave a construction sequence of reservoirs, canals, and treatment plants, and an operating policy that maximized the present value of net earnings consistent with certain underlying assumptions. A river basin was chosen that had an existing configuration of unregulated streams and rivers, reservoirs, canals and treatment plants, and sites for future additional facilities. A series of representative synthetic flow sequences, future demand profiles, interest rates and reservoir costs that served as inputs to or parameters in the system were each perturbed by various factors (for a total of 24 cases). The sensitivity studies showed that the immediate planning decision of what facility to construct next was insensitive to variations in future demands and costs and independent of later decisions. Thus, decision‐making was adaptive in the sense that by always making the optimal proximate decision, the management of the river basin is optimized. Copyright © 1972, Wiley Blackwell. All rights reserved

关键词： branch and bound algorithm capital investment integer programming KEY TERMS network analysis system operating rules river basin planning sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

两种经营模式下通勤廊道停车换乘选址及停车费用优化

引用

管理科学 2018年第7期 734-742页

作者：赵顺晶龙建成丁建勋石琴

停车换乘作为交通需求管理措施的一个重要手段，可以有效缓解城市中心区的交通拥堵以及城市停车问题。合理的停车换乘设施选址和停车费用都将大大提高停车换乘设施的作用和完善整个城市交通系统的功效。本文以通勤廊道的停车换乘系统为... 详细信息

停车换乘作为交通需求管理措施的一个重要手段，可以有效缓解城市中心区的交通拥堵以及城市停车问题。合理的停车换乘设施选址和停车费用都将大大提高停车换乘设施的作用和完善整个城市交通系统的功效。本文以通勤廊道的停车换乘系统为对象，分别考虑政府经营和企业经营两种模式，提出了双层规划模型来描述停车换乘条件下停车换乘选址及停车费用优化问题。基于灵敏度分析的方法，提出了分支定界算法求解提出的双层规划模型。采用数值算例验证了提出的模型和算法的有效性。该研究可以为从成本与收益的角度对停车换乘设施的建设方案的评价提供决策支持，对停车换乘系统的发展和规划具有理论指导意义。

关键词：停车换乘双层规划随机用户平衡分支定界 park and ride bi-level programming stochastic user equilibrium branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Scheduling deteriorating jobs to minimize makespan

引用

Naval Research Logistics (NRL) 1998年第5期45卷

作者： Wieslaw Kubiak Steef van de Velde Faculty of Business Administration Memorial University of Newfoundland St. John's Newfoundland Canada A1B 3X5 Rotterdam School of Management Erasmus University P.O. Box 1738 3000 DR Rotterdam The Netherlands

We consider a single‐machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J j grows by w j with each time unit its start is delayed beyond a given common critical date d . This processing time is p j if J j starts by d . We show that this problem is NP‐hard, give a pseudopolynomial algorithm that runs in time and O ( nd ) space, and develop a branch‐and‐bound algorithm that solves instances with up to 100 jobs in a reasonable amount of time. We also introduce the case of bounded deterioration, where the processing time of a job grows no further if the job starts after a common maximum deterioration date D > d . For this case, we give two pseudopolynomial time algorithms: one runs in O ( n 2 d ( D − d ) time and O ( nd ( D − d )) space, the other runs in p j ) 2 ) time and p j ) space. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 511–523, 1998

关键词： single‐machine scheduling deteriorating jobs NP‐hardness dynamic programming pseudopolynomial algorithm branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：