Loading...
Search for: assignment-problems
0.006 seconds
Total 21 records

    Toward a solution to multi-agent credit assignment problem

    , Article SoCPaR 2009 - Soft Computing and Pattern Recognition, 4 December 2009 through 7 December 2009, Malacca ; 2009 , Pages 563-568 ; 9780769538792 (ISBN) Rahaie, Z ; Beigy, H ; Sharif University of Technology
    Abstract
    Multi-agent systems (MAS) try to formulate dynamic world which surround human being in every aspect of his life. One of the important challenges encountered in multiagent systems is the credit assignment problem, simply means distributing the result of the work of a group of agents, such that every agent will have the capability of individual learning. This paper presents the result of a solution suggested for multi-agent credit assignment problem. With the help of observing history of credit assignment in the environment, we will understand what actions are reward-deserving. Results are reported on a multi agent domain, addition agents. © 2009 IEEE  

    Addition of learning to critic agent as a solution to the multi-agent credit assignment problem

    , Article ICSCCW 2009 - 5th International Conference on Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Control, 2 September 2009 through 4 September 2009 ; 2009 ; 9781424434282 (ISBN) Rahaie, Z ; Beigy, H ; Sharif University of Technology
    Abstract
    Multi-agent systems (MAS) is a solution to the nowadays encountered problems, which have the characteristics such as distributiveness, dynamism and the need to adaptation, robustness, efficiency, and reusability. This paper proposed a solution to multi-agent credit assignment problem. The contribution is to equip the critic agent (who is responsible for distributing reinforcements among agents) with learning capability. Some criteria are used to propose an inner feedback to the critic. Results of simulation show the applicability of the method to a task, which has the characteristic that the agent has to decide from a large set of actions. The research is a preliminary step to more in-depth... 

    Objective Method

    , M.Sc. Thesis Sharif University of Technology Rahimi, Fatemeh (Author) ; Haji Mirsadeghi, Mir Omid (Supervisor)
    Abstract
    In this thesis we introduce the objective method for solving combinatorial probability problems and combinatorial optimization. For introducing this method, we consider its application in solving problems such as graphs maximal partial matching problem. Then we introduce mean-field model, which has a close relationship with this method. Finally we use this method to discuss perfect mathching with minimal cost in complete graphs, and using obtaind theorems and concepts from solving this problem, like involution invariance and standard construction, we find an answer for random assigment problem, which is one of the most practical problems in the class of optimization problems  

    A Multi-channel Scheme for Fast Data Collection in Wireless Sensor Networks

    , M.Sc. Thesis Sharif University of Technology Ghods, Fatemeh (Author) ; Hemmatyar, Ali Mohammad Afshin (Supervisor)
    Abstract
    With the development of technology and growing interest in using high performance and low price products, Wireless Sensor Networks (WSNs) are being dramatically deployed as an emerging technology. The main concern in WSNs is energy consumption that has an effect on sensor’s life time. In order to minimize the energy consumption, Data aggregation, which obtains aggregated values from WSNs, is an important functionality but yet time consuming. On the other hands, Emerging applications of Wireless Sensor Networks (WSNs) such as real-time detection of events need high-rate data collection, which is now an important challenge in WSNs. Multi-channel communication is one of the efficient methods to... 

    A logit-based model for facility placement planning in supply chain management

    , Article International Journal of Logistics Systems and Management ; Volume 20, Issue 1 , 2015 , Pages 122-147 ; 17427967 (ISSN) Bagloee, S. A ; Shnaiderman, M ; Tavana, M ; Ceder, A ; Sharif University of Technology
    Inderscience Enterprises Ltd  2015
    Abstract
    The facility placement in supply chain management entails suppliers and consumers along with the terminals in between for distributing commodities. This study seeks to find the best terminal placement by taking into consideration the costs for both transportation and terminal construction. We call this a supplier-terminal-consumer (STC) problem and show that the STC is an NP-hard quadratic assignment problem. The NP-hard problems in real-size are proven to be intractable; hence, we develop a two-fold heuristic method for solving the STC problems. First, we identify the commodity flow by using a logit-based mathematical programming (Logit-MP) methodology based on the demand for the commodity... 

    Image Registration Using Graph-based Methods

    , M.Sc. Thesis Sharif University of Technology Taheri Dezaki, Fatemeh (Author) ; Fatemizadeh, Emadeddin (Supervisor)
    Abstract
    Nowadays, image registration is considered as one of usual issues in medical researches whose new findings are expanding outstandingly and it has reached a high level of maturity. Generally speaking, image registration is a task to reliably estimate the geometric transformation such that two images can be precisely aligned. With respect to different uses of image registration in medical applications, it has attracted the attention of many scholars and there has been made significant improvement in this realm. Image registration is still one of the active branches in medical image processing due to its wide applications and problems. Graphs, thanks to their geometric structures and intuitive... 

    Route-Based Stochastic Traffic Assignment Based on Fuzzy Perceived Travel Time

    , M.Sc. Thesis Sharif University of Technology Etezady, Mohammad Ali (Author) ; Shafahi, Yousef (Supervisor)
    Abstract
    Traffic assignment model, as the last step to the well-known four-step planning models, have been under a special research focus to better capture the uncertainty in the decision-making process of the users. Researchers' use of fuzzy cost for travel time and stochastic assignment models have each aimed at considering the variation in perception of users and uncertainty in their route choices. This thesis has proposed two route-based stochastic assignment models that exploit the fuzzy theory to model network users' perception of travel time and stochastic assignment to model their route choice process. A simulation approach has been exploited to generate the routes prior to the assignment... 

    Applications of Quadratic Programming in Bioinformatics Problems Specially Network Alignment

    , M.Sc. Thesis Sharif University of Technology Mohammadi Siahroodi, Elahe (Author) ; Foroughmand, Mohammad Hadi (Supervisor)
    Abstract
    One of the most important targets in bio-informatics is the analysis of biological networks. These networks are modeled by graphs. Comparing networks with mapping is a useful tool for analyzing. The mapping between the nodes of a network that preserves some topological and functional structures, is called network alignment. Network alignment has various applications in different fields; such as pattern recognition, social networks, biological networks, and etc. The alignment of the protein-protein interaction network is one of the substantial problems. There are many static algorithms for the alignment of PPI networks. Because of the developments of computer science in recent years,... 

    Hybridizations of genetic algorithms and neighborhood search metaheuristics for fuzzy bus terminal location problems

    , Article Applied Soft Computing Journal ; Volume 46 , 2016 , Pages 220-229 ; 15684946 (ISSN) Babaie Kafaki, S ; Ghanbari, R ; Mahdavi Amiri, N ; Sharif University of Technology
    Elsevier Ltd 
    Abstract
    We propose modified hybridizations of genetic algorithms with some neighborhood search based metaheuristics. In our hybrid algorithms, we consider gradually increasing probability for the application of the neighborhood search procedure on the best individuals as the number of iterations of the genetic algorithm increases. We implement the proposed hybrid algorithms and compare their performance with two other recently proposed hybrid algorithms which, in contrast, use the neighborhood search procedure on all the individuals of the population, two hybrid algorithms applying simulated annealing on the best individual in the papulation in every iteration and three non-hybrid metaheuristic... 

    Critic learning in multi agent credit assignment problem

    , Article Journal of Intelligent and Fuzzy Systems ; Volume 30, Issue 6 , 2016 , Pages 3465-3480 ; 10641246 (ISSN) Rahaie, Z ; Beigy, H ; Sharif University of Technology
    IOS Press  2016
    Abstract
    Multi-agent systems can be seen as an apparatus for testing the performance of real distributed systems. One problem encountered in multi-agent systems with the learning capability is credit assignment. This paper presents two methods for solving this problem. The first method assigns credit to the agents according to the history of the interaction while the second method assigns credit to the agents according to the knowledge of agents, and thus the shares of the agents are extracted from the feedback of the environment. The computer experiments show that critic learning has a positive impact in credit assignment problem  

    Improving blood bank inventory management using double cross-match and hybrid issuance policy

    , Article 7th IEEE International Conference on Industrial Engineering and Applications, ICIEA 2020, 16 April 2020 through 21 April 2020 ; 2020 , Pages 819-826 Bozorgi, A ; Najafi, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2020
    Abstract
    Blood availability in hospitals is of high humanitarian importance, thus blood shortage is not desired at all. High wastage rate of blood in hospitals is an important issue, which becomes more important as the standards of health care services becomes higher. In order to address blood shortage and wastage issues in a hospital, this paper develops a new inventory management model as a decision making tool to help making tactical and operational level decisions for a Hospital Blood Bank (HBB) inventory management. These decisions include issuance and ordering policy and the aim of the model is to reduce blood wastage and shortage. For this purpose, a multi period, multi-product inventory... 

    Using NSGA-II for Solving Bi-Objective Robust Generalized Assignment Problem

    , M.Sc. Thesis Sharif University of Technology Aghababaee, Zahra (Author) ; Eshghi, Kourosh (Supervisor)
    Abstract
    One of the newest approaches in optimization fields under uncertainty which absorb many scientists is robust optimization. This approach uses uncertain data instead of stochastic distributions and its goal is to find a solution which is robust under uncertainty of input data.
    Assignment problem is one of the most applicable problems in real world which its parameter is faced uncertainty. Because of this reason, the aim of this thesis is to find a method for solving generalized assignment problem robustly which the coefficients of costs and use of resources by agents for performing the jobs is undetermined. These parameters are interval data and have just lower and upper bound.
    For... 

    Simultaneous Solution of the Project Material Procurement Scheduling Problem and Warehouse Allocation Using a Population-based Simulated Annealing Algorithm

    , M.Sc. Thesis Sharif University of Technology Moradi, Nima (Author) ; Shadrokh, Shahram (Supervisor)
    Abstract
    One most important industry in developing countries is the construction industry and essential component of any construction project is the construction site. According to studies, proper construction site planning will increase productivity, reduce cost, time and risk of the project. Facility layout planning and warehouse location are the most important problems in the construction site. Project activity scheduling, ordering and delivery of material known as project logistics have been investigated by several researchers. In this thesis, two problems including material procurement scheduling and warehouse allocation are simultaneously considered, a hybrid problem, which due to its... 

    OPAIC: An optimization technique to improve energy consumption and performance in application specific network on chips

    , Article Measurement: Journal of the International Measurement Confederation ; Volume 74 , 2015 , Pages 208-220 ; 02632241 (ISSN) Taassori, M ; Taassori, M ; Niroomand, S ; Vizvári, B ; Uysal, S ; Hadi Vencheh, A ; Sharif University of Technology
    Elsevier  2015
    Abstract
    Abstract Network on Chip (NoC) is an appropriate and scalable solution for today's System on Chips (SoCs) with the high communication demands. Application specific NoCs is preferable since they can be customized to optimize all requirements of the specific applications. This paper presents an OPtimization technique for Application specifIC NoCs (OPAIC), which aims not only to decrease the energy consumption but also to improve the area of NoCs. OPAIC is composed of three stages to find the optimum NoC; in the first stage, it uses a linearized form of a Quadratic Assignment Problem (QAP) to map tasks on cores to minimize the energy. In the second stage, a Mixed Integer Linear Problem (MILP)... 

    Neighboring vehicles modeling for tracking across nonoverlapping cameras

    , Article Proceedings - 2010 18th Iranian Conference on Electrical Engineering, ICEE 2010, 11 May 2010 through 13 May 2010 ; 2010 , Pages 526-531 ; 9781424467600 (ISBN) Shabaninia, E ; Kasaei, S ; Sharif University of Technology
    Abstract
    Tracking vehicles across nonoverlapping cameras is required by video-based intelligent transportation systems (ITS) to efficiently calculate traffic parameters; such as link travel times and origin/destination counts. In traffic monitoring applications, cameras are usually mounted far from each other to cover wide areas. As such, object features (i.e., color information, shape, and direction) change significantly from one camera to another. These space-time differences raise serious challenges on efficient tracking. In this paper, we have presented a probabilistic model to solve the multicamera tracking task in a network of disjoint view cameras, with attention paid on estimating the density... 

    Multiclass fuzzy user equilibrium with endogenous membership functions and risk-taking behaviors

    , Article Journal of Advanced Transportation ; 2016 ; 01976729 (ISSN) Miralinaghi, M ; Lou, Y ; Hsu, Y. T ; Shabanpour, R ; Shafahi, Y ; Sharif University of Technology
    John Wiley and Sons Ltd  2016
    Abstract
    Over the last decades, several approaches have been proposed in the literature to incorporate users' perceptions of travel costs, their bounded rationality, and risk-taking behaviors into network equilibrium modeling for traffic assignment problem. While theoretically advanced, these models often suffer from high complexity and computational cost and often involve parameters that are difficult to estimate. This study proposes an alternative approach where users' imprecise perceptions of travel times are endogenously constructed as fuzzy sets based on the probability distributions of random link travel times. Two decision rules are proposed accordingly to account for users' heterogeneous... 

    Cellular learning automata based dynamic channel assignment algorithms

    , Article International Journal of Computational Intelligence and Applications ; Volume 8, Issue 3 , 2009 , Pages 287-314 ; 14690268 (ISSN) Beigy, H ; Meybodi, M. R ; Sharif University of Technology
    2009
    Abstract
    A solution to channel assignment problem in cellular networks is self-organizing channel assignment algorithm with distributed control. In this paper, we propose three cellular learning automata based dynamic channel assignment algorithms. In the first two algorithms, no information about the status of channels in the whole network will be used by cells for channel assignment whereas in the third algorithm, the additional information regarding status of channels may be gathered and then used by cells in order to allocate channels. The simulation results show that by using the proposed channel assignment algorithms the micro-cellular network can self-organize itself. The simulation results... 

    Dynamic penalty function method for the side constrained traffic assignment problem

    , Article Applied Mathematics and Computation ; Volume 206, Issue 1 , December , 2008 , Pages 332-345 ; 00963003 (ISSN) Shahpar, A. H ; Zokaei Ashtiani, H ; Babazadeh, A ; Sharif University of Technology
    2008
    Abstract
    The traffic assignment problem (TAP) is traditionally defined without side constraints. Although introducing side constraints into the TAP is used as a way of refining applied assignment models, it brings some computational difficulties that prevent the refined model from being applicable in real-case problems. In this paper an iterative solution algorithm is developed for TAP with linear side constraints. This method is based on implicitly considering the side constraints by means of adding a dynamic penalty function (DPF) to the link travel times. Each of the iterations of the algorithm is reduced to an unconstrained assignment followed by updating the penalty functions. The unconstrained... 

    Dynamic penalty function method for the side constrained traffic assignment problem

    , Article Proceedings, Annual Conference - Canadian Society for Civil Engineering, 10 June 2008 through 13 June 2008, Quebec City, QC ; Volume 4 , 2008 , Pages 2669-2680 ; 9781605603964 (ISBN) Shahpar, A. H ; Aashtiani, H. Z ; Babazadeh, A ; Sharif University of Technology
    2008
    Abstract
    Traffic assignment problem (TAP) is traditionally defined without side constraints. Although introducing the side constraints into the TAP is used as a way of refining the applied assignment models, it brings some computational difficulties preventing the refined model to be applicable in the real-case problems. In this paper an iterative solution algorithm is developed for TAP with linear side constraints. This method is based on implicitly considering the side constraints by means of adding a dynamic penalty function (DPF) to the link travel times. Each of the iterations of the algorithm is reduced to an unconstrained assignment followed by updating the penalty functions. The unconstraint... 

    Relay Selection for Machine-to-Machine Communication with the Same Source Requests in Heterogeneous Wireless Networks

    , Ph.D. Dissertation Sharif University of Technology Allah Gholi Ghasri, Monireh (Author) ; Hemmatyar, Ali Mohammad Afshin (Supervisor) ; Bayat, Siavash (Co-Supervisor)
    Abstract
    Machine-to-machine communication (M2M) can be considered as one of the most important types of high-density communication in the Internet of Things (IoT). Therefore, how to send data using the cooperation of machines with each other and selecting the appropriate relay can play an effective role in improving the quality of network communication, especially when communication between sources and their destinations is weak. Since in the real world some of the applications used on a set of IoT machines require the similar bandwidth, we also followed this assumption. For this purpose, we went through three steps in this thesis. First, two new relay selection algorithms with static RF interface...