Morteza Keshtkaran

According to our database, Morteza Keshtkaran authored at least 6 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2024

Revised eight-step feasibility checking procedure with linear time complexity for the Dial-a-Ride Problem (DARP).

Somayeh Sohrabi, Koorush Ziarati, Morteza Keshtkaran

Comput. Oper. Res., 2024

2021

ACS-OPHS: Ant Colony System for the Orienteering Problem with hotel selection.

Somayeh Sohrabi, Koorush Ziarati, Morteza Keshtkaran

EURO J. Transp. Logist., 2021

2020

A Greedy Randomized Adaptive Search Procedure for the Orienteering Problem with Hotel Selection.

Somayeh Sohrabi, Koorush Ziarati, Morteza Keshtkaran

Eur. J. Oper. Res., 2020

2018

TFI-Apriori: Using new encoding to optimize the apriori algorithm.

Ebrahim Ansari, M. H. Sadreddini, Seyed Mohammad Hadi Mirsadeghi, Morteza Keshtkaran, Richard Wallace

Intell. Data Anal., 2018

2016

A novel GRASP solution approach for the Orienteering Problem.

Morteza Keshtkaran, Koorush Ziarati

J. Heuristics, 2016

2011

A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems.

Morteza Keshtkaran, Roohollah Taghizadeh, Koorush Ziarati

Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011