List of Articles NP-Hard Problem Open Access Article Abstract Page Full-Text 1 - An Effective Algorithm in order to solve the Capacitated Clustering Problem N. Mahmoodi Darani P. Bassiri M. Yousefikhoshbakht Open Access Article Abstract Page Full-Text 2 - مروری نظام مند بر روش های مکاشفه ای ترکیب سرویس در محیط محاسبات ابری محمدباقر کریمی 10.30495/ijim.2022.68023.1606 Open Access Article Abstract Page Full-Text 3 - Combination of Taboo Search and Ant Colony System Approach to Solve the Vehicle Routing Problem Narges Mahmoodi Darani Azam Dolatnejad Majid Yousefikhoshbakht Open Access Article Abstract Page Full-Text 4 - Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm Hossein Larki Majid Yousefikhoshbakht Open Access Article Abstract Page Full-Text 5 - An Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem Mohammad Sedighpour Majid Yousefikhoshbakht Narges Mahmoodi Darani Open Access Article Abstract Page Full-Text 6 - An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery Majid Yousefikhoshbakht Farzad Didehvar Farhad Rahmati Open Access Article Abstract Page Full-Text 7 - An Effective Ant Colony Algorithm for the Traveling Salesman Problem Majid Yousefikhoshbakht Azam Dolatnejad Open Access Article Abstract Page Full-Text 8 - Solving the Capacitated Clustering Problem by a Combined Meta-Heuristic Algorithm Narges Mahmoodi Darani Vahid Ahmadi Zahra Saadati Eskandari Majid Yousefikhoshbakht Open Access Article Abstract Page Full-Text 9 - Solving the vehicle routing problem by a hybrid meta-heuristic algorithm Majid Yousefikhoshbakht Esmaile Khorram Open Access Article Abstract Page Full-Text 10 - A modified elite ACO based avoiding premature convergence for travelling salesmen problem M Yousefikhoshbakht E Mahmoodabadi M Sedighpour
