در هنگام جستجو کلمه در قسمت عنوان میتوانید کلمات مورد جستجو را با کاراکتر (-) جدا کنید.
کاربرد نوع شرط:
- جایگاه : پژوهشی
- مجله: Journal of Industrial and Systems Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Cross-docking,vehicle routing problem,time windows,Bi-objective mathematical model
- چکیده:
- چکیده انگلیسی: This study addresses the pickup and delivery problem for cross-docking strategy, in which shipments are allowed to be transferred from suppliers to retailers directly as well as through cross-docks. Usual models that investigate vehicle routing in cross-docking networks force all vehicles to stop at the cross-dock even if a shipment is about to a full truckload or the vehicle collects and delivers the same set of products. In order to eliminate unnecessary stops at the dock, and thus reduce transportation costs, the designed model tries to decide about the best approach to deliver orders to retailers in a tailored network. In such a system, two objectives are taken into account: minimization of the total transportation cost and minimization of the total earliness and tardiness of visiting retailers. In order to deal with this problem, three multi-objective algorithms are developed. An evolutionary algorithm based on multi objective imperialist competitive algorithm (MOICA) is proposed, and the associated results are compared with the results obtained by non-dominated sorting genetic algorithm (NSGA-II) and Pareto archived evolution strategy (PAES) in terms of some metrics. The computational results show the superiority of the proposed algorithm compared to other algorithms in some metrics.
- انتشار مقاله: 26-08-1395
- نویسندگان: Asefeh Hasani Goodarzi,Nasim Nahavandi,Seyed Hessameddin Zegordi
- مشاهده
- جایگاه : پژوهشی
- مجله: Journal of Industrial and Systems Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Entropy,External Factors,Choquet integral,HSE,Variance of capacity
- چکیده:
- چکیده انگلیسی: Nowadays, industrialization exposes the human and environment resources to serious dangers. The importance of these resources caused the HSE (health, safety and environment) to have a significant contribution in industries’ evaluation, especially in construction industry. While evaluating the project’s success from an HSE point of view, it is not enough to rely solely on the outputs without considering the impact of external factors affecting them. On the other hand, the variety of factors affecting HSE and their different kinds of interactions, forces us to use another aggregation operators rather than linear ones. Choquet integral (CI) is a well-known powerful aggregation operator to be used in such cases. There are different methods to define the coefficients of CI. One of the most recent and prominent methods is “the most representative capacity definition method”. This paper proposes a modification to this method by improving its entropy and consequently the reliability in, as named, non-reference projects evaluation. The modified algorithm is used in evaluating the impact of external factors on HSE performance of power plant construction projects. The results show the prominence of modified algorithm’s entropy compared to the original algorithm. Ultimately the external factors integrated score, which resembles the suitability of project’s environment, is compared with the score defined considering output results. According to results, in some projects there is a deep gap between score of HSE output result and aggregated score of external factors. The gap of two scores potentially figures the internal organizational factors performance.
- انتشار مقاله: 01-05-1393
- نویسندگان: Nasim Nahavandi,Roghayeh Hemmatjou,Behzad Moshiri
- مشاهده
- جایگاه : پژوهشی
- مجله: International Journal of Engineering, Transactions A: Basics
- نوع مقاله: Journal Article
- کلمات کلیدی: Imperialist competitive algorithm,mathematical model,Grouping,non-crossing,quay crane scheduling,yard truck scheduling
- چکیده:
- چکیده انگلیسی: In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, this proposed mathematical model has suitable efficiency for solving small instances. Two versions of imperialist competitive algorithm (ICA) are presented to heuristically solve the problem. The grouping version of algorithm (G-ICA) is used to solve the large-sized instances based on considering the allocation of trucks as a grouping problem. Effectiveness of the proposed metaheuristics on small-sized problems is compared with the optimal results of the mathematical model. In order to compare the efficiency of the proposed algorithms for large-sized instances, several instances were generated and solved, and the performance of algorithms has been compared with each other. Moreover, a simulated annealing (SA) algorithm is developed to solve the problem and evaluate the performance of the proposed ICA algorithms. Based on the experimental results, the G-ICA has a better performance compared to the ICA and SA. Also an instance of a container terminal in Iran has been investigated which shows that the proposed model and solution methods are applicable in real-world problems.
- انتشار مقاله: 02-04-1398
- نویسندگان: Nasim Nahavandi,Saeed Behjat
- مشاهده
- جایگاه : پژوهشی
- مجله: Advances in Industrial Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Optimization algorithm,Imperialist competitive algorithm,Resource constrained project scheduling problem
- چکیده:
- چکیده انگلیسی: In this paper, a new algorithm based on the framework of the imperialist competitive algorithm for solving resource constrained project scheduling problem (RCPSP) will be proposed. In this problem, the activities are scheduled based on the resource and precedence relationships constraints in a way that the makes pan will be minimized. In order to model the assimilation process, a uniform crossover has been used, and to avoid premature convergence of the proposed algorithm, two revolution operators including one point revolution and multi-point revolution will be introduced. Also, in order to enhance the exploitation ability, a combined local search including permutation based local search (PBLS) and forward-backward improvement (FBI) is performed. The algorithm parameters are determined by designing Taguchi experiment, and the efficiency of proposed ICA is demonstrated by solving PSPLIB problems. Computational results and comparisons with some existing algorithms show that the proposed algorithm can produce near-optimal solution for small problems and competitive solution for large ones.
- انتشار مقاله: 23-04-1395
- نویسندگان: Iman Panahi,Nasim Nahavandi
- مشاهده
- جایگاه : پژوهشی
- مجله: Advances in Industrial Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Optimization algorithm,Imperialist competitive algorithm,Resource constrained project scheduling problem
- چکیده:
- چکیده انگلیسی: In this paper, a new algorithm based on the framework of the imperialist competitive algorithm for solving resource constrained project scheduling problem (RCPSP) will be proposed. In this problem, the activities are scheduled based on the resource and precedence relationships constraints in a way that the makes pan will be minimized. In order to model the assimilation process, a uniform crossover has been used, and to avoid premature convergence of the proposed algorithm, two revolution operators including one point revolution and multi-point revolution will be introduced. Also, in order to enhance the exploitation ability, a combined local search including permutation based local search (PBLS) and forward-backward improvement (FBI) is performed. The algorithm parameters are determined by designing Taguchi experiment, and the efficiency of proposed ICA is demonstrated by solving PSPLIB problems. Computational results and comparisons with some existing algorithms show that the proposed algorithm can produce near-optimal solution for small problems and competitive solution for large ones.
- انتشار مقاله: 23-04-1395
- نویسندگان: Iman Panahi,Nasim Nahavandi
- مشاهده