多商品旅行商问题的模型与算法

7th International Conference on Hybrid Intelligent Systems (HIS 2007) Pub Date : 2007-09-17 DOI:10.1109/HIS.2007.40

J. Sarubbi, G. Mateus, H. Luna, G. J. Miranda

{"title":"多商品旅行商问题的模型与算法","authors":"J. Sarubbi, G. Mateus, H. Luna, G. J. Miranda","doi":"10.1109/HIS.2007.40","DOIUrl":null,"url":null,"abstract":"We are introducing in this article the Multicommodity Traveling Salesman Problem (MTSP), where the objective is to deliver all the demands of different commodities by a tour that minimizes the sum of the fixed and variable costs for the selected arcs. The MTSP yields then a large scale mixed integer linear programming problem. In this article we devise a Lagrangean based heuristic approach to tackle this more general TSP variant.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Model and algorithms for the Multicommodity Traveling Salesman Problem\",\"authors\":\"J. Sarubbi, G. Mateus, H. Luna, G. J. Miranda\",\"doi\":\"10.1109/HIS.2007.40\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We are introducing in this article the Multicommodity Traveling Salesman Problem (MTSP), where the objective is to deliver all the demands of different commodities by a tour that minimizes the sum of the fixed and variable costs for the selected arcs. The MTSP yields then a large scale mixed integer linear programming problem. In this article we devise a Lagrangean based heuristic approach to tackle this more general TSP variant.\",\"PeriodicalId\":359991,\"journal\":{\"name\":\"7th International Conference on Hybrid Intelligent Systems (HIS 2007)\",\"volume\":\"130 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"7th International Conference on Hybrid Intelligent Systems (HIS 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HIS.2007.40\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HIS.2007.40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

在本文中，我们将介绍多商品旅行推销员问题(MTSP)，其目标是通过一次旅行来满足不同商品的所有需求，并使所选弧线的固定成本和可变成本之和最小。MTSP给出了一个大规模混合整数线性规划问题。在本文中，我们设计了一种基于拉格朗日的启发式方法来处理这种更通用的TSP变体。

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

查看原文本刊更多论文

Model and algorithms for the Multicommodity Traveling Salesman Problem

We are introducing in this article the Multicommodity Traveling Salesman Problem (MTSP), where the objective is to deliver all the demands of different commodities by a tour that minimizes the sum of the fixed and variable costs for the selected arcs. The MTSP yields then a large scale mixed integer linear programming problem. In this article we devise a Lagrangean based heuristic approach to tackle this more general TSP variant.

求助全文

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

来源期刊

7th International Conference on Hybrid Intelligent Systems (HIS 2007)

自引率

0.00%

发文量