文章基本信息

标题：Adaptive Memory Procedure to solve the Profitable Arc Tour Problem
本地全文：下载
作者：Jalel Euchi ; Habib Chabchoub
期刊名称：International Journal of Combinatorial Optimization Problems and Informatics
印刷版ISSN：2007-1558
电子版ISSN：2007-1558
出版年度：2010
卷号：1
期号：1
页码：24-37
语种：English
出版社：International Journal of Combinatorial Optimization Problems and Informatics
其他摘要：In this paper we propose an Adaptive Memory Procedure to solve the Profitable Arc Tour Problem (PATP). The PATP is a variant of the well-known Vehicle Routing Problems in which a set of vehicle tours are constructed. The objective is to find a set of cycles in the vehicle tours that maximize the collection of profits minus travel costs, subject to constraints limiting the length of cycles that profit is available on arcs. Computational experiments show that our algorithms provide good results in terms of quality of solution and running times.
关键词：Profitable Arc Tour Problem; Vehicle Routing; Adaptive Memory