Maximum utilization of vehicle capacity: A case of MRO items

Computers and Industrial Engineering

Volumn 54, Issue 2, 2008, Pages 185-201

  Sarkar, Ashutosh ^a   Mohapatra, Pratap K J ^b  

^a BANARAS HINDU UNIVERSITY   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Capacity utilization; Subset sum problem; Third party logistics; Transportation

Indexed keywords

COMPETITIVE INTELLIGENCE; COMPUTATIONAL COMPLEXITY; IRON AND STEEL PLANTS; OPTIMIZATION; PROBLEM SOLVING; SOCIETIES AND INSTITUTIONS;

LOGISTICAL SERVICES; SUBSET SUM PROBLEMS; THIRD PARTY LOGISTICS; VEHICLE UTILIZATION;

GROUND VEHICLES;

EID: 36749082312     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2007.07.003     Document Type: Article

References (21)

1. Ahrens J., and Finke G. Merging and sorting applied to the zero-one Knapsack problem. Operations Research 23 (1975) 1099-1109
2. Andersson D., and Norman A. Procurement of logistics services - a minutes work or a multi year project?. European Journal Purchasing and Supply Management 8 (2002) 3-14
3. Balas E., and Zemel E. An algorithm for large zero-one Knapsack problems. Operations Research 28 (1980) 1130-1154
4. Dietrich B.L., Escudero L.F., and Chance F. Efficient reformulation for 0-1Programs: Methods and computational results. Discrete Applied Mathematics 42 (1993) 144-176
5. Faaland B. Solution of the value-independent Knapsack problem by partitioning. Operations Research 21 (1973) 332-337
6. Garey M.R., and Johnson D.S. Computers and intractability: A guide to the theory of NP-completeness (1989), Freeman, San Francisco
7. Gens G.V., and Levner E.V. Approximation algorithms for certain universal problems in scheduling theory, Soviet Journal of Computer and System. Science 6 (1978) 31-36
8. Ghosh D., and Chakravarti N. A competitive local search heuristic for the subset sum problem. Computers & Operations Research 26 (1999) 271-279
9. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting stock problem. Operations Research 9 (1961) 849-859
10. Horowitz E., and Sahni S. Computing partitions with applications to the Knapsack problem. Journal of the Association for Computing Machinery 21 (1974) 277-292
11. Johnson D.S. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9 (1974) 339-356
12. Kellerer H., Mansini R., and Speranza M.G. Two linear approximation algorithms for the subset sum problem. European Journal of Operational Research 120 (2000) 289-296
13. Konheim A.G. Cryptography: A primer (1981), Wiley, New York
14. Lawler E. Fast approximation algorithms for Knapsack problems. Mathematics of Operations Research 4 (1979) 339-356
15. Lim W.S. A lemons market? An incentive scheme to induce truth telling in third party logistics providers. European Journal of Operational Research 125 (2000) 519-525
16. Martello S., and Toth P. Approximation schemes for the subset-sum problem: Survey and experimental analysis. European Journal of Operational Research 22 (1985) 56-69
17. Martello S., and Toth P. Worst-case analysis of greedy algorithms for the subset-sum problem. Mathematical Programming 28 (1984) 198-205
18. Prasad K., and Kelly J.S. NP-completeness of some problems concerning voting games. International Journal of Game Theory 19 (1990) 1-9
19. Sahni S. Approximate algorithms for the 0-1 Knapsack problem. Journal of Association of Computing Machinery 22 (1975) 115-124
20. Soma N.Y., and Toth P. An exact algorithm for the subset sum problem. European Journal of Operational Research 136 (2002) 57-66
21. Stank T.P., and Daugherty P.J. The impact of operating environment on the formation of cooperative logistics relationships. Transportation Research-E (Logistics and Transportation Review) 33 1 (1997) 53-65