Show Bid Request
Solve Travelling sales Person problem using Dynamic Programming.
Bid Request Id: 9674
|
|
|
|
Posted by: |
buyerforcode (2 ratings)
(Software buyer rating 10 )
|
|
Non-action Ratio: |
Very Good - 0.00%
|
|
Posted: |
Feb 26, 2002
9:26:03 PM EDT
|
|
Bidding Closes: |
Mar 1, 2002
9:30:17 PM EDT
|
|
Viewed (by coders): |
471 times
|
|
Deadline: |
3/3/2002
TIME EXPIRED
|
|
|
|
|
Description:
TOPIC: Can we solve any size TSP (Travelling Sales Person) problems using DYNAMIC PROGRAMMING?
GOAL IS TO PRACTICE DYNAMIC PROGRAMMING APROACH BY SOLVING THE TRAVELLING SALES PERSON PROBLEM. WE WILL EXPERIENCE THE TIME AND THE SPACE REQUIRED BY THE ALGORITHM WITH THE INCREASING PROBLEM SIZE. HERE IS WHAT WE NEED TO DO:
1. READ THE ATTACHED TSP NOTES, SECTION 5.6 AND 5.7 .
2. DEVELOP THE ALGORITHM WITH TWO PROGRAMS, ONE WITH “OP-DOWN WAY” AND THE OTHER WITH “MEMORY FUNCTION”.
3. RUN THE TWO PROGRAMS ON A GIVEN 100-CITY EXAMPLE FOR MULTIPLE ITEMS (file attached).
- START WITH ONLY FIRST FIVE CITIES. RECORD THE RESULT, TIME, AND SPACE CONSUMED. COMPARE THE RESULTS.
- RE-RUN THE PROGRAM BY INCREASING THE PROLEM SIZE BY A FEW CITIES EACH TIME.
- REPEAT THE PROCESS UNTIL THE COMPUTER CANNOT TOLERATE EITHER THE TIME OR THE SACE (IT&'S UPTO YOU WHEN TO STOP INCREASING THE SIZE n).
- PRESENT THE RESULTS IN THE WAY SIMILAR T TABLE 5.6.1 (INCLUDING GRAPHIC REPRESENTATION: time vs. size and space vs. size).
4. USE ANY OF THE PROGRAMMING LANGUAGES C, C++ or JAVA. Provide source as well as executable code.
5. PROVIDE DESCRIPTION OF HOW TO RUN THE PROGRAM, ROGRAM ORGANIZATION, DATA STRUCTURE, DESCRIPTION OF SOFTWARE MODULES USED.
Required Files attached.
Deliverables:
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
USE ANY OF THE PROGRAMMING LANGUAGES C, C++ or JAVA. Provide source as well as executable code.
PROVIDE DESCRIPTION OF
- HOW TO RUN THE PROGRAM,
- PROGRAM ORGANIZATION,
- DATA STRUCTURE,
- DESCRIPTION OF SOFTWARE MODULES USED.
Platform:
WINDOWS 95/98 / NT.
Must be 100% finished and received by buyer on:
Mar 3, 2002 EDT
Deadline legal notes: All times are expressed in the time zone of the site EDT (UT - 5). If the buyer omitted a time, then the deadline is 11:59:59 PM EDT on the indicated date.
Special Conditions / Other:
READY TO PAY 10% PREMIUM IF CAN BE SUPPLIED BY SATURDAY MARCH 2, NOON.
Additional Files:
This bid request includes IMPORTANT additional attached files. Please download and read fully before bidding.
Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements.
We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation.
If you notice a violation please help out the site and report it. Thanks for your help.
|
|
|
Bidding/Comments:
|
All monetary amounts on the site are in United States dollars.
Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. |
See all rejected bids (and all comments)
| Name |
Bid Amount
|
Date |
Coder Rating |
|
|
|
|
$50 (USD)
|
Feb 27, 2002
2:52:48 AM EDT
|
9.95
(Excellent)
|
|
|
| Dear sir,
I can make this project ( actualy I make 70% of it ).
I have sent you a exe that resolve first program.
It reads a file tsp.dat ( that you send ) and ask for n.
Take care that I don't make any verification, if you give 2000, that for that n it tries to solve.
From when you select me, you will have all sources in one hour.
Marius.
p.s. if you think that is to much money, and you want program anyway, please tell me your resonable price, ... I don't want to work for nothing... |
|
|
Attached File
|
|
|
|
This bid was accepted by the buyer!
|
$30 (USD)
|
Feb 27, 2002
8:24:25 AM EDT
|
9.95
(Excellent)
|
|
|
| Hello,
Ok, I will do it for 30$, but I would wish to give it to me today ( no later than tomorow ) so I can get money before 28.feb.2002 23:59 ( in this way I will get them this month, not next )
No input verification, mean that at version that I send, program ask a value n, a values lower than 0 would not be correct, so if you write -1, program would want to run algorithm with n = -1 and would run wrong.
If you would put a value bigger than 2, program would run perfectly.
I will provide all documentation, ( in the way that is request in you zip ).
All th best,
Marius.
|
|
|
|
|
|
|
Smart Pin