Minimising vehicle distribution duration considering service priority

Dimitra Alexiou

International Journal of Mathematics in Operational Research, 2019, vol. 15, issue 1, 127-136

Abstract: A vehicle routing problem (VRP) is dealt with, where a fleet of vehicles serve (distribution/pickup) a given subset of demand locations in an urban network. A service time priority degree is given to a subset of demand locations. The aim of this paper is to find the least possible overall service time for vehicles to all the demand locations and particularly those that have a high degree of priority. The problem is dealt with in the context of graph theory and a corresponding method is proposed. The paper incorporates a numerical example of the proposed method.

Keywords: distribution; graph theory; vehicle routing; priority service; network. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=101616 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:15:y:2019:i:1:p:127-136

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().