The double traveling salesman problem with multiple stacks: A variable neighborhood search approach

被引：36

作者：

Felipe, Angel ^{[1
]}

Teresa Ortuno, M. ^{[1
]}

Tirado, Gregorio ^{[1
]}

机构：

[1] Univ Complutense Madrid, Dept Stat & Operat Res, Fac Matemat, Plaza Ciencias 3, E-28040 Madrid, Spain

来源：

COMPUTERS & OPERATIONS RESEARCH | 2009年 / 36卷 / 11期

关键词：

Traveling salesman problem; Variable neighborhood search; LIFO loading; VEHICLE-ROUTING PROBLEM; PICKUP;

D O I：

10.1016/j.cor.2009.01.015

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The double traveling salesman problem with multiple stacks (DTSPMS) is a vehicle routing problem that consists on finding the minimum total length tours in two separated networks, one for pickups and one for deliveries. A set of orders is given, each one consisting of a pickup location and a delivery location, and it is required to send an item from the former location to the latter one. Repacking is not allowed, but collected items can be packed in several rows in such a way that each row must obey the LIFO principle. in this paper, a variable neighborhood search approach using four new neighborhood structures is presented to solve the problem. (C) 2009 Elsevier Ltd. All rights reserved.

引用

页码：2983 / 2993

页数：11

共 22 条

[1] Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery [J].