Universidad Complutense de Madrid
E-Prints Complutense

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

Impacto

Downloads

Downloads per month over past year

Ortuño, M. Teresa and Tirado Domínguez, Gregorio and Felipe Ortega, Ángel (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

[img] PDF
Restringido a Repository staff only

346kB

Official URL: http://www.sciencedirect.com/science/article/pii/S0377221710007757


URLURL Type
http://www.sciencedirect.com/UNSPECIFIED


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. (C) 2010 Elsevier B.V. All rights reserved.


Item Type:Article
Uncontrolled Keywords:Traveling Salesman; Heuristics; Infeasible solutions; Variable neighborhood search; Traveling salesman problem; Multiple stacks
Subjects:Sciences > Mathematics > Functions
ID Code:17329
Deposited On:05 Dec 2012 09:22
Last Modified:16 Nov 2018 19:14

Origin of downloads

Repository Staff Only: item control page