Rahim Akhavan

Bio: Rahim Akhavan is an academic researcher from Kermanshah University of Medical Sciences. The author has contributed to research in topics: Metaheuristic & Network planning and design. The author has an hindex of 4, co-authored 4 publications receiving 75 citations. Previous affiliations of Rahim Akhavan include Iran University of Science and Technology.

Multicommodity Network Design Problem in Rail Freight Transportation Planning

Abstract: Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. In general, decision making in rail freight transportation has three main levels: strategic, tactical, and operational. In the field of rail freight transportation planning, MCND occurs in all levels of decision making such as car blocking, train makeup, and empty car distribution. This paper presents a review of MCND problems modeling, their applications in rail freight transportation planning, and solution methods which have been developed to solve them.

DIMMA: A Design and Implementation Methodology for Metaheuristic Algorithms-A Perspective from Software Development

Abstract: Metaheuristic algorithms will gain more and more popularity in the future as optimization problems are increasing in size and complexity. In order to record experiences and allow project to be replicated, a standard process as a methodology for designing and implementing metaheuristic algorithms is necessary. To the best of the authors' knowledge, no methodology has been proposed in literature for this purpose. This paper presents a Design and Implementation Methodology for Metaheuristic Algorithms, named DIMMA. The proposed methodology consists of three main phases and each phase has several steps in which activities that must be carried out are clearly defined in this paper. In addition, design and implementation of tabu search metaheuristic for travelling salesman problem is done as a case study to illustrate applicability of DIMMA.

A Hybrid Simulated Annealing and Simplex Method for Fixed-Cost Capacitated Multicommodity Network Design

Abstract: The fixed-cost Capacitated Multicommodity Network Design (CMND) problem is a well known NP-hard problem This paper presents a matheuristic algorithm combining Simulated Annealing (SA) metaheuristic and Simplex method for CMND problem In the proposed algorithm, a binary array is considered as solution representation and the SA algorithm manages open and closed arcs Several strategies for opening and closing arcs are proposed and evaluated In this matheuristic approach, for a given design vector, CMND becomes a Capacitated Multicommodity minimum Cost Flow (CMCF) problem The exact evaluation of the CMCF problem is performed using the Simplex method The parameter tuning for the proposed algorithm is done by means of design of experiments approach The performance of the proposed algorithm is evaluated by solving different benchmark instances The results of the proposed algorithm show that it is able to obtain better solutions in comparison with previous methods in the literature

Reengineering the Locomotive Operation Management Process in the Railways of Iran (RAI)

Abstract: This article is the result of a project performed in the Iranian Railways (RAI) with the purpose of radical process improvement to optimize the utilization of fixed assets. To carry out this project, a BPR methodology is customized. In this project, after completing preliminary studies and documentation and analysis stages, the locomotive distribution process was selected among all the other processes in the operations funtional area as the most critical process, in regard of the situations of RAI, to be reengineered. According to the deployed methodology, after putting behind all necessary studies and documentations on the current performance of the locomotive distribution process, its problems were analyzed and improvement objectives set. Three alternatives have been presented for the new process and the proposed process is introduced in further detail.

The Design and Analysis of Experiments

Abstract: THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem

Abstract: We consider heuristic algorithms for the resource-constrained project scheduling problem. Starting with a literature survey, we summarize the basic components of heuristic approaches. We briefly describe so-called X -pass methods which are based on priority rules as well as metaheuristic algorithms. Subsequently, we present the results of our in-depth computational study. Here, we evaluate the performance of several state-of-the-art heuristics from the literature on the basis of a standard set of test instances and point out to the most promising procedures. Moreover, we analyze the behavior of the heuristics with respect to their components such as priority rules and metaheuristic strategy. Finally, we examine the impact of problem characteristics such as project size and resource scarceness on the performance.

Parallel Metaheuristics

Abstract: A review of Parallel Metaheuristics, Enrique Alba, ed.

Innovations in Data Methodologies and Computational Algorithms for Medical Applications

Abstract: Medicine has, until recently, been slow to adapt to information technologies and systems for many reasons, but the future lies therein. Innovations in Data Methodologies and Computational Algorithms for Medical Applications offers the most cutting-edge research in the field, offering insights into case studies and methodologies from around the world. The text details the latest developments and will serve as a vital resource to practitioners and academics alike in the burgeoning field of medical applications of technologies. As security and privacy improve, Electronic Health Records and informatics in the medical field are becoming ubiquitous, and staying abreast of the latest information can be difficult. This volume serves as a reference handbook and theoretical framework for the future of the field.

Modeling, Analysis, and Applications in Metaheuristic Computing: Advancements and Trends

Abstract: The engineering and business problems the world faces today have become more impenetrable and unstructured, making the design of a satisfactory problem-specific algorithm nontrivial.Modeling, Analysis, and Applications in Metaheuristic Computing: Advancements and Trends is a collection of the latest developments, models, and applications within the transdisciplinary fields related to metaheuristic computing. Providing researchers, practitioners, and academicians with insight into a wide range of topics such as genetic algorithms, differential evolution, and ant colony optimization, this book compiles the latest findings, analysis, improvements, and applications of technologies within metaheuristic computing.