A hybrid meta-heuristic algorithm for vehicle routing and packing problem with cross-docking

Küçükoğlu İ., Öztürk N.

JOURNAL OF INTELLIGENT MANUFACTURING, cilt.30, sa.8, ss.2927-2943, 2019 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 30 Sayı: 8
  • Basım Tarihi: 2019
  • Doi Numarası: 10.1007/s10845-015-1156-z
  • Dergi Adı: JOURNAL OF INTELLIGENT MANUFACTURING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.2927-2943
  • Anahtar Kelimeler: Hybrid meta-heuristic algorithm, Cross-docking, Vehicle routing, 2-Dimensional vehicle loading, TABU SEARCH, SCHEDULING PROBLEM, PARALLEL MACHINES, TIME, OPTIMIZATION, FLOWSHOP
  • Bursa Uludağ Üniversitesi Adresli: Evet

Özet

Cross-docking is a relatively new logistics strategy that has a great potential to eliminate storage cost and speed up the product flows. This paper considers the vehicle routing and packing problem with cross-docking and presents a mixed integer linear mathematical model. In the model, a set of trucks are used to transport products from suppliers to customers through cross-docking centers. Each supplier and customer node can be visited only once and directly shipping is not allowed from suppliers to customers. Moreover, truck capacities are identified with physical dimensional limits on the contrary of weight or amount of load. The objective of the study is to determine the vehicle routes that minimize the total distance. Due to the complexity of the mathematical model, a hybrid meta-heuristic algorithm (HMA), which integrates tabu search (TS) algorithm within simulated annealing (SA) algorithm, is proposed to solve the problem. Proposed HMA is tested on a well-known benchmark problem data set and compared with the SA and TS solutions. Results show that proposed HMA can produce effective solutions and outperforms the SA and TS especially for the large-sized problems.