The linehaul-feeder vehicle routing problem with virtual depots and time windows

研究成果: 雜誌貢獻期刊論文同行評審

6 引文 斯高帕斯(Scopus)

摘要

This paper addresses the linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW). Small and large vehicles deliver services to customers within time constraints; small vehicles en route may reload commodities from either the physical depot or from the larger vehicle at a virtual depot before continuing onward. A two-stage solution heuristic involving Tabu search is proposed to solve this problem. The test results show that the LFVRPTW performs better than the vehicle routing problem with time windows in terms of both objective value and the number of small vehicles dispatched.

原文???core.languages.en_GB???
文章編號759418
期刊Mathematical Problems in Engineering
2011
DOIs
出版狀態已出版 - 2011

指紋

深入研究「The linehaul-feeder vehicle routing problem with virtual depots and time windows」主題。共同形成了獨特的指紋。

引用此