Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
w słowach kluczowych:  non-linear transportation problem
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
The routing problem of small island ports is, in many cases, firmly dependent on country topology, e.g., how to connect islands with a main (home) port, where the order of stops can be different, especially if there are not enough passengers or cargo waiting to be transported to or from every port. Thus, we need a capable optimization tool with which we can adapt each route for an appropriate time schedule; for example, some routes in one cycle can touch each island (forwards or backwards) but some routes can be incomplete, to touch only a few of them. The carrier has to find space for price-cutting (lower prices per journey – more passengers on board), to be more attractive in free-market competition. In such route optimization, we have to interconnect minimal transport cost with maximal revenue (money from tickets), which could be a very demanding task (a non-linear objective cost function). Instead of a non-linear polynomial optimization, which can be very complicated and time-consuming, the network optimization methodology could be efficiently applied. The main goal is to find more efficient routes, to decrease expenses and to increase revenue at the same time (dual mini/max problem).
We need a better transport planning tool for loading maximization and transport cost minimization on the voyage route with multiple loading/unloading (discharging) ports. The implemented heuristic algorithm is able to find out an appropriate routing sequence with maximal earnings and profit. In the same time it looks for minimal loading/discharging and transshipment costs, but with fulfillment of cargo demands in a number of ports on the route. The efficient algorithm for optimal transport of N cargo loads (e.g. contingent of containers) for ships with limited capacity is being developed. This efficient tool may significantly reduce transport costs and ensure maximal profit to freight forwarders. Also, it can be applied for supply chain management of different goods from numerous vendors. The proposed algorithm shows acceptable complexity that means that such optimization tool can be used in shipping supported with limited computing power.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.