Loading...
Search for:
eshghi--koorosh
1.148 seconds
Total 133 records
A Meta-Heuristic Approach for a Special Class of Job Shop Scheduling Problem
, M.Sc. Thesis Sharif University of Technology ; Koorosh, Eshghi (Supervisor)
Abstract
The job shop scheduling problem is an important and applicable optimization problem and has been attracted by many researchers in recent decades. A huge amount of applications of job shop scheduling problem in industries and services has been found yet. During the last decade, the sequence dependent setup time constraint has been considered in many researches, but with respect to the knowledge of authors, very few of these researches have considered the inseparable setup. Furthermore, few of them have considered the release date assumption. In this thesis, the classical job shop scheduling problem and the inseparable sequence dependent setup time and release date constrained problem have...
Optimization in Hub Location Allocation Problem
, M.Sc. Thesis Sharif University of Technology ; Eshghi, Koorosh (Supervisor)
Abstract
Hub location problem arises where the flow has to be routed between a set of origins and destinations, but direct links between all nodes are impossible or too costly. In these situations, e.g. transportation and communication systems, hubs serve as transshipment points to collect, transfer, and distribute the flow. In hub location allocation problem, hubs are located and non-hub nodes are allocated to them. In this thesis, two different models of capacitated multiple allocation hub location problem are discussed. In the first model, flow collection of hubs from non-hub nodes and in the second model, sum of flow collection and distribution of hubs from/to non-hub nodes is addressed. The...
Robust Facility Layout
, M.Sc. Thesis Sharif University of Technology ; Eshghi, Koorosh (Supervisor)
Abstract
Facility layout problem (FLP) is one of the classical problems that concern with planning for the placement of facilities. Two dimensional layout problem is one of the special layout problems that involves with the arrangement of facilities in non predefined shape. For solving the FLP, a number of information such as dimensions of facilities, relations between facilities, governing constrains etc., are required. But in the most research works, it has been assumed that the required information is precisely known. In this thesis, we challenge this assumption considering the size (length and width) of facilities as bounded variable parameters. In order to make the problem solvable in the sense...
Robust Supply Chain Network Desing
, M.Sc. Thesis Sharif University of Technology ; Koorosh, Eshghi (Supervisor)
Abstract
Recently, the multi-level and multi-facility industrial problem in supply chain management (SCM) has been widely investigated. Supply chain network design (SCND) is one of the most important strategic decisions in supply chain management. The problem is an important management problem in SCM and aggregates the strategic and tactical and operational level of supply chain planning. The supply networks comprise a number of manufacturing sites, a number of warehouses and distribution centers of unknown locations to be selected from a set of potential locations, and finally a number of customer zones at fixed locations. The system is modeled mathematically as a mixed-integer linear programming...
Investigating the Robustness of Scale Free Supply Networks by Using the Concept of Assortative and Disassortative Networks
, M.Sc. Thesis Sharif University of Technology ; Koorosh, Eshghi (Supervisor)
Abstract
Supply networks are often faced with disruptions that hampered the flow of goods, and have brought irreparable consequences. In this thesis, we evaluate the robustness of three echelon scale free supply chain networks consist of manufacturers, distributers and retailers from the perspective of complex network topologies and investigate the effect of assortativity and disassortativity level on the robustness of scale free supply networks. For this purpose, we use the degree preserving rewiring approach in order to increase and decrease assortativity and disassortativity of scale free networks. Then we use metrics in order to investigate the robustness and flexibility of supply networks and...
Multi-service Healthcare Network Design Assuming Patients' Choice Behavior and Their Transfers Between Services
, M.Sc. Thesis Sharif University of Technology ; Eshghi, Koorosh (Supervisor)
Abstract
Efficient location of health centers is an essential decesion in healthcare strategic planning. Nowadays constructing multi-service health centers is highly paid attention because of multiple nature of most diseases. Concentrating patients' medical services in one center prevents them from traveling to different parts of cities, especially in mega cities. In this research we have developed a mathematical model for the location of multi-service health centers assuming probabilistic demand and service time. Medical services are divided in three groups: normal, emergency and preventive. Since patients may be referred to another service after recieving a service by doctors' order, health system...
Modeling and Solving On-line Ride Sharing Problem with Modified Dial-a-Ride Model
, M.Sc. Thesis Sharif University of Technology ; Eshghi, Koorosh (Supervisor)
Abstract
Today, considering the challenges that have been raised around fossil fuels and energy consumption in recent years, efforts have been made to reduce as much as possible the number of vehicles that are personal or single-passenger on the streets. For this purpose, a concept called travel sharing has been proposed in online platforms and businesses, where travelers can travel part or all of their journey with other travelers, but pay less money. The purpose of this research is to solve the problem of allocation and accessibility of passengers and cars in travel-sharing systems. To move in this direction, we have used mathematical programming tools and designed online algorithms to solve this...
Integration of Pricing and Ordering in a Supply Chain
, M.Sc. Thesis Sharif University of Technology ; Eshghi, Koorosh (Supervisor)
Abstract
Last decade witnessed a virtual explosion of information about customers and their priorities. This information gives some potentials to companies that increase their revenues, especially when new technologies make the possibility of changing prices with low costs. Simultaneously, companies had large development in dynamic management of supply chain in both internal operations of companies and their communications. Although pricing decisions have some effects on operations, but integration of operations and marketing are very common subjects in science and business. In this thesis, we consider the integration of dynamic pricing and ordering in a supply chain. Then, we present a dynamic...
Train Timetabling Optimization in Metro Networks
, M.Sc. Thesis Sharif University of Technology ; Koorosh, Eshghi (Supervisor)
Abstract
Train scheduling is a significant issue in the railway industry in recent years because it has an important role in railway infrastructure. In this paper, the timetabling problem of a multiple tracked railway network is discussed. More specifically, a general model with specific attention to “Tehran Metro” is presented here in which a set of operational and safety requirements are also considered. The model handles the trains overtaking in a station and innovatively considers the capacity of stations. An objective function is to minimize the total travel time. The problem is NP-hard so the real size problem cannot be solved in acceptable amount of time. In order to reduce the processing time...
Decision Analysis and Revenue Management In Health-Care
,
M.Sc. Thesis
Sharif University of Technology
;
Koorosh, Eshghi
(Supervisor)
Abstract
Nowadays, Resource Capacity Management (RCM) is one of the main challenges for industries which have a limited capacity to meet the demands. Revenue Management (RM) is a technique that controls the supply, improves the quality of Capacity Management and maximizes the revenue. Supplying the products and services to different groups of customers is a decision making problem.While the classic RM techniques take into account only the expected revenue, preferences of decision makers strongly affect the results. In this study, utility theory has been proposed because the healthcare industries are usually nonprofitable and they are not highly focused on the revenue gained by their products and...
Modeling Multi-path Covering Routing Problem
, M.Sc. Thesis Sharif University of Technology ; Koorosh, Eshghi (Supervisor)
Abstract
The location problem is one of the main topics at the strategic level. This problem is investigated along with many areas such as network design and path covering problems. Routing between source and destination nodes is done in such a way that maximizes traffic coverage and reduces costs as much as possible. Routing problems are considered in goods distribution areas and urban transit systems. Goods distribution from set of cross-docks can help to reduce costs and improve resource efficiency. So, this topic is considered in this research and a suitable model is proposed. Defining and developing of the road and rail transportation networks are main topics in urban traffic management which...
Application of Hybrid Metaheuristics in Solving Magic Type Labeling of Graphs
, M.Sc. Thesis Sharif University of Technology ; Eshghi, Koorosh (Supervisor)
Abstract
Graph Labeling is one of the most active initiatives in graph theory which was introduced in the early 1960’s. One of the most prominent kind of labeling in literature is magic-type labeling inspired by defining magic numbers and magic squares. It also encompasses various types. Total edge magic labeling of Graph G, is a bijection f from V(G)∪E(G) on the set of {1,2,…,|V(G) |+|E(G) |}, on this condition that the summation of each edge label and its vertices’ labels is constant for all edges. Since introducing total edge magic labeling, numerous researches is done that mostly are dedicated to prove mathematical theorems and depicting a whether a distinct graph is magic or not. Therefore, it...
, M.Sc. Thesis Sharif University of Technology ; Eshghi, Koorosh (Supervisor)
Abstract
The focus of this research is to present a model to verify the acceptance of projects with time and cost dependency on the usage of equipments. Decision on these projects is based on a dynamic programming in which at each stage, the profit of available projects in this stage, equipment value and the best choice of future stage are decision keys. In other words, after the completion of a project, it should be decided between doing a project or selling the equipment and leaving the remaining projects. For each projects, there is a product network that includes projects jobs and operations. After accepting projects, equipments of the projects will not be renewed and the usage of the equipments...
Guide Path Design for Automated Guided Vehicles
, Ph.D. Dissertation Sharif University of Technology ; Eshghi, Koorosh (Supervisor) ; Asef Vaziri, Ardavan ($item.subfieldsMap.e)
Abstract
Around 20 to 50 percent of the operation costs occurs in manufacturing is related to facility layout. Efficient design would reduce these costs by 10 to 30 percent. Facility layout consists of design of material handling system and plant layout. Design of material handling system includes determining, the flow network and locations of Pick-up and Delivery stations which are defined regarding to the kind of material handling equipment. Today, Automated Guided Vehicles are considered as the basic material handling equipment due to their potentials in production planning and controls, high safety and flexibility and low expenses.
In this thesis, we first discuss the design of the shortest...
In this thesis, we first discuss the design of the shortest...
Extension of α[alpha]-labelings of quadratic graphs [electronic resource]
, Article International Journal of Mathematics and Mathematical Sciences ; Issue: 9-12 , 2004 , page 571-578 ; Sharif University of Technology
2004
Abstract
In this paper, all graphs are finite without loops or multiple edges, and all parameters are positive integers. The symbols |A|, Pn, and Cn denote the cardinality of set A, a snake, and a cycle with n edges, respectively. A sequence of numbers in parentheses or square brackets indicates the labels of vertices of a graph or subgraph under consideration according to whether it is a snake or cycle, respectively
A fuzzy random minimum cost network flow programming problem [electronic resource]
, Article Journal of Industrial and Systems Engineering (JISE)-Iranian Institute of Industrial Engineering ; Article 3, Volume 6, Issue 1, Spring 2012, Page 34-47 ; Eshghi, Kourosh ; Sharif University of Technology
Abstract
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained programming. Furthermore, the results of two algorithms will be compared. An illustrative example is also provided to clarify the concept
Price competition in duopoly supply chains with stochastic demand [electronic resource]
, Article Journal Of Manufacturing Systems ; 01/2014 ; Eshghi, Kourosh ; Sharif University of Technology
Abstract
In the literature, substantial researches have been carried out on supply chain coordination. The majority of these studies suggest a mechanism that enforces the supply chain members to follow the strategies that produce the equilibrium of an integrated supply chain. Moreover, most of researches do not consider the competition among supply chains
An efficient tabu search algorithm for the single row facility location problem [electronic resource]
, Article European Journal Of Operational Research ; Vol. 205, No. 1, pp. 98-105 ; Eshghi, Kourosh ; Sharif University of Technology
Abstract
The general goal of the facility layout problem is to arrange a given number of facilities to minimize the total cost associated with the known or projected interactions between them. One of the special classes of the facility layout problem is the Single Row Facility Layout Problem (SRFLP), which consists of finding an optimal linear placement of rectangular facilities with varying dimensions on a straight line. This paper first presents and proves a theorem to find the optimal solution of a special case of SRFLP. The results obtained by this theorem prove to be very useful in reducing the computational efforts when a new algorithm based on tabu search for the SRFLP is proposed in this...
Sensitivity analysis of matching pennies game [electronic resource]
, Article Mathematical and Computer Modelling ; Volume 51, Issues 5–6, March 2010, Pages 722–735 ; Eshghi, Kourosh ; Sharif University of Technology
Abstract
In this paper, we have discussed the results of sensitivity analysis in a payoff matrix of the Matching Pennies game. After representing the game as a LP model, the sensitivity analysis of the elements of the payoff matrix is presented. The game value and the optimal strategies for different values of parameters are determined and compared
An ACO algorithm for the graph coloring problem [electronic resource]
, Article Computational Intelligence Methods and Applications, ICSC Congress on ; 2005 ; Eshghi, Kourosh ; Sharif University of Technology
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