An ASP-based model employing a tabu search method for making e-logistics decisions

Cybernetics and Systems

Volumn 37, Issue 1, 2006, Pages 47-58

  Tarantilis, C D ^a,b,c  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

^c NONE   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

HTML; INTERNET; JAVA PROGRAMMING LANGUAGE; LOGISTICS; ONLINE SEARCHING; PROBLEM SOLVING; VEHICLES;

APPLICATION SERVICE PROVIDERS (ASP); ASP-BASED MODEL; HYPERTEXT MARKUP LANGUAGE (HTML) CODE; JAVA APPLETS;

DECISION SUPPORT SYSTEMS;

EID: 29044443895     PISSN: 01969722     EISSN: 10876553     Source Type: Journal    
DOI: 10.1080/01969720500320791     Document Type: Article

References (21)

1. Baker, B. M. and C. A. C. Carreto, 2003. A visual interactive approach to vehicle routing. Computers & Operations Research, 30:321-337.
2. Barbarosoglu, G. and D. Ozgur, 1999. A tabu search algorithm for the vehicle routing problem. Computers & Operations Research, 26:255-270.
3. Bard, J. F., G. Kontoravdis, and G, Yu. (2002). A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science, 36:250-269.
4. Cordeau, J.-F., M. Gendreau., G. Laporte, J.-Y. Potvin, and F. Semet. 2002. A guide to vehicle routing heuristics. Journal of the Operational Research Society, 53:512-522.
5. Dijkstra, E. W. 1959. A note on two problems in connection with graphs. Numerische Mathematik, 1:269-271.
6. Giosa, I. D., I. L. Tansini, and I. O. Viera. 2002. New assignment algorithms for the multi-depot vehicle routing problem. Journal of the Operational Research Society, 53:977-984.
7. Glover F. and M. Laguna, 1997. Tabu search, Boston: Kluwer Academic Publishers.
8. Hwang, H.-S. 2002a. Design of supply-chain logistics system considering service level. Computers & Industrial Engineering, 43:283-297.
9. Hwang, H.-S. 2002b. An improved model for vehicle routing problem with time constraint based on genetic algorithm. Computers & Industrial Engineering, 42:361-369.
10. Laporte, G., F. V. Louveaux, and L. Van Hamme. 2002. An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research, 50(3):415-423.
11. Larsen, A., O. Madsen, and M. Solomon. 2002. Partially dynamic vehicle routing - models and algorithms. Journal of the Operational Research Society, 53: 637-646.
12. Rego, C. 2001. Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms. Parallel Computing, 27:201-222.
13. Rochat, Y. and E. D. Taillard. 1995. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1:147-167.
14. Sariklis, D. and S. Powell. 2000. A heuristic method for the open vehicle routing problem. Journal of the Operational Research Society, 51:564-573.
15. Singer, M., P. Donoso, and S. Jara. 2002. Fleet configuration subject to stochastic demand: An application in the distribution of liquefied petroleum gas. Journal of the Operational Research Society, 53:768-782.
16. Taillard, E., P. Badeau, M. Gendreau, F. Geurtin, and J. Y. Potvin, 1997. A tabu search heuristic for the vehicle routing problem with time windows. Transportation Science, 31:170-186.
17. Tarantilis, C. D. and C. T. Kiranoudis. 2002. BoneRoute: An effective memory-based method for effective fleet management. Annals of Operations Research, 115:227-241.
18. Tarantilis, C. D., C. T. Kiranoudis, and V. S. Vassiliadis. 2002. A list based threshold accepting algorithm for the capacitated vehicle routing problem. International Journal of Computer Mathematics, 79:537-553.
19. Tarantilis, C. D., C. T. Kiranoudis, and V. S. Vassiliadis. 2003. A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem, Journal of the Operational Research Society, 54:65-71.
20. Wassan, N. A., and I. H. Osman. 2002. Tabu search variants for the mix fleet vehicle routing problem. Journal of the Operational Research Society, 53:768-782.
21. Waters, C. D. J. 1987. A solution procedure for the vehicle scheduling problem based on iterative route improvement. Journal of Operational Research Society, 38:833-839.