Search published articles

Showing 6 results for Yaghini

M. Yaghini, N. Ghazanfari,
Volume 21, Issue 2 (IJIEPR 2010)

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the optimization property of tabu search and the local search capability of k-means algorithm together. The contribution of proposed algorithm is to produce tabu space for escaping from the trap of local optima and finding better solutions effectively. The Tabu-KM algorithm is tested on several simulated and standard datasets and its performance is compared with k-means, simulated annealing, tabu search, genetic algorithm, and ant colony optimization algorithms. The experimental results on simulated and standard test problems denote the robustness and efficiency of the algorithm and confirm that the proposed method is a suitable choice for solving data clustering problems.

M. Yaghini, M. Momeni, M. Sarmadi ,
Volume 22, Issue 1 (IJIEPR 2011)

  The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, two hybrid efficient and effective metaheuristic algorithms are developed. The simulated annealing and ant colony optimization algorithms are combined with the local search methods. To evaluate the proposed algorithms, the standard problems with different sizes are used. The algorithms parameters are tuned by design of experiments approach and the most appropriate values for the parameters are adjusted. The performance of the proposed algorithms is analyzed by quality of solution and CPU time measures. The results show high efficiency and effectiveness of the proposed algorithms .

, ,
Volume 23, Issue 2 (IJIEPR 2012)

The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time to be solved in optimality. With binary flow variables or unsplittable MCND, the complexity of the problem is increased significantly. With growing complexity and scale of real world capacitated network design applications, metaheuristics must be developed to solve these problems. This paper presents a simulated annealing approach with innovative representation and neighborhood structure for unsplittable MCND problem. The parameters of the proposed algorithms are tuned using Design of Experiments (DOE) method and the Design-Expert statistical software. The performance of the proposed algorithm is evaluated by solving instances with different dimensions from OR-Library. The results of the proposed algorithm are compared with the solutions of CPLEX solver.  The results show that the proposed SA can find near optimal solution in much less time than exact algorithm.
Masoud Yaghini, Mohsen Momeni, Mohammadreza Momeni Sarmadi,
Volume 25, Issue 2 (IIJEPR 2014)

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is tested on the several standard instances. The results show that the algorithm outperforms the best heuristic approaches found in the literature.
Masoud Yaghini, Faeze Ghofrani, Mohammad Karimi, Majedeh Esmi-Zadeh,
Volume 27, Issue 4 (IJIEPR 2016)

The locomotive assignment and the freight train scheduling are important problems in railway transportation. Freight cars are coupled to form a freight rake. The freight rake becomes a train when a locomotive is coupled to it. The locomotive assignment problem assigns locomotives to a set of freight rakes in a way that, with minimum locomotive deadheading time, rake coupling delay and locomotive coupling delay all freight rakes are hauled to their destinations. Scheduling freight trains consists of sequencing and ordering freight trains during the non-usage time between passenger trains but with no interference and with minimum delay times. Solving these two problems simultaneously is of high importance and can be highly effective in decreasing costs for rail transportation. In this paper, we aim to minimize the operational costs for the locomotive assignment and the freight train scheduling by solving these two problems concurrently. To meet this objective, an efficient and effective algorithm based on the ant colony system is proposed. To evaluate the performance of the proposed solution method, twenty-five test problems, which are based on the conditions of Iran Railways, are solved and the computational results are reported.

Page 1 from 1     

© 2019 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb