The DSS LOGDIS optimizes delivery routes for FRILAC's frozen products

Interfaces

Volumn 35, Issue 3, 2005, Pages 202-214

  Faulin, Javier ^a   Sarobe, Pablo ^b   Simal, Jorge ^b  

^a PUBLIC UNIVERSITY OF NAVARRE   (Spain)

^b Tecnicia Corporation   (Spain)

Author keywords

Information systems: decision support systems; Transportation: vehicle routing

Indexed keywords

EID: 30744438601     PISSN: 00922102     EISSN: None     Source Type: Journal    
DOI: 10.1287/inte.1050.0134     Document Type: Review

References (27)

1. Adenso-Díaz, B., M. González, E. García. 1998. A hierarchical approach to managing dairy routing. Interfaces 28(2) 21-31.
2. Bodin, L., B. Golden, A. Assad, M. Ball. 1983. Routing and scheduling of vehicles and crews. The state of the art. Comput. Oper. Res. 10(2) 63-212.
3. Brown, G., J. Keegan, B. Vigus, K. Wood. 2001. The Kellogg company optimizes production, inventory, and distribution. Interfaces 31(6) 1-15.
4. Clarke, G., J. Wright. 1964. Scheduling of vehicles from a central depot to a number of delivering points. Oper. Res. 12(4) 568-581.
5. Dijkstra, E. W. 1959. A note on two problems in connection with graphs. Numerische Math. 1 269-271.
6. Eiselt, H. A., C. L. Sandblom. 2000. Integer Programming and Network Models. Springer, Berlin, Germany.
7. Faulin, J. 2003. Combining linear programming and heuristics to solve a transportation problem for a canning company in Spain. Internat. J. Logistics: Res. Appl. 6(1-2, March-June) 17-27.
8. Faulin, J., D. Keefer, A. Bayo. 2002. Integrated management of routes for logistics carrier DISAYT. Interfaces 32(6) 41-43.
9. Fisher, M. L., R. Jaikumar. 1981. A generalized assignment heuristic for vehicle routing. Networks 11(2) 109-124.
10. Fumero, F., C. Vercellis. 1999. Synchronized development of production, inventory, and distribution schedules. Transportation Sci. 33(3) 330-340.
11. Gaskell, T. J. 1967. Bases for the vehicle fleet scheduling. Oper. Res. Quart. 18 281-295.
12. Gendreau, M., A. Hertz, G. Laporte. 1994. A tabu search heuristic for the vehicle routing problem. Management Sci. 40(10) 1276-1290.
13. Gillet, B. E., L. R. Miller. 1974. A heuristic algorithm for the vehicle dispatch problem. Oper. Res. 22(2) 340-349.
14. Glover, F., G. Jones, D. Karney, D. Klingman, J. Mote. 1979. An integrated production, distribution, and inventory planning system. Interfaces 9(5) 21-35.
15. Gupta, V., E. Peters, T. Miller. 2002. Implementing a distribution-network decision-support system at Pfizer/Warner-Lambert. Interfaces 32(4) 28-45.
16. Holmes, R. A., R. G. Parker. 1976. A vehicle scheduling procedure based upon savings and a solution perturbation scheme. Oper. Res. Quart. 27(1) 83-92.
17. Köksalan, M., H. Süral. 1999. Efes Beverage Group makes location and distribution decisions for its malt plants. Interfaces 29(2) 89-103.
18. Laporte, G., M. Gendreau, J. Y. Potvin, F. Semet. 2000. Classical and modern heuristics for the vehicle routing problem. Internat. Trans. Oper. Res. 7 285-300.
19. Martin, C. H., D. C. Dent, J. C. Eckhart, 1993. Integrated production, distribution, and inventory planning at Libbey-Owens-Ford. Interfaces 23(3) 68-78.
20. Martin, E., IV. 1998. Centralized bakery reduces distribution costs using simulation. Interfaces 28(4) 38-46.
21. Mole, R. H., S. R. Jameson. 1976. A sequential route-building algorithm employing a generalised savings criterion. Oper. Res. Quart. 27(2) 503-511.
22. Paessens, H. 1988. The savings algorithm for the vehicle routing problem. Eur. J. Oper. Res. 34(3) 336-344.
23. Pooley, J. 1994. Integrated production and distribution facility planning at Ault Foods. Interfaces 24(4) 113-121.
24. Sauter, V. 1997. Decision Support Systems: An Applied Managerial Approach. John Wiley, New York.
25. Toth, P., D. Vigo. 2002. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, PA.
26. Van Breedam, A. 2001. Comparing descent heuristics and metaheuristics for the vehicle routing problem. Comput. Oper. Res. 28(4) 289-315.
27. Whiting, P. D., J. A. Hillier. 1960. A method for finding the shortest route through a road network. Oper. Res. Quart. 11 37-40.