Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs

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

İsim	Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
Yazar	Erdoğan, Güneş, Battarra, M., Laporte, G., Vigo, D.
Basım Tarihi:	2012-05
Basım Yeri	- Elsevier
Konu	Traveling salesman problem, Handling cost, Pickup and delivery, Metaheuristics
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0305-0548
Kayıt Numarası	473aa052-2894-4daa-bf9c-84d7a7c88a19
Lokasyon	Industrial Engineering
Tarih	2012-05
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	This paper studies the Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs. The subproblem of minimizing the handling cost for a fixed route is analyzed in detail. It is solved by means of an exact dynamic programming algorithm with quadratic complexity and by an approximate linear time algorithm. Three metaheuristics integrating these solution methods are developed. These are based on tabu search, iterated local search and iterated tabu search. The three heuristics are tested and compared on instances adapted from the related literature. The results show that the combination of tabu search and exact dynamic programming performs the best, but using the approximate linear time algorithm considerably decreases the CPU time at the cost of slightly worse solutions.
DOI	10.1016/j.cor.2011.07.013
Cilt	39

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs

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

Basım Tarihi 2012-05

Basım Yeri - Elsevier

Konu Traveling salesman problem, Handling cost, Pickup and delivery, Metaheuristics

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0305-0548

Kayıt Numarası 473aa052-2894-4daa-bf9c-84d7a7c88a19

Lokasyon Industrial Engineering

Tarih 2012-05

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

Örnek Metin This paper studies the Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs. The subproblem of minimizing the handling cost for a fixed route is analyzed in detail. It is solved by means of an exact dynamic programming algorithm with quadratic complexity and by an approximate linear time algorithm. Three metaheuristics integrating these solution methods are developed. These are based on tabu search, iterated local search and iterated tabu search. The three heuristics are tested and compared on instances adapted from the related literature. The results show that the combination of tabu search and exact dynamic programming performs the best, but using the approximate linear time algorithm considerably decreases the CPU time at the cost of slightly worse solutions.

DOI 10.1016/j.cor.2011.07.013

Cilt 39