Mohsen Momeni

  • Citations Per Year
Learn More
A Hamiltonian path is a path in an undirected graph, which visits each node exactly once and returns to the starting node. Finding such paths in graphs is the Hamiltonian path problem, which is NP-complete. In this paper, for the first time, a comparative study on metaheuristic algorithms for finding the shortest Hamiltonian path for 1071 Iranian cities is(More)
Excessive use of cytotoxic drugs owing to a dramatic increase in malignancy incidence leads to the production of high amounts of cytotoxic wastes. In Iran, management of hazardous wastes has been neglected in recent decades. The aim of this study was to determine the amount of intravenous cytotoxic drug wastes, their collection and disposal status in(More)
BACKGROUND AND OBJECTIVES Medical waste management is a major concern for healthcare facilities. One important element is the segregation of infectious waste from domestic, non-infectious waste. The aim of this qualitative study was to identify factors that negatively affect proper segregation at Nemazee Hospital, which is affiliated with Shiraz University(More)
The aim of this cross-sectional study was to investigate the implementation of and compliance with international infection control standards by patients and staff in dialysis centers in Shiraz, Iran. The results indicate negligence in various aspects of infection control. Providing staff education and training programs, establishing effective surveillance(More)
The capacitated p-median problem (CPMP) is one of the well-known facility-location problems. The objective of the problem is to minimize total cost of locating a set of capacitated service points and allocating a set of demand points to the located service points, while the total allocated demand for each service point is not be greater than its capacity(More)
Multidimensional 0-1 Knapsack Problem (MKP) is a well-known integer programming problems. The objective of MKP is to find a subset of items with maximum value satisfying the capacity constraints. A Memetic algorithm on the basis of Design and Implementation Methodology for Metaheuristic Algorithms (DIMMA) is proposed to solve MKP. DIMMA is a new methodology(More)
INTRODUCTION Today, development of professionalism is a critical aim of medical schools. Studies have demonstrated that medical students' perceived level of professionalism is inadequate worldwide. This study aimed to investigate the medical students' perceptions of their colleagues' professional behavior. METHODS This study is a cross-sectional study(More)
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching-based solution 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(More)
BACKGROUND The purpose of this study was to determine the prevalence and related factors of low birth weight (LBW) in the Southeast of Iran. METHODS This cross-sectional study was carried out in Kerman province. Data were collected from Iranian Maternal and Neonatal Network at public and private hospitals. All live births from March 2014 to March 2015(More)