Sasan Mahmoudinazlou

Orcid: 0000-0001-5500-471X

According to our database1, Sasan Mahmoudinazlou authored at least 7 papers between 2023 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Solving hard bi-objective knapsack problems using deep reinforcement learning.
Discret. Optim., 2025

2024
A hybrid genetic algorithm for the min-max Multiple Traveling Salesman Problem.
Comput. Oper. Res., February, 2024

An improved hybrid ICA-SA metaheuristic for order acceptance and scheduling with time windows and sequence-dependent setup times.
Neural Comput. Appl., January, 2024

A hybrid genetic algorithm with type-aware chromosomes for Traveling Salesman Problems with Drone.
Eur. J. Oper. Res., 2024

Deep Reinforcement Learning for Dynamic Order Picking in Warehouse Operations.
CoRR, 2024

Deep Reinforcement Learning for Picker Routing Problem in Warehousing.
CoRR, 2024

2023
A Hybrid Genetic Algorithm for the min-max Multiple Traveling Salesman Problem.
CoRR, 2023


  Loading...