Consider the 0-1 knapsack problem, in which we are given a set of n objects
(w[i], b[i]), where w[i] and b[i] are the weight and prot of object i respectively, and
knapsack limit W. Design a random walk local search algorithm and give the pseudo
code description.
For the Traveling Salesman Problem (TSP),
define heuristic function, design a backtracking algorithm in which the search
process is guided by the heuristic function, and give the pseudo code description.
(b) one local search strategy is: start with any complete tour, perform pairwise ex-
changes at each step. Give the pseudo code description of a hill climbing algorithm
using this strategy.
I have extensive knowledge about various optimization algorithms and am able to come up with original solutions. I happen to be a two times IOI medalist.
$55 USD w 2 dni
0,0 (0 opinii)
0,0
0,0
6 freelancerzy składają oferty o średniej wysokości $128 USD dla tej pracy
Hi Sir,
I am ready to work for you.I have 9 years of experience in C/C++ , java, PHPand, MySQL. please see some of my works also check my reviews you will get better idea about my skill.I deliver quality work within time frame. Please visit my profile once.
Thanks with regards,
Amit
Hello
I am a java programmer. My research area is about combinatorial algorithms so knapsack and tsp are very familiar to me. I also know the random walk local search algorithm and backtracking. I am ready to start
Hi,
I am expert in Data Structures and Algorithms and Intelligent Systems.
I have implemented Knapsack problem solving Algorithms and TSP Heuristics before.
I can do this task for you.
Thank you.
------------I am expert in this field . I will provide you 100% satisfaction .My aim is satisfaction .For previous work sample discuss
project with me ....Many Thanks me in advanced for considering my bid ----------------