Felipe Ortega, Ángel and Ortuño, M. Teresa and Tirado Domínguez, Gregorio (2011) Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints. European journal of operational research, 211 (1). pp. 66-75. ISSN 0377-2217
Official URL: http://www.sciencedirect.com/science/journal/03772217
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.
|Uncontrolled Keywords:||Traveling Salesman; Heuristics; Infeasible Solutions|
|Subjects:||Sciences > Mathematics > Mathematical statistics|
|Deposited On:||09 May 2012 10:40|
|Last Modified:||24 May 2016 16:46|
Repository Staff Only: item control page