Loading...
Search for:
metaheuristics
0.006 seconds
Total 59 records
Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem
, Article Operations Research Forum ; Volume 3, Issue 1 , 2022 ; 26622556 (ISSN) ; Sikari, S. S ; Sharif University of Technology
Springer International Publishing
2022
Abstract
The authors consider the Multi-Skilled Project Scheduling Problem (MSPSP) as a version of the Multi-mode Resource-Constrained Project Scheduling Problem (MRCPSP), which extends the well-known NP-hard Resource-Constrained Project Scheduling Problem (RCPSP). In the MSPSP, it is made up of activities, which require specific skills to be done. Moreover, resources are staff members who master fixed skill(s). Thus, each resource requirement of an activity corresponds to the number of persons doing the corresponding skill that must be assigned to the activity during its whole processing time. The authors focus on taking into account the setup times when performing work, depending on the appointment...
A metaheuristic approach to the graceful labeling problem [electronic resource]
, Article International Journal of Applied Metaheuristic Computing (IJAMC) ; Volume 1, Issue 4. Copyright © 2010. 15 pages 84-91 ; Eshgh, Kourosh ; Sharif University of Technology
Abstract
In this paper, an algorithm based on ant colony optimization metaheuristic is proposed for finding solutions to the well-known graceful labeling problem of graphs. Despite the large number of papers published on the theory of this problem, there are few particular techniques introduced by researchers for gracefully labeling graphs. The proposed algorithm is applied to many classes of graphs, and the results obtained have proven satisfactory when compared to those of the existing methods in the literature
A hybrid SA/TS algorithm for graph coloring problem [electronic resource]
, Article International Journal of Operational Research (IJOR) ; Volume 11, Number 2/2011 Pages 136-159 ; Eshghi, Kourosh ; Sharif University of Technology
Abstract
The graph colouring problem, as an important NP-complete problem, is considered in this paper and a hybrid meta-heuristic approach is developed to solve it. The initial solution of the algorithm, generated by a heuristic method, is used by a simulated annealing (SA) approach to generate new solutions until no progress in a number of solutions reported. At this stage, the algorithm will use a tabu search routine and this local search operator will be followed for some iterations. After finding a better solution, the algorithm is again followed through SA. Efficiency of the algorithm is showed through various experiments on well-known benchmark problems of DIMACS. Comparison with the available...
A new approach for solving resource constrained project scheduling problems using differential evolution algorithm
, Article International Journal of Industrial Engineering Computations ; Volume 7, Issue 2 , 2016 , Pages 205-216 ; 19232926 (ISSN) ; Sharif University of Technology
Growing Science
Abstract
One subcategory of project scheduling is the resource constrained project scheduling problem (RCPSP). The present study proposes a differential evolution algorithm for solving the RCPSP making a small change in the method to comply with the model. The RCPSP is intended to program a group of activities of minimal duration while considering precedence and resource constraints. The present study introduces a differential evolution algorithm and local search was added to improve the performance of the algorithm. The problems were then solved to evaluate the performance of the algorithm and the results are compared with genetic algorithm. Computational results confirm that the differential...
Robust facility layout design for flexible manufacturing: a doe-based heuristic
, Article International Journal of Production Research ; 2021 ; 00207543 (ISSN) ; Salimpour, S ; Akhavan Niaki, S. T ; Azab, A ; Sharif University of Technology
Taylor and Francis Ltd
2021
Abstract
Flexible manufacturing systems (FMS) should be able to respond to changing manufacturing requirements and environments. From the layout point of view, FMS need to be rearranged to fit the new requirements. However, rearranging the layout is often undesirable due to its unpredicted high costs and production disruption. This paper proposes a practical approach to mitigate the effects and repercussions of changing environments and avoid rearranging the layout. A robust layout approach is presented, where changes in product demand and mix are absorbed by altering product routes and not rearranging the layout. In this approach, the problem is decomposed into two sub-problems: sub-problem 1 (SP1)...
Real estate market-based optimization algorithm (remark): a market-inspired metaheuristic optimization algorithm based on the law of supply and demand
, Article Journal of Ambient Intelligence and Humanized Computing ; 2022 ; 18685137 (ISSN) ; Eqra, N ; Bighashdel, A ; Sharif University of Technology
Springer Science and Business Media Deutschland GmbH
2022
Abstract
In this work, a metaheuristic optimization algorithm is developed based on the idea of interaction between the demanders and the suppliers in the real estate market. After reviewing the basic theory behind the idea, the working principles of the algorithm are developed and explained in details. The proposed framework yields the exploration and exploitation ability of the algorithm and also leads the algorithm to converge to the global maxima. In order to test the performance of the algorithm, 23 well-known benchmark functions of different characteristics are selected from the literature and the results are compared with seven metaheuristic algorithms. The algorithm is also evaluated on two...
Futuristic Greedy Algorithm on some NP-complete Problems
, Ph.D. Dissertation Sharif University of Technology ; Izadi, Mohammad (Supervisor)
Abstract
Many problems in the field of 0-1 integer programming are NP-Complete. Execution time for exact solving these problems is very high due to many constraints and decision variables. Hence, scientists use Fast algorithms, for example, the Greedy algorithms, in the approximated solution of these problems.A classic greedy approach may not search the whole solution space for better choices. However, other methods with a greedy approach, such as meta heuristic and hyper heuristic, in addition to local search, consider the more search space. These methods search randomly, so it does not provide a good guarantee for finding the proper solutions. Finding suitable solutions in this category of...
Two effective hybrid metaheuristic algorithms for minimization of multimodal functions
, Article International Journal of Computer Mathematics ; Volume 88, Issue 11 , 2011 , Pages 2415-2428 ; 00207160 (ISSN) ; Ghanbari, R ; Mahdavi Amiri, N ; Sharif University of Technology
2011
Abstract
Global optimization problems naturally arise from many applications. We propose two hybrid metaheuristic algorithms for finding a global optimum of a continuous function. Our proposed algorithms are hybridizations of genetic algorithm (GA) and variable neighbourhood search (VNS). To increase the efficiency of our algorithms, for smooth functions we present an effective locally improving line search procedure, and for non-smooth functions, we use the simplex method proposed by Nelder and Mead. By use of the recently adopted non-parametric statistical tests of Kruskal-Wallis and Mann-Whitney for analysing the behaviour of evolutionary algorithms, we compare both the efficiency and the...
Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm
, Article Applied Mathematics and Computation ; Volume 196, Issue 2 , 2008 , Pages 879-888 ; 00963003 (ISSN) ; Kianfar, F ; Shadrokh, S ; Sharif University of Technology
2008
Abstract
This paper considers a project scheduling problem with the objective of minimizing resource availability costs required to execute the activities in a project by a given project deadline. The project contains activities interrelated by finish-start-type precedence relations with a time lag of zero, which require a set of renewable resources. Two metaheuristics, path relinking and genetic algorithm, are developed to tackle this problem in which a schedule is created with a precedence feasible priority list given to the schedule generation scheme. In these procedures, each new generation of solutions are created using the combination of current solutions. Comparative computational results...
Comparing performance of metaheuristic algorithms for finding the optimum structure of CNN for face recognition
, Article International Journal of Nonlinear Analysis and Applications ; Volume 11, Issue 1 , 2020 , Pages 301-319 ; Pooyan, M ; Manzuri, M. T ; Sharif University of Technology
Semnan University, Center of Excellence in Nonlinear Analysis and Applications
2020
Abstract
Local and global based methods are two main trends for face recognition. Local approaches extract salient features by processing different parts of the image whereas global approaches find a general template for face of each person. Unfortunately, most global approaches work under controlled envi-ronments and they are sensitive to changes in the illumination. On the other hand, local approaches are more robust but finding their optimal parameters is a challenging task. This work proposes a new local-based approach that automatically tunes its parameters. The proposed method incorporates different techniques. In the first step, convolutional neural network (CNN) is employed as a trainable...
A metaheuristic approach to the graceful labeling problem of graphs
, Article 2007 IEEE Swarm Intelligence Symposium, SIS 2007, Honolulu, HI, 1 April 2007 through 5 April 2007 ; 2007 , Pages 84-91 ; 1424407087 (ISBN); 9781424407088 (ISBN) ; Eshghi, K ; Sharif University of Technology
2007
Abstract
In this paper, an algorithm based on Ant Colony Optimization metaheuristic is proposed for finding solutions to the well-known graceful labeling problem of graphs. Despite the large number of papers published on the theory of this problem, there are few particular techniques introduced by researchers for gracefully labeling graphs. The proposed algorithm is applied to many classes of graphs, and the results obtained have proven satisfactory when compared to those of the existing methods in the literature. © 2007 IEEE
Impact of parameter control on the performance of APSO and PSO algorithms for the CSTHTS problem: An improvement in algorithmic structure and results
, Article PLoS ONE ; Volume 16, Issue 12 , December , 2021 ; 19326203 (ISSN) ; Fakhar, M. S ; Kashif, A. R ; Naeem, R ; Rasool, A ; Sharif University of Technology
Public Library of Science
2021
Abstract
Cascaded Short Term Hydro-Thermal Scheduling problem (CSTHTS) is a single objective, non-linear multi-modal or convex (depending upon the cost function of thermal generation) type of Short Term Hydro-Thermal Scheduling (STHTS), having complex hydel constraints. It has been solved by many metaheuristic optimization algorithms, as found in the literature. Recently, the authors have published the best-achieved results of the CSTHTS problem having quadratic fuel cost function of thermal generation using an improved variant of the Accelerated PSO (APSO) algorithm, as compared to the other previously implemented algorithms. This article discusses and presents further improvement in the results...
A survey on multi-floor facility layout problems
, Article Computers and Industrial Engineering ; Volume 107 , 2017 , Pages 158-170 ; 03608352 (ISSN) ; Pishvaee, M. S ; Akbari Jokar, M. R ; Sharif University of Technology
Abstract
Facility layout problem is a well-known optimization problem which generally deals with the arrangement of the facilities required in an organization. This problem has received much attention during the past decades. However, the researchers have mainly focused on the case where a single floor is available. While, in the competitive world, it is clear that using multi-floor structure layouts are much more efficient and in some cases necessary due to the nature of the functions and activities performed in the firms. Hence, this issue has recently attracted much attention and is becoming increasingly popular. Nevertheless, the lack of a review study on this subject for directing the new...
Data mining with a simulated annealing based fuzzy classification system
, Article Pattern Recognition ; Volume 41, Issue 5 , 2008 , Pages 1824-1833 ; 00313203 (ISSN) ; Habibi, J ; Saniee Abadeh, M ; Saadi, H ; Sharif University of Technology
Elsevier Ltd
2008
Abstract
In this paper, the use of simulated annealing (SA) metaheuristic for constructing a fuzzy classification system is presented. In several previous investigations, the capability of fuzzy systems to solve different kinds of problems has been demonstrated. Simulated annealing based fuzzy classification system (SAFCS), hybridizes the learning capability of SA metaheuristic with the approximate reasoning method of fuzzy systems. The objective of this paper is to illustrate the ability of SA to develop an accurate fuzzy classifier. The use of SA in classification is an attempt to effectively explore and exploit the large search space usually associated with classification problems, and find the...
An ACO algorithm for graph coloring problem
, Article 2005 ICSC Congress on Computational Intelligence Methods and Applications, Istanbul, 15 December 2005 through 17 December 2005 ; Volume 2005 , 2005 ; 1424400201 (ISBN); 9781424400201 (ISBN) ; Eshghi, K ; Sharif University of Technology
2005
Abstract
Ant Colony Optimization (ACO) is a well-known metaheuristic in which a colony of artificial ants cooperate in exploring good solutions to a combinatorial optimization problem. In this paper, an ACO algorithm is presented for the graph coloring problem. This ACO algorithm conforms to Max-Min Ant System structure and exploits a local search heuristic to improve its performance. Experimental results on DIMACS test instances show improvements over existing ACO algorithms of the graph coloring problem
Flowshop-scheduling problems with makespan criterion: A review
, Article International Journal of Production Research ; Volume 43, Issue 14 , 2005 , Pages 2895-2929 ; 00207543 (ISSN) ; Saghafian, S ; Sharif University of Technology
2005
Abstract
This paper is a complete survey of flowshop-scheduling problems and contributions from early works of Johnson of 1954 to recent approaches of metaheuristics of 2004. It mainly considers a flowshop problem with a makespan criterion and it surveys some exact methods (for small size problems), constructive heuristics and developed improving metaheuristic and evolutionary approaches as well as some well-known properties and rules for this problem. Each part has a brief literature review of the contributions and a glimpse of that approach before discussing the implementation for a flowshop problem. Moreover, in the first section, a complete literature review of flowshop-related scheduling...
Determination of Loading and Unloading Program in a Cross-Docking System
, M.Sc. Thesis Sharif University of Technology ; Akbari Jokar, Mohammad Reza (Supervisor)
Abstract
Using the cross docking is a strategy that plays inventory coordinating role in the supply chain. At the cross docking, products of inbound trucks are unloaded, sorted, moved and loaded onto outbound trucks for delivery to different destinations. In this concept, coordination between inbound and outbound trucks considering a cross-dock system with multiple receiving and shipping dock doors. Moreover, due to justifiability of all trucks to carry multiple product types, product assignment from inbound trucks to outbound trucks is determined simultaneous to scheduling. As an exact solution approach a MIP model is presented and since the problem is shown to be NP-hard, it can only be used to...
A Method for Road Network Development by B.O.T. (Build-Operate-Transfer) Approach with Guaranteed Return
, M.Sc. Thesis Sharif University of Technology ; Pourzahedi, Hossain (Supervisor)
Abstract
One important problem in all, particularly in developing countries, is shortage of funds to invest in infrastructure projects. One way to lessen this difficulty is to benefit from the private sector participation in this respect. Build-Operate-Own-Transfer (BOT) is a Public-Private-Partnership (PPP), in which the private sector invests and builds a (e.g. road) project, operates it for a specified period of time to collect the tolls to return the investment cost plus the specified attractive rate on it, and then transfer it to the public sector. This research, which is a continuation of previous endeavors in this area, formulates the problem, discusses the multiplicity of the solutions, and...
A Modified Artificial bee Colony Algorithm for Channel Assignment in Wireless Mesh Network
, M.Sc. Thesis Sharif University of Technology ; Mahdavi Amiri, Nezamoddin (Supervisor)
Abstract
Wireless Mesh Network (WMN) is a new technology for developing wireless networks. In a wireless communication system, a transmitter communicates with a receiver by magnetic waves. Channel is the medium used to convey information from a sender to a receiver. Interference exists between two links if they are within interference range and are assigned to the same channel. Channel assignment is all about mapping available channels to the network interfaces in order to achieve optimal network performance. A good channel assignment algorithm minimizes the total network interference. Here, we propose a modified artificial bee colony (ABC) algorithm for the fixed channel assignment (FCA) problem in...
A Hybrid Simulated Annealing Algorithm For Winner Determination problem In Combinatorial Auction
, M.Sc. Thesis Sharif University of Technology ; Kianfar, Farhad (Supervisor)
Abstract
One of the most important issues that an organization faced with is resource management. The proper resource management has the great rule in organization cost reduction. One of the most efficient processes in resource allocation is auction and there is different auction with different mechanism and goals. In an auction there is a set of items and a set of bids, and the task of auctioneer is matching items with suitable bids. Each bid consist of desirable items and the bidder value of that items. In an auction process, after mechanism design of auction and auction implementation we must identify the winners of auction and this is a hard problem even in simple auction.
In this study we...
In this study we...