ملخص
The Lane Covering Problem with Time Windows arises in the context of collaborative logistics. Given a set of lanes, it aims at finding a set of tours covering all lanes with the objective of minimizing the total travel cost. The purpose of this paper is to formulate a model for such a problem and to propose a heuristic approach based on Lagrangian relaxation for its solution. The behavior of this procedure is tested on a set of random instances.
اللغة الأصلية | English |
---|---|
الصفحات (من إلى) | 67-81 |
عدد الصفحات | 15 |
دورية | Journal of Discrete Mathematical Sciences and Cryptography |
مستوى الصوت | 11 |
رقم الإصدار | 1 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | Published - 2008 |
منشور خارجيًا | نعم |
ASJC Scopus subject areas
- ???subjectarea.asjc.2600.2603???
- ???subjectarea.asjc.2600.2602???
- ???subjectarea.asjc.2600.2604???