Dear users,
This is our new website
(we are launching the new one in order to improve our communication and provide better services to the editors and authors. So we will upload all data soon).
Please click here to visit our current website, and also to submit your paper:
www.ijsom.com
Thanks for your patience during relocation.
Feel free to contact us via info@ijsom.com and ijsom.info@gmail.com
|
|
|
|
|
|
Search published articles |
|
|
Showing 2 results for Shokr
Iman Shokr, Mohsen Sadegh Amalnick, Seyed Ali Torabi, Volume 3, Issue 2 (8-2016)
Abstract
Material selection is a challenging issue in manufacturing processes while the inappropriate selected material may lead to fail the manufacturing process or end user experience especially in high-tech industries such as aircraft and shipping. Every material has different quantitative and qualitative criteria which should be considered simultaneously when assessing and selecting the right material. A weighted linear optimization method (WLOM) in the class of data envelopment analysis which exists in literature is adopted to address material selection problem while accounting for both qualitative and quantitative criteria. However, it is demonstrated the adopted WLOM method is not able to produce a full ranking vector for the material selection problems borrowed from the literature. Thus, an augmented common weight data envelopment analysis model (ACWDEA) is developed in this paper with the aim of eliminating deficiencies of WLOM model. The proposed ACWDEA is able to produce full ranking vector in decision making problems with less computational complexities in superior to the WLOM. Two material selection problems are solved and results are compared with WLOM and previous methods. Finally, the robustness and effectiveness of the proposed ACWDEA method are evaluated through Spearman’s correlation tests.
Mohammad Mirabi, Nasibeh Shokri, Ahmad Sadeghieh, Volume 3, Issue 3 (11-2016)
Abstract
This paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. The mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. Furthermore, in order to reduce the problem searching space, a novel GA clustering method is developed. Finally, Experiments are run on number problems of varying depots and time window, and customer sizes. The method is compared to two other clustering techniques, fuzzy C means (FCM) and K-means algorithm. Experimental results show the robustness and effectiveness of the proposed algorithm.
|
|
|
|
|
|