需要帮助最大限度地提高3个因素多，类似的对象和订购适当 [英] Need help maximizing 3 factors in multiple, similar objects and ordering appropriately
问题描述
我需要的，将责令基于3个因素阵列的任何语言编写的算法。我用度假村，例如，（像Hipmunk）。比方说，我想要去度假。我想最便宜的地方，最好的评论，和大部分景点。但是，显然没有办法，我可以找到一个在所有3＃1。
I need to write an algorithm in any language that would order an array based on 3 factors. I use resorts as an example (like Hipmunk). Let's say I want to go on vacation. I want the cheapest spot, with the best reviews, and the most attractions. However, there is obviously no way I can find one that is #1 in all 3.
为例（假设有20个重要景点）：
Example (assuming there are 20 important attractions):
度假胜地：$ 150 /晚......在好评98/100 ... 18 20景点
度假村B：$ 99 /晚......在好评85/100 ...... 12月20日的景点
度假村C：$ 120 /晚......在有利的评论91/100 ...... 20个景点16
Resort A: $150/night...98/100 in favorable reviews...18 of 20 attractions
Resort B: $99/night...85/100 in favorable reviews...12 of 20 attractions
Resort C: $120/night...91/100 in favorable reviews...16 of 20 attractions
度假B相最吸引人的价格，但3日在其他2类。其中，我可以选择的度假胜地下仅$ 21日更一晚，并获得更多的景点和更好的评论。价格仍是对我很重要，但度假胜地具有突出的审查和一吨的景点：为$ 51个值得挥霍
Resort B looks the most appealing in price, but is 3rd in the other 2 categories. Wherein, I can choose resort C for only $21 more a night and get more attractions and better reviews. Price is still important to me, but Resort A has outstanding reviews and a ton of attractions: Is $51 more worth the splurge?
我希望能够以填充列表，将订单从最佳最差（我引用BC它是主观的消费者）点燃。我怎么会去为每个度假村实现价值最大化？
I want to be able to populate a list that will order a lit from "best to worst" (I quote bc it is subjective to the consumer). How would I go about maximizing the value for each resort?
- 我应该把重量为每个因素？（即：55％的价格，30％的评论，15％的设施），并得出了一组号码，并命令他们这样的结果
- 请我需要一个模式，中位数和范围，所有的酒店和确定的平均价格，并有各地的平均价格酒店举行最重？
如果这是一个有点混乱，然后检查www.hipmunk.com。他们有一个飞机排序他们所谓的痛苦（和排序的酒店，这是类似我的问题），他们为自己的使用。我用度假村为例，让我的问题有望使更多一点意义。一个人怎么放的数学到这样一个问题？
If it is a little confusing then check out www.hipmunk.com. They have an airplane sort they call Agony (and a hotel sort which is similar to my question) that they use as their own. I used resorts as an example to make my question hopefully make a little more sense. How does one put math to a problem like this?
推荐答案
那么具有可变的权重，并让用户通过输入一些像杠杆进行调整，以使排序顺序将动态更新？
What about having variable weights, and letting the user adjust it through some input like levers, so that the sort order will be dynamically updated?
这篇关于需要帮助最大限度地提高3个因素多，类似的对象和订购适当的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
