RT Journal Article
T1 Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
A1 Ortuño Sánchez, María Teresa
A1 Tirado Domínguez, Gregorio
A1 Felipe Ortega, Ángel
AB Logistics and transportation issues have been receiving increasing attention during the last decades and their requirements have gradually changed, making it necessary to take into account new situations and conditions. The Double Traveling Salesman Problem with Multiple Stacks (DTSPMS) is a pickup and delivery problem in which some additional precedence and loading constraints are imposed on the vehicle to be used. In this paper we approach the problem using intermediate infeasible solutions to diversify the search process and we develop some fixing procedures and infeasibility measures to deal with this kind of solutions and take advantage of their potential. (C) 2010 Elsevier B.V. All rights reserved.
PB Elsevier Science
SN 0377-2217
YR 2011
FD 2011-05-16
LK https://hdl.handle.net/20.500.14352/42419
UL https://hdl.handle.net/20.500.14352/42419
LA eng
NO Felipe, Angel, M. Teresa Ortuño, y Gregorio Tirado. «Using Intermediate Infeasible Solutions to Approach Vehicle Routing Problems with Precedence and Loading Constraints». European Journal of Operational Research 211, n.o 1 (mayo de 2011): 66-75. https://doi.org/10.1016/j.ejor.2010.11.011.
NO Gobierno de España
DS Docta Complutense
RD 13 abr 2025