The location routing problem with arc time windows for terror regions: a mixed integer formulation

Creative Commons License

Cetinkaya C., Gökçen H., Karaoğlan İ.

JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, cilt.35, ss.309-318, 2018 (ESCI) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 35
  • Basım Tarihi: 2018
  • Doi Numarası: 10.1080/21681015.2018.1479894
  • Dergi Adı: JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus
  • Sayfa Sayıları: ss.309-318
  • Anahtar Kelimeler: Location routing, arc time windows, mixed integer programming formulation, homeland defense, vehicle routing, HEURISTIC APPROACH, CUT ALGORITHM
  • Gazi Üniversitesi Adresli: Evet

Özet

In this paper, we introduce a new variant of Location Routing Problem with the name of "Location Routing Problem with Arc Time Windows" (LRP_ATW), which emerges from the need of "safe transportation" in terror zones. In this specific problem, there are "arc time windows" on the arcs (roads) for transferring the vehicles like trucks and articulated lorries which means that these roads can be used for a specific period of time during a day. Within the scope of this paper, the problem and assumptions are described, and a Mixed Integer Programming (MIP) formulation is developed to solve the problem. Bounds are also improved using valid inequalities. The quality of the formulation is measured using the test problems in the literature. Computational results show that the proposed MIP formulation gives good quality results in a short computation time.