一类异构多车系统的旅行推销员问题

2012 IEEE 51st IEEE Conference on Decision and Control (CDC) Pub Date : 2012-12-01 DOI:10.1109/CDC.2012.6426488

E. Garone, J. Determe, R. Naldi

{"title":"一类异构多车系统的旅行推销员问题","authors":"E. Garone, J. Determe, R. Naldi","doi":"10.1109/CDC.2012.6426488","DOIUrl":null,"url":null,"abstract":"In this work we formulate and study a Travelling Salesman Problem (TSP) for a scenario in which two different vehicles cooperate so as to perform a desired task in an optimal way. In particular we consider the problem where a fast vehicle with a short operative range has to be coordinated with a carrier vehicle, typically slower but with virtually infinite operativity range, in order to visit in the shortest time a given collection of points.","PeriodicalId":312426,"journal":{"name":"2012 IEEE 51st IEEE Conference on Decision and Control (CDC)","volume":"255 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A travelling salesman problem for a class of heterogeneous multi-vehicle systems\",\"authors\":\"E. Garone, J. Determe, R. Naldi\",\"doi\":\"10.1109/CDC.2012.6426488\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we formulate and study a Travelling Salesman Problem (TSP) for a scenario in which two different vehicles cooperate so as to perform a desired task in an optimal way. In particular we consider the problem where a fast vehicle with a short operative range has to be coordinated with a carrier vehicle, typically slower but with virtually infinite operativity range, in order to visit in the shortest time a given collection of points.\",\"PeriodicalId\":312426,\"journal\":{\"name\":\"2012 IEEE 51st IEEE Conference on Decision and Control (CDC)\",\"volume\":\"255 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE 51st IEEE Conference on Decision and Control (CDC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.2012.6426488\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 51st IEEE Conference on Decision and Control (CDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2012.6426488","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

在这项工作中，我们制定和研究了一个旅行推销员问题(TSP)的场景，其中两种不同的车辆合作，以最优的方式执行期望的任务。我们特别考虑了这样一个问题:为了在最短的时间内访问给定的点集合，具有短操作范围的快速车辆必须与通常速度较慢但实际上具有无限操作范围的运载车辆协调。

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

查看原文本刊更多论文

A travelling salesman problem for a class of heterogeneous multi-vehicle systems

In this work we formulate and study a Travelling Salesman Problem (TSP) for a scenario in which two different vehicles cooperate so as to perform a desired task in an optimal way. In particular we consider the problem where a fast vehicle with a short operative range has to be coordinated with a carrier vehicle, typically slower but with virtually infinite operativity range, in order to visit in the shortest time a given collection of points.

求助全文

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

来源期刊

2012 IEEE 51st IEEE Conference on Decision and Control (CDC)

自引率

0.00%

发文量