|
One throws the items into a box, specifies the dimensions of the box (customer packaging - if one want any applicable discount), weighs the box, selects a shipping option (ground; 2-day; etc.) and prints and attaches a label. Note that many carriers supply "standard size boxes" that are priced based on size, not weight (up to say a 70 lb max).
Seems the challenge is to have all items to be shipped to a given customer collected ("picked") at the same time for shipping; not what box it may fit in (which may need extra "packing" for fragile items). The shipped boxes I receive tend to be much larger than their actually contents.
(I currently program self-service shipping kiosks).
|
|
|
|
|
I under stand that. But I can't customers to standardize on boxes. I've been trying for 7 years now.
It would be easier to get the customer to commit to purchasing boxes in certain sizes, and then I just calculate which boxes I need.
Now this is a calculator for determining the ship rate before the customer makes a purchase.
I'm going to take the code and turn it into a console app, with some fake data, so folks that are interested can play with it.
|
|
|
|
|
I created a console app if you want to play with it, it's a VS2015 project with all the code that I wrote for it.
it has data or shopping cart items that you can load, and will output the results to the screen
So this is for my old program Internet Commerce Engine 5 written in VB
I have a new program called project Indigo written in MVC C# that I will port this over in Sept 2016
So sorry about it being in VB. But the concept should be the same.
DropBox that you can download the project, now its the folder.
I fixed the console output and worked on Package_C1
Dropbox - Code Project[^]
Preview of Project Indigo Shopping, not much there yet
Project Indigo! - Home Page[^]
Project Indigo! - Browse[^]
I could use help with the Navigation Bar in the shopping section, much harder than I thought to construct using Bootstrap.
modified 5-Aug-16 17:04pm.
|
|
|
|
|
Thanks! I was looking this info
|
|
|
|
|
Well I'm still working on it!, but taking a break on it today.
It needs improvement on the Common items, and a better way to arrange the items.
I'm thinking aspect ratios today, to treat each item by aspect ratio or shape, to determine how to stack them, then take a measurement of the dimensional weight.
|
|
|
|
|
Hello.
I'm making a racing game. I've been messing around with numbers and stuff to make a script for simulating car engine temp which weather temperature, weather humidity, the power of radiator, Engine output and engine oil play a role in increasing/decreasing the temp.
For the wheels, only weather temp and humidity, Wheel air pressure and engine power is needed (I guess).
I just can't make an accurate one. Would be happy if someone suggests an algorithm to simulate car heat temperature.
Remember that it is only a game, not a military-grade advanced simulation software  .
|
|
|
|
|
Apparently using Nitrogen in the tires is a factor...
Engine temp increases with loss of oil pressure / oil volume
Engine temp increases with engine RPM
Ambient temp increases engine temp
Humidity affects air density which decreases combustibility which affects engine power causing more work and more heat (?)
Bigger / better radiators allow for running at (what would be) a higher temperature
|
|
|
|
|
Not any help here
But turning raises tire heat.
Radius of the turn, plus speed increases heat. Steering wheel marked in degrees, say 270 indicates a sharp left turn.
Front or rear wheel drive? A sharp left turn on front wheel drive will raise the right front tire temp, then the left rear tire temp. vice versus for rear wheel drive.
Track temp, asphalt gets very hot and tacky in the sun, cold and slippery in the rain or ice.
Tire type, summer tire vs winter tire. Summer tires run hotter.
Tire pressure, more is cooler, less is hotter. Just like water which boils at 212F at sea level, you can increase the pressure and raise the boil point like the coolant system of a car.
|
|
|
|
|
Am currently working on a project relating to quantum cryptography
|
|
|
|
|
|
I don't think that you could find a source code for QKD.. There is only some general info and schemes..Well it seems to me so.
|
|
|
|
|
Hi,
I tried your code to protect PDF file.
I registered the DLL : ProtectPDF and added it's reference to Excel VBA.
But when I am trying to run the code I am getting the error 'ActiveX component can't create object'
Please help!
Thank you!
|
|
|
|
|
Member 12611971 wrote: I tried your code
Presumably you are talking about some article here on CodeProject. If so, then you need to post your question in the forum at the end of the article.
|
|
|
|
|
I would also like to point out that we are volunteers; it is not urgent here.
Bastard Programmer from Hell 
If you can't read my code, try converting it here[^]
|
|
|
|
|
Is there any algorithm to map these two fields
if n = 5
field 1 Field 2
1 (1)
2 (1,2)
3 (1,2,3)
4 (1,2,3,4)
5 (1,2,3,4,5)
6 (2)
7 (2,3)
8 (2,3,4)
9 (2,3,4,5)
10 (3)
11 (3,4)
12 (3,4,5)
13 (4)
14 (4,5)
15 (5)
I want a function which can give the second field as output for input of first field .
Expect to have a simple mathematical algorithm.
Please help me with this problem.
hint: 1 | 2 | 3 | 4 | 5
* * * * *
* * * *
* * *
* *
*
|
|
|
|
|
Probably homework, solvable with a couple of loops.
|
|
|
|
|
Thank you. Looking forward to have the answer.. 
|
|
|
|
|
We look forward to you coming up with the answer. You've had the hint on how to solve it. Think about how loops work and you should get the solution.
This space for rent
|
|
|
|
|
I'm trying figure out the best way to distort given image on chess-boarded mask.
http://i.stack.imgur.com/NRoWt.jpg[^]
Both have the same aspect ratio. Theoretically, I could calculate square edges and build a grid of points. And after, extrapolate each pattern pixel to approximate destination on mask based on parent square edges.
But maybe there is more elegant way to do it? With openCV or anything of computer vision algorithms?
|
|
|
|
|
I have n points in the plane and I need to find a pair of concentric circles such that all the points lie between the cicels and the area between the cicels is minimal.
I have an O(n^2) algorithm but it seems that it's possible to improve.
|
|
|
|
|
If you would share your algorithms, someone may have an opinion/idea about it...
Skipper: We'll fix it.
Alex: Fix it? How you gonna fix this?
Skipper: Grit, spit and a whole lotta duct tape.
|
|
|
|
|
How did you even do it? The best I could do so far is using this QCQP
minimize 2 d r + d^2
s.t.
d >= 0
r >= 0
for each point x,y:
(x-cx)^2 + (y-cy)^2 >= r
(x-cx)^2 + (y-cy)^2 <= r+d
The point constraints work out to something like cx^2 + cy^2 - 2xcx - 2ycy - r + x^2 + y^2 >= 0 (with all the squared terms on the left, linear variables in the middle and finally some constants). The square terms are all non-negative so the matrixes that define them are positive semi-definite, so it can be solved with SDP.
|
|
|
|
|
Hey im having trouble in finishing this algo:
A robot engine warms up with his trip and cooled down by a fan.
The robot required to ensure that the engine is not overheating.
Given that the temperature versus time engine is
1.2t=Tm
Temperature of the enviroment is 15=Te
Constant k=0.8
It i1s known that the rate of the cooling is define by
dT/dt = -k(T-Te)+Tm
Also known that the speed of the robot is 25m/s And the starting temparture of the engine is 35.
We need to find the Differential Equations for the road founded in the last question for Each Δt=0.1
This is the answers that i dont know how to get to.
temp is:
Time Temp[degC]
0.0 35.00
0.0 33.40
0.1 31.94
0.2 30.61
0.3 29.40
0.4 28.29
0.5 27.29
0.6 26.38
0.7 25.55
0.8 24.80
0.9 24.13
1.0 23.52
And when its getting warmer:
2.7 19.44
2.8 19.42
2.9 19.42
3.0 19.42
3.1 19.44
3.2 19.47
3.3 19.51
3.4 19.56
3.5 19.61
3.6 19.68
3.7 19.75
And the Path from the last question:
0 0
24 11
7 34
78 196
218 308
289 461
344 412
380 451
516 451
543 554
605 591
600 600
Thank you alot in advence!
|
|
|
|
|
|
============ REPEAT QUESTION FROM C# FORUM
Hello there. We take the example of Bubble Sort Algo.
Time Complexity
Best O(n)
Worst O(n^2)
Space Complexity
Worst O(1)
Let us suppose a simple array contains 25 elements. What does above information mean and how should I visualize it?? Thanks for clearing some basics.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
