A tabu search approach for scheduling hazmat shipments

Computers and Operations Research

Volumn 34, Issue 5, 2007, Pages 1328-1350

  Carotenuto, Pasquale ^a   Giordani, Stefano ^b   Ricciardelli, Salvatore ^b   Rismondo, Silvia ^a,b  

^a CNR   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Hazmat transportation problem; Job shop scheduling; Tabu search algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; RISK ASSESSMENT; SCHEDULING; VEHICLES;

JOB-SHOP SCHEDULING; SHIPMENTS; TABU SEARCH ALGORITHM; VEHICLE ROUTING;

RADIOACTIVE WASTE TRANSPORTATION;

EID: 33748983730     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.06.004     Document Type: Article

References (25)

1. Zografos K.G., and Androutsopoulos K.N. A heuristic algorithm for solving hazardous material distribution problems. European Journal of Operations Research 152 (2004) 507-519
2. Infodatamix. Il traffico di merci pericolose. Rep. of Ministero delle Infrastrutture e dei Trasporti-Servizio Sistemi Informativi e Statistica, CNIT 2001, Cap. X, Roma, Italy, 2002 (in Italian).
3. Abkovitz M., Eiger M., and Srinivasan S. Estimating the release rates and costs of transporting hazardous waste. Transportation Research Record 977 (1984) 22-30
4. Patel M.H., and Horowitz A.J. Optimal routing of hazardous materials considering risk of spill. Transportation Research 28A (1994) 119-132
5. Erkut E., and Verter V. Modeling of transport risk for hazardous materials. Operations Research 46 (1988) 625-642
6. Gopalan R., Batta R., and Karwan M.H. The equity constrained shortest path problem. Computers Operations Research 17 (1990) 297-307
7. Current J., and Ratick S. A model to assess risk, equity and efficiency in facility location and transportation of hazardous materials. Loc. Science 3 (1995) 187-201
8. Gopalan R., Kolluri K.S., Batta R., and Karwan M.H. Modeling of equity in the transportation of hazardous materials. Operations Research 38 (1990) 961-973
9. Akgün V., Erkut E., and Batta R. On finding dissimilar paths. European Journal of Operations Research 121 (2000) 232-246
10. Lombard K., and Church R.L. The gateway shortest path problem. generating alternative routes for a corridor location problem. Geographical Systems 1 (1993) 25-45
11. Kuby M., Zhongyi X., and Xiaodong X. A minimax method for fining the k best differentiated paths. Geographical Analysis 29 (1997) 315-329
12. Erkut E. The discrete p-dispersion problem. European Journal of Operations Research 46 (1990) 48-60
13. Carotenuto P, Giordani S, Ricciardelli S. Finding minimum and equitable risk routes for hazmat shipments. Computers Operations Research 2004, submitted for publication, doi:10.1016/j.cor.2005.06.003
14. Cox R.G., and Turnquist M.A. Scheduling truck shipments of hazardous materials in the presence of curfews. Transportation Research Record 1063 (1986) 21-26
15. Blazewicz J., Ecker K.H., Pesch E., Schmidt G., and Weglarz J. Scheduling Computer and Manufacturing Processes. 2nd ed. (2001), Springer, Berlin
16. Brucker P., and Schlie R. Job-shop scheduling with multi-purpose machines. Computing 45 (1990) 369-375
17. Brandimarte P. Routing and scheduling in a flexible job-shop by tabu search. Annals of Operations Research 41 (1993) 157-183
18. Brucker P., and Neyer J. Tabu search for the multi-mode job-shop problem. OR Spektrum 20 (1998) 21-28
19. Kis T. Job-shop scheduling with processing alternatives. European Journal of Operations Research 151 (2003) 307-332
20. Dell'Amico M., and Trubian M. Applying tabu search to the job-shop scheduling problem. Annals of Operations Research 41 (1993) 231-252
21. Mastrolilli M., and Gambardella L.M. Effective neighbourhood functions for the flexible job shop problem. Journal of Scheduling 3 (2000) 3-20
22. Hall N.G., and Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44 (1996) 510-525
23. Prais M., and Ribeiro C.C. Reactive GRASP. an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing 12 (2000) 164-176
24. Glover F. Tabu search, part I. ORSA Journal on Computing 1 (1989) 190-206
25. Glover F. Tabu search, part II. ORSA Journal on Computing 2 (1990) 4-32