Universidad Complutense de Madrid
E-Prints Complutense

An adapted heuristic approach for a clustered traveling salesman problem with loading constraints



Downloads per month over past year

Felipe Ortega, Ángel and Ortuño, M. Teresa and Tirado Domínguez, Gregorio (2012) An adapted heuristic approach for a clustered traveling salesman problem with loading constraints. 4OR: A quarterly journal of operations research, 10 (3). pp. 245-265. ISSN 1619-4500

[img] PDF
Restringido a Repository staff only


Official URL: http://www.springerlink.com/content/3353880r8l34m60k/fulltext.pdf



The joint optimization of routing and loading operations is crucial to fully optimize the overall planning process in logistics, and as a result routing problems with side constraints are becoming more and more important during the last years. This paper approaches the design of optimal routes for pickup and delivery operations considering in addition some capacity and loading constraints on the vehicles to be used. It is focused on exploiting new ideas to deal with real life situations in which the customers are not uniformly distributed on the pickup or delivery regions of the problem. An adapted and effective heuristic based on a Variable Neighborhood Search framework using improved neighborhood structures is proposed and discussed. The algorithm is applied to several new sets of instances with special structures to better represent real life situations, providing computational results to evaluate its performance.

Item Type:Article
Uncontrolled Keywords:Traveling salesman problem; Clusters; Heuristics
Subjects:Sciences > Mathematics > Applied statistics
ID Code:16766
Deposited On:18 Oct 2012 11:40
Last Modified:19 Feb 2019 11:13

Origin of downloads

Repository Staff Only: item control page