The dynamic multi-period vehicle routing problem

Publication: Research - peer-reviewJournal article – Annual report year: 2010

View graph of relations

This paper considers the Dynamic Multi-Period Vehicle Routing Problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives are to minimize total travel costs and customer waiting, and to balance the daily workload over the planning horizon. This problem originates from a large distributor operating in Sweden. It is modeled as a mixed integer linear program, and solved by means of a three-phase heuristic that works over a rolling planning horizon. The multi-objective aspect of the problem is handled through a scalar technique approach. Computational results show that the proposed approach can yield high quality solutions within reasonable running times.
Original languageEnglish
JournalComputers & Operations Research
Publication date2010
Volume37
Issue9
Pages1615-1623
ISSN0305-0548
DOIs
StatePublished
CitationsWeb of Science® Times Cited: 7

Keywords

  • dynamic, multi-objective, vehicle routing, multi-period, variable neighborhood search
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 4170185