RT Journal Article
T1 An adapted heuristic approach for a clustered traveling salesman problem with loading constraints
A1 Felipe Ortega, Ángel
A1 Ortuño Sánchez, María Teresa
A1 Tirado Domínguez, Gregorio
AB 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.
PB Springer
SN 1619-4500
YR 2012
FD 2012-09
LK https://hdl.handle.net/20.500.14352/42348
UL https://hdl.handle.net/20.500.14352/42348
LA eng
NO Felipe, Angel, M. Teresa Ortuño, y Gregorio Tirado. «An Adapted Heuristic Approach for a Clustered Traveling Salesman Problem with Loading Constraints». 4OR 10, n.o 3 (septiembre de 2012): 245-65. https://doi.org/10.1007/s10288-012-0207-y.
NO Gobierno de España
DS Docta Complutense
RD 5 abr 2025