A vehicle scheduling problem with fixed trips and time limitations

Eliiyi D. T., Ornek A., Karakutuk S. S.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, cilt.117, sa.1, ss.150-161, 2009 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 117 Sayı: 1
  • Basım Tarihi: 2009
  • Doi Numarası: 10.1016/j.ijpe.2008.10.005
  • Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.150-161
  • Anahtar Kelimeler: Vehicle scheduling, Fixed job scheduling, Time constraints, Heuristics, MACHINES
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

We consider minimum-cost scheduling of different vehicle types on a predetermined set of one-way trips. Trips have predetermined ready times, deadlines and associated demands. All trips Must be performed. The total time of operations on any vehicle is limited. We develop a mixed integer model to find the optimal number of vehicles at a minimum cost. Based on the hard nature of the problem, we propose six heuristics. Computational results reveal that heuristics return exceptionally good solutions for problem instances with up to 100 jobs in very small computation times, and are likely to perform well for larger instances. (C) 2008 Elsevier B.V. All rights reserved.