Sorry for the slow reply. I was (and I am still) catching up from all the things I left aside while I worked on the "dc2019" project and had some holidays…
I hope this is still relevant.
That is, I would first sort on "number of persons" in the household. Secondly, for small households (1,2,3 persons), households with an older household head should be chosen first, and for large households, households with a young household head should be chosen first.
I would do that with something like this:
# between 0 and 1
- rel_head_age: age_head / age_head.max()
- score: if(num_persons <= 3, num_persons + rel_head_age, num_persons + 1 – rel_head_age)
As for the missings problem, this is probably the result of the high sensibility of the Chenard algorithm to the household sizes. If the large households are not picked quickly, there is a high chance they are not picked at all because at some point more members have ages that we have enough of than members with ages we still want. I honestly don't know what you can do to improve the situation. I have always wanted to implement a better algorithm for this but given my time constraints, I don't think I'll do it in the next 10 years.
Gaëtan
--
You received this message because you are subscribed to the Google Groups "liam2-users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to
liam2-users...@googlegroups.com.
To post to this group, send email to
liam2...@googlegroups.com.
Visit this group at https://groups.google.com/group/liam2-users.
To view this discussion on the web, visit
https://groups.google.com/d/msgid/liam2-users/e3206be8-648a-4d36-a953-37692a4bcc3c%40googlegroups.com.