Ali Divsalar
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
Ali Divsalar has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Pieter Vansteenwegen
KU Leuven
4 shared publications - Saeed Emami
Babol Noshiravani University of Technology
3 shared publications Armin Jabbarzadeh
School of Industrial Engineering, Iran University of Science and Technology, Narmak, Tehran, Iran
2 shared publications- Dirk Cattrysse
KU Leuven
2 shared publications Ghazaleh Divsalar
School of Industrial Engineering, Iran University of Science and Technology, Narmak, Tehran, Iran
2 shared publicationsHadi Sahebi
School of Industrial Engineering, Iran University of Science and Technology, Narmak, Tehran, Iran
2 shared publications
Latest Publications
- 5 October 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 261
Fix-and-Relax based heuristic approach for robust two-echelon vehicle routing problem for milk collection: A case study
- 5 October 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 261
Fix-and-Relax based heuristic approach for robust two-echelon vehicle routing problem for milk collection: A case study
- 20 October 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 149
An integrated recommender system for multi-day tourist itinerary
- 20 October 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 149
An integrated recommender system for multi-day tourist itinerary
- 20 June 2023
- Published by Springer Nature in Annals of Operations Research
- Vol. 339 (3) , 1637-1677
A Benders decomposition algorithm for the multi-mode resource-constrained multi-project scheduling problem with uncertainty
- 20 June 2023
- Published by Springer Nature in Annals of Operations Research
- Vol. 339 (3) , 1637-1677
A Benders decomposition algorithm for the multi-mode resource-constrained multi-project scheduling problem with uncertainty
- 10 June 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 230
A green production routing problem for medical nitrous oxide: Model and solution approach
- 10 June 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 230
A green production routing problem for medical nitrous oxide: Model and solution approach
- 17 March 2023
- Published by Springer Nature in Optimization Letters
- Vol. 17 (9) , 2257-2298
Multi-objective home health care routing: a variable neighborhood search method
Health and convenience are two indispensable indicators of the society promotion. Nowadays, to improve community health levels, the comfort of patients and those in need of health services has received much attention. Providing Home Health Care (HHC) services is one of the critical issues of health care to improve the patient convenience. However, manual nurse planning which is still performed in many HHC institutes results in a waste of time, cost, and ultimately lower efficiency. In this research, a multi-objective mixed-integer model is presented for home health care planning so that in addition to focusing on the financial goals of the institution, other objectives that can help increase productivity and quality of services are highlighted. Therefore, four different objectives of the total cost, environmental emission, workload balance, and service quality are addressed. Taking into account medical staff with different service levels, and the preferences of patients in selecting a service level, as well as different vehicle types, are other aspects discussed in this model. The epsilon-constraint method is implemented in CPLEX to solve small-size instances. Moreover, a Multi-Objective Variable Neighborhood Search (MOVNS) composed of nine local neighborhood moves is developed to solve the practical-size instances. The results of the MOVNS are compared with the epsilon-constraint method, and the strengths and weaknesses of the proposed algorithm are demonstrated by a comprehensive sensitivity analysis. To show the applicability of the algorithm, a real example is designed based on a case study, and the results of the algorithm over real data are evaluated.
- 17 March 2023
- Published by Springer Nature in Optimization Letters
- Vol. 17 (9) , 2257-2298
Multi-objective home health care routing: a variable neighborhood search method
Health and convenience are two indispensable indicators of the society promotion. Nowadays, to improve community health levels, the comfort of patients and those in need of health services has received much attention. Providing Home Health Care (HHC) services is one of the critical issues of health care to improve the patient convenience. However, manual nurse planning which is still performed in many HHC institutes results in a waste of time, cost, and ultimately lower efficiency. In this research, a multi-objective mixed-integer model is presented for home health care planning so that in addition to focusing on the financial goals of the institution, other objectives that can help increase productivity and quality of services are highlighted. Therefore, four different objectives of the total cost, environmental emission, workload balance, and service quality are addressed. Taking into account medical staff with different service levels, and the preferences of patients in selecting a service level, as well as different vehicle types, are other aspects discussed in this model. The epsilon-constraint method is implemented in CPLEX to solve small-size instances. Moreover, a Multi-Objective Variable Neighborhood Search (MOVNS) composed of nine local neighborhood moves is developed to solve the practical-size instances. The results of the MOVNS are compared with the epsilon-constraint method, and the strengths and weaknesses of the proposed algorithm are demonstrated by a comprehensive sensitivity analysis. To show the applicability of the algorithm, a real example is designed based on a case study, and the results of the algorithm over real data are evaluated.
- 15 September 2022
- Published by Springer Nature in Information Technology and Management
- Vol. 25 (3) , 247-275
The bi-objective orienteering problem with hotel selection: an integrated text mining optimisation approach
- 15 September 2022
- Published by Springer Nature in Information Technology and Management
- Vol. 25 (3) , 247-275
The bi-objective orienteering problem with hotel selection: an integrated text mining optimisation approach
- 21 February 2022
- Published by Springer Nature in Soft Computing
- Vol. 26 (9) , 4303-4332
An optimization approach for green tourist trip design
- 21 February 2022
- Published by Springer Nature in Soft Computing
- Vol. 26 (9) , 4303-4332
An optimization approach for green tourist trip design
- 1 December 2021
- Published by Elsevier in Applied Soft Computing
- Vol. 113
The Categorized Orienteering Problem with Count-Dependent Profits
- 1 December 2021
- Published by Elsevier in Applied Soft Computing
- Vol. 113
The Categorized Orienteering Problem with Count-Dependent Profits
- Open Access
- 14 June 2021
- Published by Springer Nature in Research Square
An optimization approach for green tourist trip design
In this paper, the Multi-Objective Multi-Modal Green Tourist Trip Design Problem (MO-MM-GTTDP) as the multi-modal variant of the orienteering problem is investigated. For this problem, a Multi-Objective mixed-integer linear model is formulated, which maximizes the total score of the Trip, minimizes the total cost of the trip as well as the total emission produced in the trip. Various transportation modes are considered for the tourist to choose to move between points of interest (POIs). The tourist choice may be affected by the transportation time and cost. Moreover, choosing the transportation mode will have an impact on the amount of trip pollutants. The cost of visiting POIs, as well as the cost of transportation between POIs, is considered as the total cost of the tour. In addition, a Multi-Objective Variable Neighborhood Search (MOVNS) algorithm is designed to solve instances of this problem. Moreover, a, E - constraint method is implemented in CPLEX and used to evaluate the performance of the presented MOVNS. New instances of the problem are generated based on the existed benchmark OP instances. The conclusion is the high quality of the proposed MOVNS algorithm solutions in practically acceptable computation time (few seconds). Finally, a small case study based on real data on several POIs in the city of Tehran is generated and used to demonstrate the performance of the proposed model and algorithm in practice. For this case study, by using the multi-attribute decision-making method of TOPSIS, the obtained non-dominated solutions are ranked, and the best ones are presented to the tourist.
- 14 June 2021
- Published by Springer Nature in Research Square
Open AccessAn optimization approach for green tourist trip design
In this paper, the Multi-Objective Multi-Modal Green Tourist Trip Design Problem (MO-MM-GTTDP) as the multi-modal variant of the orienteering problem is investigated. For this problem, a Multi-Objective mixed-integer linear model is formulated, which maximizes the total score of the Trip, minimizes the total cost of the trip as well as the total emission produced in the trip. Various transportation modes are considered for the tourist to choose to move between points of interest (POIs). The tourist choice may be affected by the transportation time and cost. Moreover, choosing the transportation mode will have an impact on the amount of trip pollutants. The cost of visiting POIs, as well as the cost of transportation between POIs, is considered as the total cost of the tour. In addition, a Multi-Objective Variable Neighborhood Search (MOVNS) algorithm is designed to solve instances of this problem. Moreover, a, E - constraint method is implemented in CPLEX and used to evaluate the performance of the presented MOVNS. New instances of the problem are generated based on the existed benchmark OP instances. The conclusion is the high quality of the proposed MOVNS algorithm solutions in practically acceptable computation time (few seconds). Finally, a small case study based on real data on several POIs in the city of Tehran is generated and used to demonstrate the performance of the proposed model and algorithm in practice. For this case study, by using the multi-attribute decision-making method of TOPSIS, the obtained non-dominated solutions are ranked, and the best ones are presented to the tourist.
- Open Access
- 1 March 2019
- Vol. 30 (1) , 117-134
A Bi-Objective Vehicle Routing Problem with Time Windows Considering Fuel Consumption and Co2 Emission
- 1 March 2019
- Vol. 30 (1) , 117-134
Open AccessA Bi-Objective Vehicle Routing Problem with Time Windows Considering Fuel Consumption and Co2 Emission