For the more difficult highlycapacitated problems, exact algorithms can only solve problems involving up to a few hundred decision

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

SUMMARY

 

• In order to advance the state of the art in algorithms for the generalised assignment problem a benchmark set of relatively large test problems is solved and made publically available to others.

• For the more difficult highlycapacitated problems, exact algorithms can only solve problems involving up to a few hundred decision variables before the search trees g r o w prohibitively large.

• Since we solve the GAP as a minimisation problem, we changed the sign of the costs in the original data such that all costs become negative and the problems are solved as minimisation problems.

• For the 24 'large-size' problems the optimal solutions are not known, except for type A problems for which we were able to obtain the optimal solutions by using the CPLEX general purpose mixed integer solver.

• In Table 3, we compare the performance of our GA heuristic with other existing heuristic algorithms in terms of the average percentage deviation for each problem set, the average percentage deviation for all problems, the average percentage deviation of the best solutions and the number of optimal solutions obtained for each of the 12 'small-sized' problem sets.

 

 

 

 

 

 

 

In order to advance the state of the art in algorithms for the generalised assignment problem a benchmark set of relatively large test problems is solved and made publically available to others.

 

For the more difficult highlycapacitated problems, exact algorithms can only solve problems involving up to a few hundred decision variables before the search trees g r o w prohibitively large.

 

For each problem type, we generate one problem for each agent/job combination, giving a total of 24 problems.

 

Since we solve the GAP as a minimisation problem, we changed the sign of the costs in the original data such that all costs become negative and the problems are solved as minimisation problems.

 

For the 24 'large-size' problems the optimal solutions are not known, except for type A problems for which we were able to obtain the optimal solutions by using the CPLEX general purpose mixed integer solver.

 

For the Type D problems in particular, the average number of non-duplicate children generated is approximately 3 10 6 before termination, indicating that the solution quality in Type D improves more slowly during the course of a trial than in A genetic algorithm for the generalised assignment problem 23 the other problem types.

 

In Table 3, we compare the performance of our GA heuristic with other existing heuristic algorithms in terms of the average percentage deviation for each problem set, the average percentage deviation for all problems, the average percentage deviation of the best solutions and the number of optimal solutions obtained for each of the 12 'small-sized' problem sets.

 

Attachments:

Related Questions

. The fundamental operations of create, read, update, and delete (CRUD) in either Python or Java

CS 340 Milestone One Guidelines and Rubric  Overview: For this assignment, you will implement the fundamental operations of create, read, update,

. Develop a program to emulate a purchase transaction at a retail store. This  program will have two classes, a LineItem class and a Transaction class

Retail Transaction Programming Project  Project Requirements:  Develop a program to emulate a purchase transaction at a retail store. This

. The following program contains five errors. Identify the errors and fix them

7COM1028   Secure Systems Programming   Referral Coursework: Secure

. Accepts the following from a user: Item Name Item Quantity Item Price Allows the user to create a file to store the sales receipt contents

Create a GUI program that:Accepts the following from a user:Item NameItem QuantityItem PriceAllows the user to create a file to store the sales receip

. The final project will encompass developing a web service using a software stack and implementing an industry-standard interface. Regardless of whether you choose to pursue application development goals as a pure developer or as a software engineer

CS 340 Final Project Guidelines and Rubric  Overview The final project will encompass developing a web service using a software stack and impleme