A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge

European Journal of Operational Research

Volumn 194, Issue 2, 2009, Pages 496-537

  Jawahar, N ^a   Balaji, A N ^b  

^a THIAGARAJAR COLLEGE OF ENGINEERING   (India)

^b K L N COLLEGE OF ENGINEERING   (India)

Author keywords

Distribution problem; Fixed charge; Genetic algorithm; Heuristics; Supply chain

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CONTROL THEORY; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; SOLUTIONS; SUPPLY CHAIN MANAGEMENT; SUPPLY CHAINS;

APPROXIMATION METHODS; CHAIN DISTRIBUTIONS; CONTINUOUS; DISTRIBUTION PROBLEM; DISTRIBUTION PROBLEMS; EVOLUTIONARY SEARCHES; FIXED CHARGE; FIXED CHARGES; HEURISTICS; LOWER BOUNDS; OBJECTIVE CRITERION; SOLUTION QUALITIES; TOTAL COSTS;

PROBLEM SOLVING;

EID: 54449090135     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.12.005     Document Type: Article

References (44)

1. Adlakha V., and Kowalski K. On the fixed-charge transportation problem. OMEGA: The International Journal of Management Science 27 (1999) 381-388
2. Adlakha V., and Kowalski K. A simple heuristic for solving small fixed-charge transportation problems. OMEGA: The International Journal of Management Science 31 (2003) 205-211
3. Adlakha V., Kowalski K., Vemuganti R.R., and Lev B. More-for-less algorithm for fixed-charge transportation problems. OMEGA: The International Journal of Management Science 35 (2007) 116-127
4. Ahuja K.R., Orlin J.B., and Tiwari A. A greedy algorithm for the quadratic assignment problem. Computers & Operational Research 27 (2000) 917-934
5. Barr R.S., Glover F., and Klingman D. A new optimisational method for large scale fixed charge transportation problem. Operations Research 29 3 (1981) 448-463
6. Bell G.J., Lamar B.W., and Wallace C.A. Capacity improvement, penalties, and the fixed-charge transportation problem. Naval Research Logistics 46 (1999) 341-355
7. Cabot V.A., and Erenguc S.S. Some branch-and-bound procedures for the fixed charge transportation problem. Navel Research Logistics Quarterly 31 (1984) 145-154
8. Chopra S. Designing the distribution networks in a supply chain. Transportation Research - Part E 39 (2003) 123-140
9. Chopra S., and Meindl P. Supply Chain Management: Strategy, Planning, and Operation (2001), Pearson Education, Asia
10. Costa L., and Oliveira P. Evolutionary algorithms approach to the solution of mixed integer non-linear programming problems. Computers and Chemical Engineering 25 (2001) 257-266
11. Deb K. An introduction to Genetic Algorithm (1996), Prentice-Hall of India Private Limited, NewDelhi
12. Diaby M. Successive linear approximation procedure for generalized fixed-charge transportation problems. Journal of Operational Research Society 42 11 (1991) 991-1001
13. Driebeek N. An algorithm for the solution of mixed integer programming problem. Management Science 12 (1966) 576-587
14. Dullaert W., Sevaux M., and Sorensen K. Applications of metaheuristics. European Journal of Operational Research 179 (2007) 601-604
15. Eksioglu S.D., Edwin Romeijn H., and Pardalos P.M. Cross-facility management of production and transportation planning problem. Computers & Operations Research 33 (2006) 3231-3251
16. Fisk J., and McKeown P. The pure fixed charge transportation problem. Navel Research Logistics Quarterly 26 (1979) 631-641
17. Fleurent C., and Ferland J.A. Genetic hybrids for the quadratic assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science: American Mathematical Society 16 (1994) 173-187
18. Gen M., Kumar A., and Kim J.R. Recent network design techniques using evolutionary algorithms. International Journal of Production Economics 98 (2005) 251-261
19. Gen M., and Cheng R. Genetic Algorithms and Engineering Design (1996), Wiley, New York
20. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Leaning (2000), Addison Wesley Limited, USA
21. Gray P. Exact solution of the fixed charge transportation problem. Operations Research 19 6 (1971) 1529-1538
22. Herer Y.T., and Rosenblatt M.J. Fast algorithms for single-sink fixed charge transportation problems with applications to manufacturing and transportation. Transportation Science 30 4 (1996) 276-290
23. Jawahar N., Aravindan P., and Ponnambalam S.G. A genetic algorithm for scheduling flexible manufacturing systems. International Journal of Advanced Manufacturing Technology 14 7 (1998) 588-607
24. Kennington J.L., and Unger V.E. The group-theoretic structure in the fixed-charge transportation problem. Operation Research (1973) 1142-1153
25. Kennington J.L., and Unger V.E. A new branch-and-bound algorithm for the fixed-charge transportation problem. Management Science 22 10 (1976) 1116-1126
26. Kim D., and Pardalos P.M. A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Operations Research Letter 24 (1999) 195-203
27. King J.R. Production Planning and Control (1975), Pergamon Press, New York
28. Lamar B.W., and Wallace C.A. Revised-modified penalties for fixed charge transportation problems. Management Science 43 10 (1997) 1431-1436
29. Masters T. Practical Neural Network Recipes in C++ (1993), Academic press, USA
30. Mattfeld C. Evolutionary Search and the Job Shop: Investigation on GA for Production Scheduling (1996), Physica-Verlag Heidelberg, Germany
31. McCall J. Genetic algorithms for modelling and optimization. Journal of Computational and Applied Mathematics 184 1 (2005) 205-222
32. McKeown G. A Branch-and-Bound Algorithm for Solving Fixed Charge Problem. Navel Research Logistics Quarterly 28 4 (1981) 607-617
33. Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs. second ed. (1994), Springer, Berlin
34. Murata T., Ishibuchi H., and Tanaka H. Genetic algorithms for flow shop scheduling problems. Computers and Industrial Engineering 30 4 (1996) 1061-1071
35. Murty K.G. Solving the fixed charge problem by ranking the extreme points. Operations Research 16 (1968) 268-279
36. Palekar U.S., Karwan M.H., and Zionts S. A branch-and-bound method for the fixed charge transportation problem. Management Science 36 9 (1990) 1092-1105
37. Paul R.J., and Chanev T.S. Simulation optimisation using a genetic algorithm. Simulation Practice and Theory 6 (1998) 601-611
38. Ragsdale C.T., and McKeown P.G. An Algorithm for solving fixed charge problems using surrogate constraints. Computers Operation Research 18 1 (1991) 87-96
39. Schaffer J.R., and O'leary D.E. Use of penalties in a branch and bound procedure for the fixed charge transportation problem. European Journal of Operation Research 43 (1989) 305-312
40. Sun M., Aronson J.E., McKeown P.G., and Drinka D. A tabu search heuristic procedure for the fixed charge transportation problem. European Journal of Operational Research 106 (1998) 441-456
41. Taha H.A. Operations Research: An Introduction (2003), Prentice-Hall, USA
42. Tate D.M., and Smith A.E. A genetic approach to the quadratic assignment problem. Computers and Operations Research 22 1 (1995) 78-83
43. Yang L., and Liu L. Fuzzy fixed charge solid transportation problem and algorithm. Applied Soft Computing 7 3 (2007) 879-889
44. Yokota T., Gen M., and Li Y.X. Genetic Algorithm for non linear mixed integer programming problems and its applications. Computers and Industrial Engineering 30 4 (1996) 905-917