Q3.23 PointsDevise also a local search heuristic for the assignment problem. Use the approach known asiterative improvement. The operation of the approach depends on (a) solution representationand (b) the definition of the neighbourhood. Specify these.Illustrate the described approach assuming that initiallyjob 1 is assigned to person ajob 2 is assigned to person b.job 3 is assigned to person C,job 4 is assigned to person d.Perform one transition from a current solution to a new one, if there is a neighbour that can beaccepted. Do not perform further iterations.Type your answer in the field below using LaTeX formatting $$..$$ for mathematicsEnter your answer hereor upload a pdf file (no rotation)Please select file(s) Select file(s)Save AnswerQ3.32 PointsIs it justified to use local search for the assignment problem? What is the complexity status ofthe problem?Type your answer in the field below using LaTeX formatting $$..$$ for mathematicsEnter your answer hereSave Answer Q37 PointsConsider the classical assignment problem: n jobs should be assigned to 12 people, one job perperson. For each combination of a person and a job, the cost of assignment is given:person aperson bperson cperson dQ3.12 Pointsjob 120Enter your answer here65Save Answer5job 22or upload a pdf file (no rotation)Please select file(s) Select file(s)S810job 3The task is to assign jobs to persons minimising the total cost.7310job 4820Devise one construction heuristic for this problem and apply it to the above data. In youranswer, provide a brief description of the heuristic, specify the solution found for the aboveinstance and the objective value.8Type your answer in the field below using LaTeX formatting $$....$$ for mathematics6

Solution to task Assignment Problem : Person 'a' do Job2: 3 Person 'b' do Job1: 6 Person 'c' do…

Consider the classical assignment problem: n jobs should be assigned to 12 people, one job per person. For each combination of a person and a job, the cost of assignment is given: person a person b person c job 1 20 9 1 job 2 2 4 00 job 3 7 3 job 4 8 20 00

Consider the classical assignment problem: n jobs should be assigned to 12 people, one job per person. For each combination of a person and a job, the cost of assignment is given: person a person b person c job 1 20 9 1 job 2 2 4 00 job 3 7 3 job 4 8 20 00

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

The public utilities commission has decided that the electric company overcharged its customers for two months last year. To make up the difference to the customers, the commission orders the company to decrease each of the next month’s bills by 10%. The city also levies a 3%utility tax, which is to be applied to the bill before it is discounted. Also, the10% discount does not apply to the utility tax. Assume electricity costs $0.16per kilowatt-hour. Write a program to compute the next month’s electricity bill given the number of kilowatt-hours consumed as input
Employees of KB and SONS Consultants Limited are paid at an hourly basics of 25GHS per an hour for regular hours and 1.5 times per hour for overtime hours in a week. Any hour worked over 40 hours per week is overtime. The following national tax sliding scale is then applied to determine the amount of tax to be paid by an employee. GrossWage Tax Rate (%) First 125 0 Next 125 5 Next 1500 10 Next 2750 15 Next 1250 20 Excess over 5000 30 In addition 6% of an employee’s gross wage is withheld for Social Security, 3% is withheld as constituency tax and 20GHS is withheld by the employer as welfare contribution. If an employee has more than 3 dependants then an amount of 5GHS for each dependant in excess of three towards NHIS. You are required to write a program that compute a workers gross pay, the deductions and his/her net pay. Your program should allow details of the staff to be accept /input into the system for the necessary computations. Try using comments in explaining the flow of the…
2 To 000 Total = 0 TL 1 001 Total = 0.5 TL 1 010 Total = 1 TL A Coca-Cola vending machine can accept coins of value 0.5 TL (Turkish Lira) and 1 TL. The door (output hole) of the vending machine is released (i.e. a Coca-Cola can is dropped/sold) when the amount of money received is equal to or greater than 2.5 TL. Assume that the machine accepts one coin at a time. Also assume that the machine goes to the initial state after releasing the door. Complete the given ASM chart according to the above description. Hint: = 1 iff a coin of value 0.5 TL is input to the machine. input signal x input signal y = 1 iff a coin of value 1 TL is input to the machine.
Q1 Dan has a list of problems suitable for the assignment. The difficulties of these problems are stored in a list of integers a. The i-th problem’s difficulty is represented by a[i] (the higher the integer, the more difficult the problem). Dan is too busy eating saltines to worry about assignment decisions, so he asks Michael to select at least two problems from the list for the assignment. Since there are many possible subsets of the problems to consider and Michael has a life, he decides to consider only sublists (definition follows) of the list of problems. To make grading the assignment easier, Michael wants to pick problems that don’t vary too much in difficulty. What is the smallest difference between the difficulties of the most difficult selected problem and the least difficult selected problem he can achieve by selecting a sublist of length at least 2 of the original list of problems? Definition: A sublist of a list a is any list you can obtain by removing some (possibly 0)…
Rod cutting problem: A cutting factory buys long steel rods and then and cuts them into shorter rods, which it then sells. Each cut is free. The selling price is based on the length of the cut. The factory want to determine the best cuts in order to maximize its revenue. Below, the price that the factory can make for each length of rod is given. Determine the maximum revenue, rn, obtainable by cutting up the rod and selling the pieces using bottom-up dynamic-programming approach. Length, I 1 2 3 4 5 6 7 Price, pi 2 4 5 6 9 10 12 r5 = ?