http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Egor V. Dudukalov,Elena Yu. Zolochevskaya,Svetlana G. Zubanova,Oleg S. Kharlamov,Elena V. Skripleva,Roman A. Aleshko 대한산업공학회 2021 Industrial Engineeering & Management Systems Vol.20 No.4
Due to their nature in optimization and also their colorful role in economic and social affairs, the category of optimi-zation issues has always been considered by various researchers. One of the problems that can be solved with optimi-zation tools is the issue of planning project classrooms. In this case, the goal is to plan class hours taking into account the limitations of professors and students. Accordingly, this research presents a new mathematical model for the problem of scheduling project classes. In order to solve this mathematical model, new optimization tools have been used. Accordingly, a new meta-heuristic algorithm has been developed to develop an imperialist competition algorithm. The computational results show that the algorithm used is highly efficient in optimizing the schedule of project classes.
Route Optimization of Container Ships Using Differential Evolution and Gray Wolf Optimization
Juhriyansyah Dalle,Paitoon Chetthamrongchai,Gunawan Widjaja,Egor Dudukalov,A. Heri Iswanto,Elena Sergeevna Sergushina 대한산업공학회 2021 Industrial Engineeering & Management Systems Vol.20 No.4
Container ships carry most of the world's cargo volume. Hence, Maritime transportation forms the backbone of the world merchandise trade. Today, with the advancement of shipbuilding technology and the increasing frequency of maritime transport, determining the optimal route for container ships has become more and more important for ship-ping lines and port managers. Accordingly, in the present study, we intend to investigate the ship routing problem us-ing a mixed integer linear mathematical programming model. In order to solve the proposed model, we have used the meta-heuristic algorithms of differential evolution and gray wolf optimization in MATLAB software. In the end, it was shown that the proposed mathematical model and solution approaches can assist ship operators and terminal managers in making reasonable optimization decisions.
Multi Project Scheduling and Material Planning Using Lagrangian Relaxation Algorithm
Alim Al Ayub Ahmed,Ngakan Ketut Acwin Dwijendra,Naresh Babu Bynagari,A. K. Modenov,M. Kavitha,Egor Dudukalov 대한산업공학회 2021 Industrial Engineeering & Management Systems Vol.20 No.4
Resource-constrained project scheduling is one of the well-known problems in project management. There are many cases where the appropriate schedule was determined first and material ordering plan was decided considering the given schedule. This approach ignores the interactions between these decisions. The integration of project scheduling, material procurement, and production planning of non-renewable resources leads to the coordination of project im-plementation and supplying resources. This coordination reduces total costs, including operating activities, produc-tion, ordering, holding, and penalty costs for late project completion. In addition to, there are many organizations that implement the multi project at the same time and decisions are made in a multi project environment. In this paper, a mixed integer programming model is presented for the resource-constrained multi-project scheduling problem and material ordering and production planning. Due to the application of Lagrangian relaxation algorithm in solving com-plex problems, this algorithm has been used to solve the proposed mathematical model. To evaluate the performance of the proposed model and solution method, a set of sample examples is solved and the numerical results are given. The findings of this paper show the good performance of the model and the solution method and can provide managerial insights for project managers and resource suppliers.