The traveling salesman problem with pickups, deliveries, and handling costs

Name: The traveling salesman problem with pickups, deliveries, and handling costs
Author: Battarra, M., Erdoğan, Güneş, Laporte, G., Vigo, D.

İsim	The traveling salesman problem with pickups, deliveries, and handling costs
Yazar	Battarra, M., Erdoğan, Güneş, Laporte, G., Vigo, D.
Basım Tarihi:	2010-08
Basım Yeri	- Informs
Konu	The traveling salesman problem, Combinatorial optimization, Exact algorithm
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	1526-5447
Kayıt Numarası	cbdb5deb-b740-4b35-9fc7-c4aa6e9c82f7
Lokasyon	Industrial Engineering
Tarih	2010-08
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	This paper introduces a new variant of the one-to-many-to-one single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The simultaneous optimization of routing and handling costs is difficult, and the resulting loading patterns are hard to implement in practice. However, this option makes economical sense in contexts where the routing cost dominates the handling cost. We have proposed some simplified policies applicable to such contexts. The first is a two-phase heuristic in which the tour having minimum routing cost is initially determined by optimally solving an SVPDP, and the optimal handling policy is then determined for that tour. In addition, branch-and-cutalgorithms based on integer linear programming formulations are proposed, in which routing and handling decisions are simultaneously optimized, but the handling decisions are restricted to three simplified policies. The formulations are strengthened by means of problem specific valid inequalities. The proposed methods have been extensively tested on instances involving up to 25 customers and hundreds of items. Our results show the impact of the handling aspect on the customer sequencing and indicate that the simplified handling policies favorably compare with the optimal one.
DOI	10.1287/trsc.1100.0316
Cilt	44

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

The traveling salesman problem with pickups, deliveries, and handling costs

Yazar Battarra, M., Erdoğan, Güneş, Laporte, G., Vigo, D.

Basım Tarihi 2010-08

Basım Yeri - Informs

Konu The traveling salesman problem, Combinatorial optimization, Exact algorithm

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 1526-5447

Kayıt Numarası cbdb5deb-b740-4b35-9fc7-c4aa6e9c82f7

Lokasyon Industrial Engineering

Tarih 2010-08

Notlar Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Örnek Metin This paper introduces a new variant of the one-to-many-to-one single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The simultaneous optimization of routing and handling costs is difficult, and the resulting loading patterns are hard to implement in practice. However, this option makes economical sense in contexts where the routing cost dominates the handling cost. We have proposed some simplified policies applicable to such contexts. The first is a two-phase heuristic in which the tour having minimum routing cost is initially determined by optimally solving an SVPDP, and the optimal handling policy is then determined for that tour. In addition, branch-and-cutalgorithms based on integer linear programming formulations are proposed, in which routing and handling decisions are simultaneously optimized, but the handling decisions are restricted to three simplified policies. The formulations are strengthened by means of problem specific valid inequalities. The proposed methods have been extensively tested on instances involving up to 25 customers and hundreds of items. Our results show the impact of the handling aspect on the customer sequencing and indicate that the simplified handling policies favorably compare with the optimal one.

DOI 10.1287/trsc.1100.0316

Cilt 44