Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Efficient heuristic for non-linear transportation problem on the route with multiple ports

Treść / Zawartość
Warianty tytułu
Języki publikacji
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.
Opis fizyczny
Bibliogr. 16 poz., rys., tab.
  • University of Dubrovnik (Sveučilište u Dubrovniku) Electric Engineering and Computing Department Ćira Carića 4, 20000 Dubrovnik, Hrvatska Tel: 385 20 445-739, Fax: 385 20 435-590 ,
  • 1. Ouorou A., Mahey P., Vial J.Ph.: A Survey of Algorithms for Convex Multi-commodity Flow Problems, Markup Languages, Vol. 46, No. 1,, pp. 126-147, (2000).
  • 2. Castro J., Nabona N.: An Implementation of Linear and Nonlinear Multi-commodity Network Flows, European Journal of Operational Research, Vol. 92, No.1, pp. 37-53, (1996).
  • 3. Fleisher L.: Approximating multi-commodity flow independent of the number of commodities, Siam J. Discrete Math. Vol. 13, No. 4, pp. 505-520, (2000).
  • 4. Fonoberova M., Lozovanu D.: The maximum flow in dynamic networks, Computer Science Journal of Moldova 3(36), pp. 387–396, (2004).
  • 5. Garaix T., Artiques C., Feillet D. & Josselin D.: Vehicle routing problems with alternative paths: An application to on-demand transportation. European Journal of Operational Research. Volume 204, No. 1, pp. 62-75, (2009).
  • 6. Krile S.: Application of the Minimum Cost Flow Problem in Container Shipping, Proc. of 46th ELMAR’ 04 (International Symposium of Electronics in Marine), pp. 466-471, Zadar, (2004).
  • 7. Krile S.: Optimal Voyage Planning in Container Shipping, Proc. of 25th International Conference of Automation in Transportation, Zagreb–Copenhagen, pp. 32Slika 3. Kontingenti tereta koji čekaju na prijevoz - 35, (2005).
  • 8. Krile S.: Logistic Support for Loading/Unloading in Shipping with Multiple Ports / Logistika za ukrcaj i iskrcaj na plovidbi s više luka, Proc of. 31st International Conference of Automation in Transportation (KOREMA), Pula – Milan, pp. 94–97, (2011).
  • 9. Krile S.: Krile M.: Better Profitability of Multi-Stop Flight Routes, Proc. of. International Conference of Automation in Transportation (KOREMA), Zagreb - Wien, pp. 97-100, (2012).
  • 10. Yan S Chen H.C, Chen Y.H, & Lou T.C.: Optimal scheduling models for ferry companies under alliances. Journal of Marine Science and Technology, Vol. 15, No. 1, pp. 53-66, (2007).
  • 11. Yan S. and Chen H.: A scheduling model and a solution algorithm for inter-city bus carriers. Transportation Research Part A: Policy and Practice, Volume 36, No. 9, pp. 805-825, (2002).
  • 12. Yang S, Tang C.H, & Lee M.C.: A flight scheduling model for Taiwan airlines under market competitions. The International Journal of Management and Science. Vol. 35, No. 1, pp. 61-74, (2007).
  • 13. Zangwill I. W.: Minimum Concave Cost Flows in Certain Networks, Management Science, Vol. 14, pp.429-450, (1968).
  • 14. Zenzerovic Z. and Beslic M.: Contribution to the Optimization of the Cargo Transportation Problem, Promet - Traffic - Traffico, Vol. 15, No 1, Portorož, Trieste, Zagreb, pp. 13-17, (2003).
  • 15. Zhang X., Xiea F., Jiab R.: Hybrid Genetic Algorithm for Minimum Saturated Flow in Emergency Network, IJACT: International Journal of Advancements in Computing Technology, Vol. 4, No. 21, pp. 133 ~ 144, (2012).
  • 16. Xiea F., an Jiab R.: Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm, Computers & Industrial Engineering, Vol. 63, No. 4,, pp. 763–778, (2012).
Typ dokumentu
Identyfikator YADDA
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ć.