SAFE MOVEMENT OF HAZARDOUS MATERIALS THROUGH HEURISTIC HYBRID APPROACH: TABU SEARCH AND GAME THEORY APLICATION

Abstract

The safe movement of hazardous materials is receiving increased attention due to growing environmental awareness of the potential health affects of a release causing incident. A novel approach developed in this paper through a game theory interpretation provides a risk-averse solution to the hazardous materials transportation problem. The dispatcher minimizes the expected maximum disutility subject to worst possible set of link failure probabilities, assuming that one link in the network fails. The expected cost at the Nash equilibrium is a useful measure to evaluate the routing strategies for the safe movement of hazardous materials.

Keywords

• Transportation of hazardous materials, Routing problem, Game theory.

YAKLASIMSAL HİBRİD METODLA GÜVENLİ TEHLİKELİ MADDE TASIMACILIGI: TABU ARASTIRMA VE OYUN TEORİSİ UYGULAMASI

Öz

Tehlikeli madde tasımacılıgında olusacak herhangi bir kazanın gerek insan saglıgına gerekse de çevreye olacak olan etkilerine karsı olusan duyarlılıgın artmasıyla, bu çesit tasımacılıgın güvenligine yönelik kaygılar artmıstır. Bu makalede tehlikeli madde tasımacılıgı oyun teorisi çerçevesinde en az riski içerecek çözüm metoduyla modellenmistir. Tasımacı organizasyon sebekedeki linklerden maksimum olumsuz etkiyi olusturacak olanın üzerinde bir kazanın oldugu varsayımıyla beklenen maksimum maliyeti minimize etmeye çalısarak Nash dengesi çerçevesinde en güvenli tasıma güzergâhını belirlemektedir.

Anahtar Kelimeler

• Tehlikeli madde tasımacılıgı, Araç yönlendirme, Oyun teorisi.

Kaynakça

1. Barbarosoglu, G. and Ozgur, D. 1999. A tabu search algorithm for the vehicle routing problem, Computers and Operations Research. (26), 255-270.
2. Bell, M.G.H. and Iida, Y. 1997. Transportation Network Analysis. John Wiley and Sons, Chichester, UK.
3. Bell, M.G.H. 2000. A game theoretic approach to measuring the performance reliability of transport networks, Transportation Research, Part B. Vol : 13B. 533-546.
4. Caseau, Y. and Laburthe, F. 1999. Heuristics for large constraint vehicle routing problems, Journal of Heuristics. (5), 281-303.
5. Erkut, E. and Verter, V. 1998. Modelling of transport risk for hazardous materials, Operations Research. 46 (5), 625-642.
6. Hobekia, A.G., Barnham, J. and Santoso, I. B. 1986. Selection of preferred highway routes for the shipment of spent nuclear fuel between Surry and North Anna Power Stations in Virginia, State of Art Report 3: Recent advances in hazardous materials, Transportation Research, Transportation Research Board. 67-78.
7. Laporte, G. 1998. Exact algorithms for travelling salesman problem and the vehicle routing problems, Les Cahiers du Gerad, G-98-37.
8. Lenstra, J.K and Kan, A.H.G. 1981. Complexity of vehicle routing and scheduling problems. Networks. (11), 221-227.

9. Lin, S. 1965. Performance analysis of networks with unreliable components. BSTJ. (44), 2245-2269.
10. Nash, J.F. 1951. Non-cooperative games. Annals of Mathematics. (54), 286-295.
11. Osman, I. H. 1993. Metastrategy simulated annealing and tabu search algorıthms for the vehicle routing problem, Annals of Operations Research. (41), 421-451.