求解！！

mimigo 2010-08-16 12:54:00

下图是一个仓库的示意图。

Y
A10 B10 C10 D10 E10 F10
A9 B9 C9 D9 E9 F9
A8 B8 C8 D8 E8 F8
A7 B7 C7 D7 E7 F7
A6 B6 X C6 D6 E6 F6
A5 B5 C5 D5 E5 F5
A4 B4 C4 D4 E4 F4
A3 B3 C3 D3 E3 F3
A2 B2 C2 D2 E2 F2

A1 B1 C1 D1 E1 F1

P1 P2 P3 Z

1. 黄色区域（A,B,C,D,E，F)全是黄色区域）是存储商品的储位，每个储位都有自己的编号，如A1，A2，B2，….。每个储位中存放着不同的商品。
2. 蓝色区域P1/P2/P3 是仓库工作人员工作站。
3. 白色区域是空白区域。
4. 仓库工作人员只可以自由行走在白色区域与蓝色区域之间，但是仓库工作人员不能跨越任何黄色区域。
5. 仓库工作人员从储位中捡出商品时,只能站立在储位旁边的空白位置。例如工作人员站在图中的X位置可以捡取存放在C6与B6的商品。注意：工作人员不能在储位的上下方捡取任何商品，例如图中的Y或Z。

现在仓库工作人员有5个不同的商品需要捡出。仓库工作人员可能会从P1/P2/P3任何一个工作站出发，捡出商品后再返回起始工作站。

请编写程序完成以下任务：

1. Create a database of 60 products, assign each a stock level and a unique Bin location from the range A1 – F10 (see warehouse floorplan).

2. Provide a method for querying a product/bin location which returns the product description, bin location and current stock level.

3. Provide a method for creating an order. An order will always consist of 5 different products chosen by the user.

4. If there is insufficient stock available to fulfil the order display a warning message, otherwise decrease the relevant stock levels and calculate/display the optimum picking route.

The optimum picking route must start from one of the pick stations (P1, P2, P3), and is the shortest number of steps needed to 'pick' all of the products before returning to the original pick station.

5. The picking route, including the chosen starting pick station would usually be included on the pick sheet so it must be displayed in a way easily interpreted by the picker.

6. The user interface must be web based.

7. Write a short paragraph about the scalability of your solution, i.e. How would the implementation handle a much bigger warehouse?

8. An object oriented approach must be demonstrated.

...全文