M. Aydin

Publications91
h-index18
Citations1,168
Highly Influential Citations49
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • R. Trestian
  • 87 Publications • 1,264 Citations
  • A. Tor
  • 76 Publications • 3,047 Citations
  • D. Barceló
  • 1,102 Publications • 55,233 Citations
  • P. Kuonen
  • 105 Publications • 1,231 Citations
  • Publications
  • Influence
Dynamic job-shop scheduling using reinforcement learning agents
Static and dynamic scheduling methods have attracted a lot of attention in recent years. Among these, dynamic scheduling techniques handle scheduling problems where the scheduler does not possess… Expand
  • 165
  • 17
  • PDF
A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems
TLDR
In this paper, the Evolutionary Simulated Annealing (ESA) algorithm, its distributed implementation (dESA) and its application to two combinatorial problems are presented. Expand
  • 102
  • 6
  • PDF
Teams of autonomous agents for job-shop scheduling problems: An experimental study
TLDR
ATeams—teams of autonomous agents co-operating by sharing solutions through a common memory—have been proposed as a means of solving combinatorial optimization problems. Expand
  • 49
  • 6
UMTS base station location planning: a mathematical model and heuristic optimisation algorithms
TLDR
We propose a mathematical model for UMTS radio network planning taking into consideration fast power control, soft handover and pilot signal power in both uplink and downlink. Expand
  • 47
  • 2
A simulated annealing algorithm for multi-agent systems: a job-shop scheduling application
TLDR
In this paper, a parallel implementation of the modular simulated annealing algorithm for classical job-shop scheduling is presented. Expand
  • 60
  • 2
A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems
TLDR
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for solving combinatorial optimization problems. Expand
  • 40
  • 2
Parallel variable neighbourhood search algorithms for job shop scheduling problems
Variable neighbourhood search (VNS) is one of the most recent metaheuristics used for solving combinatorial optimization problems in which a systematic change of neighbourhood with a local search is… Expand
  • 31
  • 2
A quantitative approach for measuring process innovation: a case study in a manufacturing company
Process management and innovation arguably remain among the concepts under focus of recent researches since there is no significantly outstanding method to measure and monitor the level of innovation… Expand
  • 20
  • 2
Coordinating metaheuristic agents with swarm intelligence
  • M. Aydin
  • Engineering, Computer Science
  • J. Intell. Manuf.
  • 1 August 2012
TLDR
Coordination of multi agent systems remains as a problem since there is no prominent method to completely solve this problem. Expand
  • 49
  • 1
  • PDF
Main Effect Fine-tuning of the Mutation Operator and the Neighbourhood Function for Uncapacitated Facility Location Problems
TLDR
In both genetic algorithms (GAs) and simulated annealing (SA), solutions can be represented by gene representation. Expand
  • 14
  • 1
...
1
2
3
4
5
...