To code a C++ application utilising Simulated Annealing algorithm
 or 
Post a job like this1259
$$
 Posted:
 Proposals: 2
 Remote
 #683010
 Awarded
Description
Experience Level: Intermediate
General information for the business: code a programm in c++
Description of every module: The goal is to code an application in C++ using the Simulated Annealing algorithme.The problem(the application) is to find a minimal cost solution at the end of the programm.
Description of requirements/functionality: see requirements document in the Excel file.
OS requirements: Windows
Extra notes: In the excel file,you'll find
1/the problem to solve
2/a fast starting method proposition
3/the general SA algorithm chart
4/an algorithm simulation of CPP30 problem
5/an algorithm simulation to determine the initial temperature of the SA
6/an example of the temperature cooling chart
6/the minimal requirements document
In the PDF file "list of numbers",you'll find the three list to which the SA must be applicated.(CPP30,CPP40,CPP50)
Description of every module: The goal is to code an application in C++ using the Simulated Annealing algorithme.The problem(the application) is to find a minimal cost solution at the end of the programm.
Description of requirements/functionality: see requirements document in the Excel file.
OS requirements: Windows
Extra notes: In the excel file,you'll find
1/the problem to solve
2/a fast starting method proposition
3/the general SA algorithm chart
4/an algorithm simulation of CPP30 problem
5/an algorithm simulation to determine the initial temperature of the SA
6/an example of the temperature cooling chart
6/the minimal requirements document
In the PDF file "list of numbers",you'll find the three list to which the SA must be applicated.(CPP30,CPP40,CPP50)
Benoît D.
100% (1)Projects Completed
1
Sellers worked with
1
Jobs awarded
100%
Last project
28 Feb 2015
Guinea
New Proposal
Create an account now and send a proposal now to get this job.
Sign upClarification Board Ask a Question

There are no clarification messages.