Article
Computer Science, Artificial Intelligence
Babak Rezaei, Frederico Gadelha Guimaraes, Rasul Enayatifar, Pauline C. Haddow
Summary: This article introduces a hybrid metaheuristic algorithm, ICAHGS, for solving the Capacitated Vehicle Routing Problem (CVRP). The algorithm combines the refined Imperialist Competitive Algorithm (ICA) and the Hybrid Genetic Search (HGS-CVRP) algorithm, with a multi-step restart mechanism for intensification improvement. The proposed method allows for parallel processing, resulting in increased computational efficiency. Comparative experiments demonstrate the competitive performance of the proposed algorithm.
APPLIED SOFT COMPUTING
(2023)
Article
Chemistry, Multidisciplinary
Trust Tawanda, Philimon Nyamugure, Santosh Kumar, Elias Munapo
Summary: The travelling salesman problem (TSP) involves visiting a finite number of nodes exactly once, with the objective of minimizing the total weight of connecting arcs. We propose a labelling method to solve the TSP problem and the algorithm terminates after K-1 iterations. The algorithm is able to determine alternative tours if they exist in the TSP network, and its computational complexity reduces with increasing iterations, making it powerful and efficient. Numerical illustrations are provided to demonstrate the efficiency and validity of the proposed algorithm.
APPLIED SCIENCES-BASEL
(2023)
Article
Computer Science, Artificial Intelligence
Xin-rui Tao, Jun-qing Li, Ti-hao Huang, Peng Duan
Summary: The research on resource-constrained hybrid flowshop problem led to the proposal of a discrete imperialist competitive algorithm (DICA) to minimize makespan and energy consumption. The algorithm represents solutions using two-dimensional vectors, with one for scheduling sequence and the other for machine assignment, and incorporates a decoding method considering resource allocation. By combining DICA with simulated annealing algorithm (SA), the proposed approach showed high efficiency in solving the RCHFS problem.
COMPLEX & INTELLIGENT SYSTEMS
(2021)
Article
Computer Science, Theory & Methods
Muhammad Khahfi Zuhanda, Noriszura Ismail, Rezzy Eko Caraka, Rahmad Syah, Prana Ugiana Gio
Summary: This study analyzes the Traveling Salesman Problem in Medan City, Indonesia, using four heuristic algorithms and finds that hybrid methods show promise in generating superior solutions.
INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS
(2023)
Article
Computer Science, Artificial Intelligence
Mohamed Reda, Ahmed Onsy, Mostafa A. Elhosseini, Amira Y. Haikal, Mahmoud Badawy
Summary: In this study, a newly proposed variant of the cuckoo search algorithm was used to solve the order picking routing problem in warehouses. The algorithm was modified and applied to both traditional TSP and OPR problems. Simulation and practical results demonstrated the significant performance improvement of this algorithm, especially in solving complex problems.
KNOWLEDGE-BASED SYSTEMS
(2022)
Article
Computer Science, Artificial Intelligence
Karuna Panwar, Kusum Deep
Summary: The Discrete Salp Swarm Algorithm (DSSA) is a recently proposed swarm intelligence-based algorithm, mainly used to solve the Travelling Salesman Problem (TSP). By introducing discrete operations and the 2-opt method, DSSA has shown superior performance in a majority of TSP instances.
APPLIED INTELLIGENCE
(2023)
Article
Computer Science, Information Systems
Farhad Soleimanian Gharehchopogh, Benyamin Abdollahzadeh
Summary: This paper presents a new method for solving the Travelling Salesman Problem using random-key encoding and the Harris Hawk Optimization algorithm, combining different search strategies and neighborhood search operators. Experimental results demonstrate the excellent performance and efficiency of the proposed algorithm.
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS
(2022)
Article
Automation & Control Systems
Pengfei He, Jin-Kao Hao
Summary: The Colored Traveling Salesmen Problem (CTSP) is a generalization of the popular Traveling Salesman Problem, involving multiple salesmen; The goal is to determine the shortest Hamiltonian circuit for each salesman, satisfying specific conditions; It is known to be computationally challenging, and a solution has been proposed.
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
(2021)
Article
Mathematics
Marius Gavrilescu, Sabina-Adriana Floria, Florin Leon, Silvia Curteanu
Summary: This paper introduces a novel neural network optimization method that combines improved evolutionary competitive algorithm and gradient-based backpropagation. By incorporating backpropagation and self-adaptive hyperparameter adjustment strategy, this method generates regression models that are better correlated with the desired outputs and provides more accurate predictions.
Article
Computer Science, Artificial Intelligence
Karuna Panwar, Kusum Deep
Summary: Grey Wolf Optimizer (GWO) is a population-based metaheuristic algorithm inspired by the behavior of grey wolves, originally proposed for solving continuous optimization problems. A novel discrete GWO algorithm (D-GWO) is introduced in this paper, incorporating the 2-opt algorithm to enhance performance and demonstrating superior results compared to other algorithms through rigorous comparisons.
APPLIED SOFT COMPUTING
(2021)
Article
Engineering, Multidisciplinary
Farhad Soleimanian Gharehchopogh, Benyamin Abdollahzadeh, Bahman Arasteh
Summary: This paper proposes a new algorithm for solving the Travelling Salesman Problem, which combines the Farmland Fertility Algorithm and the Modified Choice Function technique, and incorporates the Lin-Kernighan local search to improve efficiency and performance. The algorithm is proven to outperform comparable methods in terms of computation time, percentage deviation, and tour length through comparisons with other algorithms.
CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES
(2023)
Article
Computer Science, Information Systems
Hui Yu, Jun-qing Li, Xiao-long Chen, Wei Niu, Hong-yan Sang
Summary: Surgical case scheduling is a key issue in the field of medicine. This study regards it as a flexible job shop scheduling problem and proposes an improved multi-objective imperialist competitive algorithm (IMOICA) to optimize the overall scheduling. The algorithm utilizes various strategies to enhance its global search ability and diversity, and experiments show its efficiency in solving the surgical case scheduling problem.
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS
(2022)
Article
Management
eric D. Taillard
Summary: A linearithmic randomized method based on POPMUSIC is proposed for generating good solutions to the traveling salesman problem. The method has been tested on instances with billions of cities and is able to generate a high proportion of the edges of the best known solutions in a few dozen runs. Additionally, the method is also able to provide extremely good solutions for nonEuclidean instances.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Multidisciplinary Sciences
Youlian Zheng, Yue Yuan, Qiaoxian Zheng, Deming Lei
Summary: In this paper, a hybrid imperialist competitive algorithm (HICA) is proposed to minimize total tardiness in the distributed unrelated parallel machines scheduling problem (DUPMSP). The algorithm categorizes empires into three types and implements diversified assimilation and novel imperialist competition strategies. Computational results show the effectiveness of the new strategies and demonstrate HICA as a promising approach for solving the DUPMSP.
Article
Computer Science, Artificial Intelligence
Hamid Ali, Muhammad Zaid Rafique, Muhammad Shahzad Sarfraz, Muhammad Sheraz Arshad Malik, Mohammed A. Alqahtani, Jehad Saad Alqurni
Summary: Real-world optimization problems are becoming more complex and require advanced techniques. The Traveling Thief Problem combines the 0/1 knapsack problem and traveling salesman problem, and the proposed technique efficiently solves the TTP problem.
PEERJ COMPUTER SCIENCE
(2021)
Article
Automation & Control Systems
M. Yousefikhoshbakht, F. Didehvar, F. Rahmati
INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL
(2014)
Article
Engineering, Industrial
Majid Yousefikhoshbakht, Farzad Didehvar, Farhad Rahmati
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2014)
Article
Mathematics, Interdisciplinary Applications
Majid Yousefikhoshbakht
Summary: The traveling salesman problem is a significant issue in combinatorial optimization, and researchers have proposed the MPSO algorithm to address the problem of local optimization in the classical PSO algorithm. By introducing various local search algorithms and a new method for moving particles towards the best particle, the MPSO algorithm has demonstrated efficiency in achieving excellent solutions.
Article
Engineering, Multidisciplinary
Arsalan Rahmani, Majid Yousefikhoshbakht
Summary: The design for integrating the forward-reverse logistics network in a closed chain is proposed to minimize total costs. A mixed integer nonlinear program and Benders decomposition method are developed for efficient problem-solving. Computational results show the proposed algorithm outperforms other algorithms in solving the MINLP model.
MATHEMATICAL PROBLEMS IN ENGINEERING
(2021)
Article
Engineering, Multidisciplinary
Zakir Hussain Ahmed, Majid Yousefikhoshbakht
Summary: This article studies the heterogeneous fixed fleet open vehicle routing problem with time windows, which aims to minimize the fixed and variable transportation costs for a fixed number of heterogeneous fleet. A mixed integer linear programming model is proposed and an improved tabu search algorithm is used to solve the problem.
ALEXANDRIA ENGINEERING JOURNAL
(2023)
Article
Computer Science, Artificial Intelligence
Azam Dolatnezhadsomarin, Esmaile Khorram, Majid Yousefikhoshbakht
Summary: In this paper, a modified Pascoletti-Serafini scalarization approach called MOP_MPS is proposed for generating approximations of a Pareto front of bounded multi-objective optimization problems (MOPs). The algorithm is applied to six test problems and compared with other famous algorithms, showing its effectiveness and competitiveness. Additionally, the paper suggests another algorithm called MPP_MPS for solving non-linear MPPs with continuous and bounded multiplied functions, and demonstrates its superiority over a cut and bound algorithm in terms of CPU time.
Article
Multidisciplinary Sciences
Zakir Hussain Ahmed, Majid Yousefikhoshbakht
Summary: In this study, the heterogeneous fixed fleet open vehicle routing problem with time windows is considered. A mixed integer programming model and an exact algorithm are introduced to solve the problem. Additionally, a hybrid algorithm based on modified rank-based ant system is developed and its efficiency is compared with other methods on standard instances. The results demonstrate the effectiveness of the proposed algorithm.
Review
Mathematics, Interdisciplinary Applications
Majid Yousefikhoshbakht, Mohamadreza Chaharmahali, Zakir Hussain Ahmed
Summary: Goods transportation is seen as a crucial activity in the national economy, with logistics and supply chain playing a significant role in various industries and services. The increasing population has led to a greater need for efficient transportation, particularly in urban areas where the importance of logistics is evident. The price of goods is a key factor in both service and production, and transportation has been identified as one of the most influential factors in determining prices.
Article
Engineering, Multidisciplinary
Majid Yousefikhoshbakht, Azam Dolatnejad
INTERNATIONAL JOURNAL OF PRODUCTION MANAGEMENT AND ENGINEERING
(2017)
Article
Engineering, Multidisciplinary
Arsalan Rahmani, Majid Yousefikhoshbakht
INTERNATIONAL JOURNAL OF PRODUCTION MANAGEMENT AND ENGINEERING
(2017)
Article
Engineering, Multidisciplinary
Majid Yousefikhoshbakht, Nasrin Malekzadeh, Mohammad Sedighpour
INTERNATIONAL JOURNAL OF PRODUCTION MANAGEMENT AND ENGINEERING
(2016)
Article
Engineering, Industrial
Majid Yousefikhoshbakht, Farzad Didehvar, Farhad Rahmati
JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING
(2014)
