Title of paper is” Generalized Assignment problem ticket to expert with maximum matching degree and minimum makespan"
(1)Maximize the matching degree of expert with problem ticket
(2)Minimize the makespan
(3)Minimize the computation time
(4)Minimize processing time of each ticket. In this assignment problem we have to assign problem ticket to that expert who have maximum matching degree with ticket and take minimum makespan (time) to solve the problem and minimum processing time of ticket.
(Use a-star algorithm) Expert should be modify A-star algorithm according to my requirement or my problem and make red font for modified part of A-star algorithm, I have attached the datasets of problem tickets and my mathematically model in the attachment when you going to implement this model in programming code you should use java programming language,
Compare our proposed A*algorithm with Hungarian Algorithm, Ant Colony Optimization Algorithm, Particle swarm optimization algorithm and our A*Algorithm should be better than these three algorithms
When your writer will write result graphs he should use Pareto front for multi objective optimization problems for each compared algorithm, we can obtain a Pareto front regarding the makesapn and matching degree. Two axises should be makespan and matching degree.
Some of my suggestions are: (1) in terms of tickets: for all tickets, considering the fact that they don't arrive at the same time, so you can set Two queues: one is RECEIVED QUEUE which keeps all received tickets in a period of time (for example, 3min), then (2) for every of these tickets, you can use your A* algorithm to find the shortest path form your initial expert (known) to the final expert (unknown, you can get it by training the history routing paths).
when your writer will be going to write program and report he should be write comments in program code and define every term in more detail for example in A* algorithm f(n)=g(n)+(n) writer should be define the function f and g how it works for our problem.
A star can be used for many optimization algorithms but the realistic performance depends on appropriate g and f function you should design these two function carefully
Writer should be cite related papers in the related work all reference should right and cite more than 30 papers.
Note your writer should explain every term he use in the paper and write comments in java programming code for each function how it works
Thanks