考虑到服务的优先级，最小化车辆分配时间

Int. J. Math. Oper. Res. Pub Date : 2019-08-02 DOI:10.1504/IJMOR.2019.101616

D. Alexiou

{"title":"考虑到服务的优先级，最小化车辆分配时间","authors":"D. Alexiou","doi":"10.1504/IJMOR.2019.101616","DOIUrl":null,"url":null,"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.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimising vehicle distribution duration considering service priority\",\"authors\":\"D. Alexiou\",\"doi\":\"10.1504/IJMOR.2019.101616\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":306451,\"journal\":{\"name\":\"Int. J. Math. Oper. Res.\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Math. Oper. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJMOR.2019.101616\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Math. Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJMOR.2019.101616","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

研究了车辆路径问题(VRP)，其中车队服务于城市网络中给定的需求位置子集(配送/取货)。服务时间优先度被赋予需求位置的子集。本文的目的是找出车辆到达所有需求地点的最短总服务时间，特别是那些具有高度优先级的地点。本文在图论的背景下讨论了这一问题，并提出了相应的方法。文中给出了该方法的一个数值算例。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Minimising vehicle distribution duration considering service priority

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Int. J. Math. Oper. Res.

自引率

0.00%

发文量