Bir Lojistik Köyde Yatay Taşıma Araçlarına İş Emirlerinin Atanması ve Çizelgelenmesi

Son yıllarda artan uluslararası ticaretin etkisiyle konteyner taşımacılığı oldukça önem kazanmıştır. Konteyner ile taşınan yükler; zaman, maliyet ve diğer kriterler altında deniz yolu, tren yolu ve karayolu modlarından herhangi birini veya bu modların bir bileşimini (tümleşik taşımacılık) kullanabilirler. Lojistik köyler, konteynerlerle taşınan yüklerin taşıma modunu değiştirdiği ve gerektiğinde geçici depolama sahası olarak kullanılabilen konteyner terminalleri olarak tanımlanabilir. Konteynerlar her hangi bir taşıma modundan gelip lojistik köye ulaşmakta, terminal sahasındaki donanımlar ile elleçlenerek müşterinin teslimat tarihine kadar ya da bir sonraki taşıma modu ile hareket edene kadar bekletilmektedir. Sonrasında yine herhangi bir taşıma modu ile yoluna devam etmektedir. Bu çalışmada bir lojistik köyde yatay taşıma yapan araçlara iş emirlerinin atanması ve çizelgelenmesi problemi ele alınmıştır. Bu problem için öncelikle yatay taşıma araçlarının gereksiz yaptığı taşıma hareketlerini en aza indirme amaçlı bir tamsayılı programlama modeli geliştirilmiştir. Sonrasında, özellikle büyük boyutlu problemlere hızlı ve pratik çözümler sunabilecek şekilde problem temelli bir çözüm algoritması geliştirilmiştir. Önerilen tamsayılı programlama modeli ile sezgisel algoritmanın performansları, türetilen farklı büyüklükteki test problemleri üzeründen değerlendirilmiştir ve tartışılmıştır.

Allocation and Scheduling of Work Orders for Trucks at a Freight Village

In the last years, with growing of international trade, container transportation has become quite important. The freight transported with containers may use either one of the transportation modes of maritime, railways or roadways or a combination of these modes (intermodal transportation) subject to some criteria on time, cost etc. A freight village can be defined as a container terminal in which, a freight transported with a container changes its transportation mode and/or (if necessary) is temporarily stored. Containers may arrive at a freight village with any transportation mode. Containers are then handled with the equipment in the terminal area and subsequently stored until the due date of the customer or until it begins to move with its following transportation mode. Then, it follows its assigned route with the necessary mode. In this study, the trucks that execute horizontal transportations at a freight village are considered. The work orders created in the village should be assigned to these trucks and the sequencing of work orders for each truck should be determined. For this problem, first, an integer programming model with the aim of minimizing the total redundant distances made by the trucks, is developed. Secondly, especially for providing fast and practical solutions to large-sized problems, a problem-based heuristic algorithm is proposed. Through a set of different problem instances, the performances of the integer programming model and the heuristic algorithm are evaluated and discussed.

___

  • [1] Aydın, G. T.; Öğüt, K. S. Lojistik Köy Nedir?. http://web.itu.edu.tr/oguts/Lojistik%20K%F6y%20Ned ir.PDF. 2011
  • [2] Carlo, H. J.; Vis, I. F.; Roodbergen, K. J. Storage yard operations in container terminals: Literature overview, trends, and research directions. European Journal of Operational Research. 2014a; 235(2), 412-430.
  • [3] Vis, I. F.; De Koster, R. Transshipment of containers at a container terminal: An overview. European Journal of Operational Research. 2003; 147(1), 1-16.
  • [4] Steenken, D.; Vob, S.; Stahlbock, R. Container terminal operation and operations research - a classification and literature review. OR Spectrum. 2004; 26, 3-49.
  • [5] StahlBok, R; Vob, S. Operations research at container terminals: a literature update. OR Spectrum. 2008; 30, 1- 52.
  • [6] Carlo, H. J.; Vis, I. F.; Roodbergen, K. J. Transport operations in container terminals: Literature overview, trends, research directions and classification scheme. European Journal of Operational Research. 2014b; 236(1), 1-13.
  • [7] Steenken, D.; Henning, A.; Freigang, S.; Voß, S. Routing of straddle carriers at a container terminal with the special aspect of internal moves. Operations-ResearchSpektrum. 1993; 15(3), 167-172.
  • [8] Kim, K. H.; Kim, K. Y. Routing straddle carriers for the loading operation of containers using a beam search algorithm. Computers & Industrial Engineering. 1999a; 36(1), 109-136.
  • [9] Kim, K. Y.; Kim, K. H. A routing algorithm for a single straddle carrier to load export containers onto a containership. International Journal of Production Economics. 1999b; 59(1), 425-433.
  • [10] Kim, K. Y.; Kim, K. H. Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals. Naval Research Logistics (NRL). 2003; 50(5), 498-514.
  • [11] Koo, P. H.; Lee, W. S.; Jang, D. W. Fleet sizing and vehicle routing for container transportation in a static environment. OR Spectrum, 2004; 26, 193-209.
  • [12] Murty, K. G.; Liu, J.; Wan, Y. W.; Linn, R. A decision support system for operations in a container terminal. Decision Support Systems. 2005; 39(3), 309-332.
  • [13] Nishimura, E.; Imai, A.; Papadimitriou, S. Yard trailer routing at a maritime container terminal. Transportation Research Part E: Logistics and Transportation Review. 2005; 41(1), 53-76.
  • [14] Vis, I. F. A comparative analysis of storage and retrieval equipment at a container terminal. International Journal of Production Economics. 2006; 103(2), 680-693.
  • [15] Ng, W. C.; Mak, K. L.; Zhang, Y. X. Scheduling trucks in container terminals using a genetic algorithm. Engineering Optimization. 2007; 39(1), 33-47.
  • [16] Ndiaye, B. M.; Tao, P. D.; Le Thi, H. A. Single straddle carrier routing problem in port container terminals: Mathematical model and solving approaches. 2008. In Modelling, Computation and Optimization in Information Systems and Management Sciences (pp. 21- 31). Springer Berlin Heidelberg.
  • [17] Zeng, Q.; Yang, Z.; Lai, L. Models and algorithms for multi-crane oriented scheduling method in container terminals. Transport Policy. 2009; 16(5), 271-278.
  • [18] Cao, J. X.; Lee, D. H.; Chen, J. H.; Shi, Q. The integrated yard truck and yard crane scheduling problem: Benders' decomposition-based methods. Transportation Research Part E: Logistics and Transportation Review, 2010; 46(3), 344-353.
  • [19] Skinner, B., Y.; Yuan, S.; Huang, S.; Liu, D.; Cai, B.; Dissanayake, G.; Lau, H.; Bott, A.; Pagac, D. Optimisation for job scheduling at automated container terminals using genetic algorithm. Computers & Industrial Engineering, 2013; 64(1), 511-523.
  • [20] Niu, B.; Xie, T.; Chan, F. T.; Tan, L. J.; Wang, Z. X. Particle swarm optimization for the truck scheduling in container terminals. In Information Science, Electronics and Electrical Engineering (ISEEE), 2014 International Conference on (Vol. 3, pp. 1392-1396). IEEE.
  • [21] Senhan E.; Hatipoglu B., Bir Lojistik Köyde Taşıma Araçlarına İş Emirlerinin Atanması ve Çizelgelenmesi, 2015. Celal Bayar Üniversitesi Endüstri Mühendisliği Bölümü Lisans Bitirme Tezi (Basılmamış makale)
  • [22] Anon ILOG, IBM. ILOG CPLEX Optimization Studio, V.12.6.2 , 2013.