A Threshold Accepting Heuristic for The Heterogeneous Fleet Vehicle Routing Problem

The heterogeneous fleet vehicle routing problem (HFVRP) is investigated using the Threshold Accepting (TA) heuristic. Here we apply a non-monotonic TA heuristic as it produces better solution than the monotonic one. The initial solution is obtained by Dijkstra’s lagorithm based on a cost network constructed by the sweep algorithm and the 2_opt. Our TA algorithm uses a number of local search methods. The algorithm is the tested on the data sets from the literature and produces goood results.

Di buat oleh: Arif Imran (arifimran@itenas.ac.id / arifimr@yahoo.com), Liane Okdinawati (aneu88@yahoo.com).
Kata kunci : Threshold accpeting, metaheuristic, routing, heteregeneous fleet
Keterangan : Diterbitkan di Jurnal Logistik Bisnis Vol.1, No.2, 2010. Politeknik Pos Indonesia

A Threshold Accepting Heuristic for The Heterogeneous Fleet Vehicle Routing Problem