freenode/#lisp - IRC Chatlog
Search
21:22:19
jmercouris
of course the packing strategies will be functions, so to be able to mutate them with each other (as code), would be interesting, instead of just tweaking the args passed to some function
21:22:22
jeosol
Ok, you may also thinking about GP -- genetic programming, it is one form that can evolve strategies and new insights
21:25:10
jmercouris
I am writing survey software first, to determine if anyone actually would want this product
21:25:26
jeosol
I came to lisp the first time because of GA I was trying to convert to C++ at the time.
21:26:40
jeosol
the solutions for GP problems are not always clear but when you see the results, you will have the aha moment, like yeah, that makes sense
21:27:05
jmercouris
Yeah, I have no illusions that it will just magically work, I just thought this might be an interesting way to iterate an algorithm
21:27:35
jeosol
Yes, the keys are the objective function and how the variables/features are parameterized
21:28:30
jmercouris
I'm not sure if he would like me to share what he does, you may ask him yourself
21:30:57
jmercouris
but when I started trying to write an algorithm I realized the amount of permutations I would have to test
21:31:08
jmercouris
so I started thinking about greedy algorithms, and even those were way too heavy
21:34:21
jeosol
I will have to get more info regarding your problem, otherwise, a straightforward GA may get you sth albeit limited and can be used to glean more insights
21:35:32
jeosol
I wanted to see that you meant by permutations. For a greedy method, you will need to test many combinations.
21:37:11
jeosol
they are global algorithms and you won't need to test many combinations. As long as each feature's limits are known, e.g., (bounds for continuous variables, number of possibilities for discrete values, ...) it's fine
21:38:00
jmercouris
the complete domain space is this: what is the cheapest way to combine shipping products, and parcels to deliver them somewhere
21:38:22
jmercouris
e.g. if I have 3 parcels to ship, perhaps I should ship two of them grouped together with some USPS product, and the last one with some UPS product to ship it most cheaply somewhere
21:38:46
jmercouris
so I have to solve several problems,how to combine packages together, and how to combine products together
21:39:19
jmercouris
furthermore, for many products, the prices are not discrete, but rather continuous
21:40:06
jeosol
hahaha. But the products are bounded, those are discrete or integer. prices can be encoded as continuous to say 2 decimal places (cents)
21:40:30
jeosol
The algorithm will figure out that combination and permutations, that is what it does.
21:40:56
jmercouris
especially when the products and rules surrounding products are chaning all the time
21:41:07
jmercouris
which is why I was thinking about some generalized solution that can be more easily adapted and understood
21:41:52
jeosol
I think you will have to solve the problem with fixed static inputs, and later make the interface general enough to actually run the GA runs in parallel given new instance values
21:43:33
jeosol
What I mean is that for the GA to run effectively F(X) must not be stochastic for the same X (it can still perform well if things change though).
21:44:28
jeosol
so I mean, first ignore the fact that things are changing, then solve a fixed instance (products and prices), then generalize
21:46:02
jmercouris
though, depending on the results of my survey, maybe nobody cares about shipping cost
21:46:16
jmercouris
maybe they care about box inventory, how many boxes of what types they need to keep
21:47:30
jeosol
cool, will be interested to see what the survey says, but the problem is actually multiobjective, then we are heading into the territory of pareto solutions,
21:51:10
jmercouris
if they are shipping more than one item, perhaps it is only large companies like amazon, in which case, their integration costs would be astronomical
0:24:39
jason_m
I am working on a system and had a compile time error in one of my source files. When I quickload (asdf load) the system, I land in the debugger with a condition of type UIOP/LISP-BUILD:COMPILE-FILE-ERROR.
0:24:41
jason_m
I know I can look at the error in the inspector, but I don't see the actual underlying compile error.
0:27:55
jason_m
If I compile and load the particular file, I get a SB-INT:COMPILED-PROGRAM-ERROR which better directs me to the problem, but to get it, I abort from the debugger, open the file, and load that (or sometimes C-c C-c form by form) to get the more specific message.
3:23:34
beach
Showing specbot replies publicly is useful mostly to tell other people where to look, or to ask people for help on an entry.
4:41:24
oleo
(defun push-in (list) (let ((result))(dolist (x list (nreverse result)) (cond (t (push (list x) result))))))
6:15:39
flip214
jasom: don't you see the error message in the REPL output, along with the QL output?
8:30:04
akr
Hello, I'm printing out an argument to my function to figure out what it is, and all I'm getting is "[object Object]"
8:58:33
jdz
akr: no, I mean something that a JavaScript implementation (e.g., browser) would write to the console when an object is converted to a string instead of writing the object itself.
9:01:35
jdz
akr: also, instead of printing the value, you can use BREAK, and the inspector to inspect it.