Volume 10, Issue 38 (Spring 2022)
IUESA 2022, 10(38): 1-18 |
Back to browse issues page
1- Payame Noor University, Tehran, Iran , mailto:jafarian@student.pnu.ac.ir
2- Department of Industrial Engineering, Faculty of Engineering, University of Science and Culture, Tehran, Iran
3- Department of Industrial Engineering, Payame Noor University, Tehran, Iran
2- Department of Industrial Engineering, Faculty of Engineering, University of Science and Culture, Tehran, Iran
3- Department of Industrial Engineering, Payame Noor University, Tehran, Iran
Abstract: (922 Views)
Orientation is a type of classic transportation problem that aims to find the best route to visit a given set of vertices, provided that the length of the route exceeds a certain time horizon. Don't be. Since the emergence of this problem, many researchers have used its special structure to model and solve various problems in various fields, including issues and problems in the field of urban transportation. Due to the NP-Hard nature of the problem, this paper presents a very high degree of random genetic algorithm to solve a new type of problem called the dependent time horizon orientation problem. The proposed genetic algorithm uses two combinatorial operators and two mutation operators. In this paper, to show its convergence, the best answers in the literature for 40 standard examples of the orientation problem are used; Thus, the results of solving these examples have been compared with the proposed algorithm and due to the optimal performance of the algorithm, the algorithm has been used to solve the problem of orientation with a dependent time horizon.
Type of Study: Research |
Subject:
Special
Received: 2018/06/24 | Accepted: 2019/04/27 | Published: 2022/05/31 | ePublished: 2022/05/31
Received: 2018/06/24 | Accepted: 2019/04/27 | Published: 2022/05/31 | ePublished: 2022/05/31
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |