Pricing routines for vehicle routing with time windows on road networks

Adam N. Letchford*, Saeideh D. Nasiri, Amar Oukil

*المؤلف المقابل لهذا العمل

نتاج البحث: المساهمة في مجلةمقالمراجعة النظراء

33 اقتباسات (Scopus)

ملخص

Several very effective exact algorithms have been developed for vehicle routing problems with time windows. Unfortunately, most of these algorithms cannot be applied to instances that are defined on road networks, because they implicitly assume that the cheapest path between two customers is equal to the quickest path. Garaix and co-authors proposed to tackle this issue by first storing alternative paths in an auxiliary multi-graph, and then using that multi-graph within a branch-and-price algorithm. We show that, if one works with the original road network rather than the multi-graph, then one can solve the pricing subproblem more quickly, in both theory and practice.

اللغة الأصليةEnglish
الصفحات (من إلى)331-337
عدد الصفحات7
دوريةComputers and Operations Research
مستوى الصوت51
المعرِّفات الرقمية للأشياء
حالة النشرPublished - نوفمبر 2014

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1700???
  • ???subjectarea.asjc.2600.2611???
  • ???subjectarea.asjc.1800.1803???

بصمة

أدرس بدقة موضوعات البحث “Pricing routines for vehicle routing with time windows on road networks'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا