Abtin Nourmohammadzadeh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Abtin Nourmohammadzadeh has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Stefan Voß
Institute of Information Systems, University of Hamburg, 20146 Hamburg, Germany
16 shared publications - Malek Sarhani
School of Business Administration, Al Akhawayn University in Ifrane, Ifrane, Morocco
4 shared publications - Mohammed El Amrani
Mohammed V University in Rabat
2 shared publications Sven Hartmann
Clausthal University of Technology
2 shared publications- Jawad Abrache
Al Akhawayn University
1 shared publication - Lin Xie
Brandenburg University of Technology
1 shared publication
Latest Publications
- 23 July 2025
- Published by Springer Nature
- p. 551-557
A Landscape-Driven Particle Swarm Optimization: A Preliminary Study on Feature Selection
- 23 July 2025
- Published by Springer Nature
- p. 551-557
A Landscape-Driven Particle Swarm Optimization: A Preliminary Study on Feature Selection
- Open Access
- 15 July 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 328 (2) , 390-406
A matheuristic approach for the robust coloured travelling salesman problem with multiple depots
- 15 July 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 328 (2) , 390-406
Open AccessA matheuristic approach for the robust coloured travelling salesman problem with multiple depots
- Open Access
- 24 June 2025
- Published by Elsevier in Journal of Public Transportation
- Vol. 27
Predicting and analyzing ferry transit delays using open data and machine learning
- 24 June 2025
- Published by Elsevier in Journal of Public Transportation
- Vol. 27
Open AccessPredicting and analyzing ferry transit delays using open data and machine learning
- Open Access
- 12 March 2025
- Published by Springer Nature
- p. C1
Correction to: Robust Airline Fleet and Crew Scheduling: A Matheuristic Approach
- 12 March 2025
- Published by Springer Nature
- p. C1
Open AccessCorrection to: Robust Airline Fleet and Crew Scheduling: A Matheuristic Approach
- 3 January 2025
- Published by Springer Nature
- p. 290-304
Robust Airline Fleet and Crew Scheduling: A Matheuristic Approach
- 3 January 2025
- Published by Springer Nature
- p. 290-304
Robust Airline Fleet and Crew Scheduling: A Matheuristic Approach
- Open Access
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1745-1753
A Matheuristic Algorithm to Optimise Multi-Objective Production Scheduling in a Manufacturing Plant with Fluctuating Raw Material Supplies
Production scheduling under uncertain material supplies, a common phenomenon in practical settings, presents considerable challenges, particularly within the industrial sector. The current study defines this problem as a bi-objective right-hand-side (RHS) stochastic program aiming to minimise the overall expenses associated with production and inventory as one objective, and to reduce the cumulative adverse effects resulting from product completion delays as the other objective. A mixed-integer linear model is constructed for the problem and a matheuristic algorithm, which combines variable neighbourhood search (VNS), fixed set search (FSS), and mathematical optimisation of sub-problems, is proposed to address the intricate nature of the problem. Multiple scenarios are analysed concerning the available material supplies, and robust non-dominated solutions are sought. The efficiency of the proposed algorithm is evaluated against some alternative techniques. For instance, the ϵ-constraint method is examined separately, and a hybrid metaheuristic strategy is explored, combining the non-dominated sorting genetic algorithm (NSGA-II) with multi-objective simulated annealing (MOSA). Key performance indicators including hypervolume, quality metric, and processing time are used for evaluation. Moreover, a dynamic parameter adjustment approach is implemented, demonstrating a significant level of effectiveness.
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1745-1753
Open AccessA Matheuristic Algorithm to Optimise Multi-Objective Production Scheduling in a Manufacturing Plant with Fluctuating Raw Material Supplies
Production scheduling under uncertain material supplies, a common phenomenon in practical settings, presents considerable challenges, particularly within the industrial sector. The current study defines this problem as a bi-objective right-hand-side (RHS) stochastic program aiming to minimise the overall expenses associated with production and inventory as one objective, and to reduce the cumulative adverse effects resulting from product completion delays as the other objective. A mixed-integer linear model is constructed for the problem and a matheuristic algorithm, which combines variable neighbourhood search (VNS), fixed set search (FSS), and mathematical optimisation of sub-problems, is proposed to address the intricate nature of the problem. Multiple scenarios are analysed concerning the available material supplies, and robust non-dominated solutions are sought. The efficiency of the proposed algorithm is evaluated against some alternative techniques. For instance, the ϵ-constraint method is examined separately, and a hybrid metaheuristic strategy is explored, combining the non-dominated sorting genetic algorithm (NSGA-II) with multi-objective simulated annealing (MOSA). Key performance indicators including hypervolume, quality metric, and processing time are used for evaluation. Moreover, a dynamic parameter adjustment approach is implemented, demonstrating a significant level of effectiveness.
- Open Access
- 22 September 2023
- Published by Springer Nature in Journal of Heuristics
- Vol. 29 (4-6) , 435-460
A matheuristic approach for the family traveling salesman problem
In the family traveling salesman problem (FTSP), there is a set of cities which are divided into a number of clusters called families. The salesman has to find a shortest possible tour visiting a specific number of cities from each of the families without any restriction of visiting one family before starting the visit of another one. In this work, the general concept of the Partial OPtimization Metaheuristic Under Special Intensification Conditions is linked with the exact optimization by a classical solver using a mathematical programming formulation for the FTSP to develop a matheuristic. Moreover, a genetic and a simulated annealing algorithm are used as metaheuristics embedded in the approach. The method is examined on a set of benchmark instances and its performance is favorably compared with a state-of-the-art approach from literature. Moreover, a careful analysis of the specific components of the approach is undertaken to provide insights into the impact of their interplay.
- 22 September 2023
- Published by Springer Nature in Journal of Heuristics
- Vol. 29 (4-6) , 435-460
Open AccessA matheuristic approach for the family traveling salesman problem
In the family traveling salesman problem (FTSP), there is a set of cities which are divided into a number of clusters called families. The salesman has to find a shortest possible tour visiting a specific number of cities from each of the families without any restriction of visiting one family before starting the visit of another one. In this work, the general concept of the Partial OPtimization Metaheuristic Under Special Intensification Conditions is linked with the exact optimization by a classical solver using a mathematical programming formulation for the FTSP to develop a matheuristic. Moreover, a genetic and a simulated annealing algorithm are used as metaheuristics embedded in the approach. The method is examined on a set of benchmark instances and its performance is favorably compared with a state-of-the-art approach from literature. Moreover, a careful analysis of the specific components of the approach is undertaken to provide insights into the impact of their interplay.
- 7 September 2023
- Published by Springer Nature
- p. 365-380
An Effective Matheuristic Approach for Robust Bus Driver Rostering with Uncertain Daily Working Hours
- 7 September 2023
- Published by Springer Nature
- p. 365-380
An Effective Matheuristic Approach for Robust Bus Driver Rostering with Uncertain Daily Working Hours