检索结果-南通市图书馆

An Efficient Algorithm for Obtaining the Optimum Solution of a Generalized assignment problem

在线全文

学校读者我要写书评

暂无评论

Systems Science and Systems Engineering 1999年第3期9卷 314-319页

作者： HUANG De\|cai College of Information Engineering, Zhejiang University of Technology, Hangzhou 310014, China

This paper considers a generalized assignment problem. After intensively analyzing and researching, the generalizsed assignment problem is ingeniously reduced to a traditional assignment problem of which the optimum s... 详细信息

关键词： assignment problem business management linear programming

A New Approach of Solving Single Objective Unbalanced assignment problem

在线全文

学校读者我要写书评

暂无评论

American Journal of Operations Research 2016年第1期6卷 81-89页

作者： Ventepaka Yadaiah V. V. Haragopal Department of Mathematics Osmania University Hyderabad India Department of Statistics Osmania University Hyderabad India

In this paper, we discuss a new approach for solving an unbalanced assignment problem. A Lexi-search algorithm is used to assign all the jobs to machines optimally. The results of new approach are compared with existing approaches, and this approach outperforms other methods. Finally, numerical example (Table 1) has been given to show the efficiency of the proposed methodology.

关键词： assignment problem Lexi-Search Algorithm Jobs Clubbing Method

Solving the Unbalanced assignment problem: Simpler Is Better

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

American Journal of Operations Research 2016年第4期6卷 296-299页

作者： Nathan Betts Francis J. Vasko Department of Mathematics Kutztown University Kutztown PA USA

Recently, Yadaiah and Haragopal published in the American Journal of Operations Research a new approach to solving the unbalanced assignment problem. They also provide a numerical example which they solve with their approach and get a cost of 1550 which they claim is optimum. This approach might be of interest;however, their approach does not guarantee the optimal solution. In this short paper, we will show that solving this same example from the Yadaiah and Haragopal paper by using a simple textbook formulation to balance the problem and then solve it with the classic Hungarian method of Kuhn yields the true optimal solution with a cost of 1520.

关键词： assignment problem Hungarian Method Textbook Formulation

Proposed Heuristic Method for Solving assignment problems

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

American Journal of Operations Research 2016年第6期6卷 436-441页

作者： S. K. Amponsah D. Otoo S. Salhi E. Quayson Department of Mathematics Kwame Nkrumah University of Science and Technology Kumasi Ghana Department of Mathematics and Statistics University of Energy and Natural Recourses Sunyani Ghana Management Science Group University of Kent Kent UK

assignment of jobs to workers, contract to contractors undergoing a bidding process, assigning nurses to duty post, or time tabling for teachers in school and many more have become a growing concern to both management and sector leaders alike. Hungarian algorithm has been the most successful tool for solving such problems. The authors have proposed a heuristic method for solving assignment problems with less computing time in comparison with Hungarian algorithm that gives comparable results with an added advantage of easy implementation. The proposed heuristic method is used to compute some bench mark problems.

关键词： assignment problem Hungarian Algorithm Heuristic

Colony location algorithm for assignment problems

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

控制理论与应用（英文版） 2004年第2期2卷 111-116页

作者： DingweiWANG InformationSchool.NortheasternUniversity.ShenyangLiaoning110004 China

A novel algorithm called Colony Location Algorithm (CLA) is proposed. It mimics the phenomena in biotic community that colonies of species could be located in the places most suitable to their growth. The factors working on the species location such as the nutrient of soil, resource competition between species, growth and decline process, and effect on environment were considered in CLA via the nutrient function, growth and decline rates, environment evaluation and fertilization strategy. CLA was applied to solve the classical assignment problems. The computation results show that CLA can achieve the optimal solution with higher possibility and shorter running time.

关键词： Evolutionary computation Artificial life Bionic computation Optimization assignment problem

FGAs-Based Data Association Algorithm for Multi-sensor Multi-target Tracking

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Aeronautics 2003年第3期16卷 177-181页

作者：朱力立张焕春经亚枝 Faculty 302 Nanjing University of Aeronautics and Astronautics

A novel data association algorithm is developed based on fuzzy geneticalgorithms (FGAs). The static part of data association uses one FGA to determine both the lists ofcomposite measurements and the solutions of m-best S-D assignment. In the dynamic part of dataassociation, the results of the m-best S-D assignment are then used in turn, with a Kalman filterstate estimator, in a multi-population FGA-based dynamic 2D assignment algorithm to estimate thestates of the moving targets over time. Such an assignment-based data association algorithm isdemonstrated on a simulated passive sensor track formation and maintenance problem. The simulationresults show its feasibility in multi-sensor multi-target tracking. Moreover, algorithm developmentand real-time problems are briefly discussed.

关键词： multi-target tracking data association FGA assignment problem kalmanfilter

Coupling of crop assignment and vehicle routing for harvest planning in agriculture

在线全文

学校读者我要写书评

暂无评论

Artificial Intelligence in Agriculture 2019年第2期2卷 99-109页

作者： Mogens Graf Plessen MGP is an independent researcher.

A method for harvest planning based on the coupling of crop assignment with vehicle routing is *** a setting with multiple fields,a path network connecting these,multiple depots at which a number of harvesters are initially located,the main question addressed is:Which crop out of a set of different crops to assign to each field when accounting for the given setting?It must be answered by every farm manager at the beginning of every work-cycle starting with plant seeding and ending with *** than solving an assignment problem only,it is here also accounted for the connectivity between *** practice,fields are often located distant *** costs of machinery and limited harvesting windows demand optimized operation and route ***,the proposed method outputs crop assignments to fields and simultaneously determines crop-tours,i.e.,optimized sequences in which to service fields of the same crop during *** is of particular relevance for larger farms and groups of farms that collaborate and share *** programming based exact algorithms are *** large numbers of fields,where these algorithms may not be tractable due to computational constraints,elements of clustering and the solution of local Traveling Salesman problems are added,thereby on the one hand rendering the method heuristic and in general suboptimal,but on the other hand maintaining large-scale applicability.

关键词： Agricultural logistics assignment problem Vehicle routing Integer programming Decision support system

Multi-Objective Optimization of Time-Cost-Quality Using Hungarian Algorithm

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

American Journal of Operations Research 2016年第1期6卷 31-35页

作者： Ventepaka Yadaiah V. V. Haragopal Department of Mathematics Osmania University Hyderabad India Department of Statistics Osmania University Hyderabad India

In this paper, we propose an algorithm for solving multi-objective assignment problem (MOAP) through Hungarian Algorithm, and this approach emphasizes on optimal solution of each objective function by minimizing the r... 详细信息

关键词： assignment problem Hungarian Algorithm Multi-Objectives

Some Results on Position Restriction Scheduling problems

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Quarterly Journal of Mathematics 2008年第2期23卷 202-206页

作者： CHEN You-jun LIN Yi-xun Department of Mathematics and Information Sciences North China University of Water Conservancy and Electric Power Zhengzhou 450011 China Department of Mathematics Zhengzhou University Zhengzhou 450052 China

In this paper, we first consider the position restriction scheduling problems on a single machine. The problems have been solved in certain special cases, especially for those obtained by restricting the processing time pj = 1. We introduce the bipartite matching algorithm to provide some polynomial-time algorithms to solve them. Then we further consider a problem on unrelated processors.

关键词： position restriction scheduling matching algorithm assignment problem