Set covering in fuel-considered vehicle routing problems

The paper studies set covering in fuel-considered vehicle routing problems (FVRP). Firstly, we study the FVRP with distance constraint and time windows (FVRP-TW) whose objective is to find a set covering with the minimum cardinality, which means the number of used vehicles is minimized and hence the...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 607; s. 471 - 479
Hlavní autoři:	Song, Liang, Chen, Haibin, Gu, Hao, Huang, Hejiao, Du, Hongwei
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.11.2015
Témata:	Algorithms Approximation Bicriteria approximation algorithms Constants Covering Fuel-considered vehicle routing problems Logistics Lower bound Mathematical analysis Route selection Set covering Total unimodularity Windows (intervals) Lower bound Fuel-considered vehicle routing problems Set covering Bicriteria approximation algorithms Total unimodularity
ISSN:	0304-3975, 1879-2294
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!