A heuristic approach to the multi-period multi-commodity transportation problem

Journal of the Operational Research Society

Volumn 56, Issue 6, 2005, Pages 708-718

  Poh, K L ^a   Choo, K W ^a   Wong, C G ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Ministry of Defence Government of Singapore   (Singapore)

Author keywords

Allocation; Heuristics; Logistics; Optimization; Transportation

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; CUSTOMER SATISFACTION; HEURISTIC METHODS; LOGISTICS; OPTIMIZATION; POLYNOMIALS; TRANSPORTATION;

ALLOCATION; EVACUATION PROBLEMS; POLYNOMIAL-TIME ALGORITHMS; VEHICLE ROUTING PROBLEM (VRP);

PROBLEM SOLVING;

EID: 18944394825     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601875     Document Type: Article

References (55)

1. Powell WB (1988). A comparative review of alternative algorithms for the dynamic vehicle allocation problem. In: Golden BL and Assad AA (eds). Vehicle Routing: Methods and Studies. Elsevier, New York, pp 249-289.
2. Bookbinder JH and Sethi SP (1980). The dynamic transportation problem: a survey. Naval Res Logistics Quart 27: 65-87.
3. Aronson JE (1989). A survey of dynamic network flows. Ann Op Res 20: 1-66.
4. Gordeau JF et al (2002). The VRP with time windows. In: Toth P and Vigo D (eds). The Vehicle Routing Problem. SIAM Monograph on Discrete Mathematics and Applications, Philadelphia, pp 157-193.
5. Gordeau JF et al (2002). A guide to vehicle routing heuristics. J Opt Res Soc 53: 512-522.
6. Laporte G and Semet F (2002). Classical heuristics for the capacitated VRP. In: Toth P and Vigo D (eds). The Vehicle Routing Problem. SIAM Monograph on Discrete Mathematics and Applications, Philadelphia, pp 109-128.
7. Gendreau M, Laporte G and Potvin JY (2002). Metaheuristics for the capacitated VRP. In: Toth P and Vigo D (eds). The Vehicle Routing Problem. SIAM Monograph on Discrete Mathematics and Applications, Philadelphia, pp 129-154.
8. Laporte G and Louveaux FV (2001). Stochastic vehicle routing problems. In: Floudas A and Pardalos PM (eds). Encyclopedia of Optimization, Vol. 5. Kluwer, Boston, pp 377-379.
9. Cordeau JF, Laporte G and Mercier A (2001). A unified tabu search heuristic for vehicle routing problems with time windows. J Op Res Soc 52: 928-936.
10. Ford LR and Fulkerson DR (1962). Flows in Networks. Princeton University Press: New Jersey.
11. Chalmet LG, Francis RL and Saunders PB (1982). Network models for building evacuation. Mngt Sci 28: 86-105.
12. Jarvis JJ and Ratliff HD (1982). Some equivalent objectives for dynamic network flow problems. Mngt Sci 28: 106-109.
13. Choi W, Francis RL, Harnacher HW and Tufekci S (1984). Network models of building evacuation problems with flow-dependent exit capacities. In: Brans JP (ed). Operational Research '84: Proceedings of the Tenth IFORS International Conference on Operational Research. Elsevier, New York, pp 1047-1059.
14. Choi W, Harnacher HW and Tufekci S (1988). Modelling of building evacuation problems by network flows with side constraints. Eur J Opl Res 35: 98-110.
15. Harnacher HW and Tufekci S (1987). On the use of lexicographic minimum cost flows in evacuation modeling. Naval Res Logist 34: 487-503.
16. Hoppe B and Tardos E (1994). Polynomial time algorithms for some evacuation problems. In: Sleator DD (ed). Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, pp 433-441.
17. Hoppe B and Tardos E (1995). The quickest transshipment problem. In: Clarkson K (ed). Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, pp 512-521.
18. Fleischer L (1998). Faster algorithms for the quickest transshipment problem with zero transit times. In: Karloff H (ed). Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, pp 147-156.
19. Daskin MS (1995). Network and Discrete Location: Models, Algorithms and Applications. Wiley: New York.
20. Drezner Z (1995). Facility Location: A Survey of Applications and Methods. Springer: New York.
21. Love R, Morris JG and Wesolowshy GO (1988). Facilities Location: Models and Methods. North-Holland: New York.
22. Cooper L (1972). The transportation-location problems. Opns Res 20: 94-108.
23. Love R and Juel H (1982). Properties and solution methods for large location-allocation problems with rectangular distances. J Opt Res Soc 33: 443-452.
24. Love R and Morris JG (1975). A computational procedure for the exact solution of location-allocation problems with rectangular distances. Naval Res Logist Quart 22: 441-453.
25. Cooper L (1963). Location-allocation problems. Opns Res 11: 331-343.
26. Kolen A (1979). Complexity of Location Problems on Networks, BW 107/79. Stichting Mathematisch Centrum: Amsterdam.
27. Mirchandani PB and Francis RL (1990). Discrete Location Theory. Wiley: New York.
28. O'Kelly ME (1987). Quadratic integer program for the location of interacting hub facilities. Eur J Opl Res 32: 393-404.
29. Klincewicz JG (1991). Heuristics for the p-hub location problem. Eur J Opl Res 53: 25-37.
30. Skorin-Kapov D, Skorin-Kapov J and O'Kelly ME (1996). Tight linear programming relaxations of uncapacitated p-hub median problems. Eur J Opl Res 94: 582-593.
31. Ahuja RK, Magnanti TL and Orlin JB (1993). Network Flows: Theory, Algorithms, and Applications. Prentice-Hall: New York.
32. Frangioni A (1997). Dual-ascent methods and multicommodity flow problems PhD thesis, Department of Computer Science, University of Pisa, Italy.
33. Tardos E (1986). A strongly polynomial algorithm to solve combinatorial linear programs. Opns Res 34: 250-256.
34. Vaidya PM (1989). Speeding up linear programming using fast matrix multiplication. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Washington, DC, pp 332-337.
35. McBride RD (1998). Progress made in solving the multicommodity flow problem. SIAM J Optim 8: 947-955.
36. McBride RD (1998). Advances in solving the multicommodity flow problem. Interfaces 28(2): 32-41.
37. Leighton T and Rao S (1988). An approximate max-flow mincut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Washington, DC, pp 422-431.
38. Garg N and Konemann J (1998). Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, pp 300-309.
39. Shahrokhi F and Matula DW (1990). The maximum concurrent flow problem. J Assoc Comput Machinery 37: 318-334.
40. Leighton T and Rao S (1999). Multicommodity max-flow mincut theorems and their use in designing approximation algorithms. J Assoc Comput Machinery 46: 787-832.
41. Barnhart C (1993). Dual-ascent methods for large-scale multicommodity flow problems. Naval Research Logistics 40: 305-324.
42. Barnhart C and Sheffy Y (1993). A network-based primal-dual heuristic for multicommodity network flow problems. Transport Sci 27: 102-117.
43. Barnhart C, Hane CA and Vance P (1996). Integer Multicommodity Flow Problems. Centre for Transportation Studies Working Paper, Centre for Transportation Studies, Massachusetts Institute of Technology.
44. Brunetta L, Conforti M and Fischetti M (2000). A polyhedral approach to an integer multicommodity flow problem. Discrete ApplMath 101: 13-36.
45. Garey MS and Johnson DS (1979). Computers and Intractibility: A Guide to the Theory of NP-Completeness. W.H. Freeman: New York.
46. Coffman Jr EG, Garey MR and Johnson DS (1997). Approximation algorithms for bin packing: a survey. In: Hochbaum DS (ed). Approximation Algorithms for NP-hard Problems. PWS, Boston, pp 46-93.
47. Martello S and Toth P (1990). Knapsack Problems: Algorithms and Computer Implementations. Wiley: New York.
48. Reeves CR (1996). Hybrid genetic algorithms for bin-packing and related problems. Am Opns Res 63: 371-396.
49. Falkenauer E (1994). A new representation and operators for genetic algorithms applied to grouping problems. Evol Comput 2: 123-144.
50. Vink M (1997). Solving Combinatorial Problems using Evolutionary Algorithms Masters thesis, Algorithms and Program-methodology Group, Lieden University, The Netherlands.
51. Falkenauer E (1996). A hybrid grouping genetic algorithm for bin packing. J Heuristics 2: 5-30.
52. Valerio de Carvalho JM (1999). Exact solution of bin-packing problems using column generation and branch-and-bound. Ann Opns Res 86: 629-659.
53. Gent IP (1998). Heuristic solution of open bin packing problems. J Heuristics 3: 299-304.
54. Djang PA and Finch PR (1998). Solving one dimension bin packing problems. Unpublished manuscript, US Army Research Laboratory, Adelphi, MD, USA, phil.djang@psl.nmsu.edu
55. Csirik J et al (1999). A self organising bin packing heuristic. In: Goodrich MT and McGeoch CC (eds). International Workshop on Algorithm Engineering and Experimentation. Baltimore, MD. Springer, Berlin, pp 246-265.