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...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 607; pp. 471 - 479
Main Authors:	Song, Liang, Chen, Haibin, Gu, Hao, Huang, Hejiao, Du, Hongwei
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.11.2015
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!