Optimalization task

Hi all,

I've troubles solving this task:

INPUT:
File with airplanes specifications:
- name of airplane
- cost for rental/day
- consumption - $/day
- speed
- range of flight
- consumption of start
- consumption of landing
- recovery time
- load capacity

Network of airports:
- distance between each two of them
- limitation on weight of airplanes which can land here
- airport fee
- initial placement of airplanes on the airports

File of orders:
- from when, from where
- until when, to where
- how many we will get paid
- weight of cargo

TASK:
Find the best possible plan of transport - to maximalise our profit.

Does anybody have any idea?

Thank you.

What are specific troubles? It's a bit tangled basically simple problem...

Quote:

---

Originally Posted by RoboTact

What are specific troubles? It's a bit tangled basically simple problem...

---

There are so many dependencies that I don't know what I should start with, which heuristics to use...

It's linear programming optimization problem. Note that all given limitations are just linear inequalities imposed on a number of cost/time variables. You need only to create a system containing all those limitations and solve optimization problem, maximizing profit.

Quote:

---

Originally Posted by RoboTact

It's linear programming optimization problem. Note that all given limitations are just linear inequalities imposed on a number of cost/time variables. You need only to create a system containing all those limitations and solve optimization problem, maximizing profit.

---

I was said it doesn't have optimal solution and best is to use some heuristics, maybe let's say 3 levels of prediction and always choose the best way. I don't think there is some easy way to construct system of inequations for linear programming task and whether it would even help...

think this might be more than a linear programming problem given the
the takeoff and landing fees. nonetheless - set up a list of
tasks (moveing frewight from one destination to another) at each airport.

whenever a choice exists beween planes to do a task sompute all possibilities and pick the cheapest.

whenever a plane finds itself at an airport with no task add the cost of going to an airport that needs a task to the task. etc.

i think the point is just get a simple strategy on how to deal with lists of tasks and plane locations. use your imagination.

j