Complutense University Library

Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints

Felipe Ortega, Ángel and Ortuño Sánchez, María 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

View download statistics for this eprint

==>>> Export to other formats

Abstract

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.


Item Type:Article
Uncontrolled Keywords:Traveling Salesman; Heuristics; Infeasible Solutions
Subjects:Sciences > Mathematics > Mathematical statistics
ID Code:15148
Deposited On:09 May 2012 10:40
Last Modified:11 Dec 2012 15:33

Repository Staff Only: item control page