A genetic algorithm for two-stage transportation problem using priority-based encoding

OR Spectrum

Volumn 28, Issue 3, 2006, Pages 337-354

  Gen, Mitsuo ^a   Altiparmak, Fulya ^b   Lin, Lin ^a  

^a WASEDA UNIVERSITY   (Japan)

^b GAZI UNIVERSITY   (Turkey)

Author keywords

Genetic algorithms (GAs); Priority based encoding; Two stage transportation problem (tsTP)

Indexed keywords

EID: 33748300697     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-005-0029-9     Document Type: Article

References (23)

1. Aikens CH (1985) Facility location models for distribution planning, Eur J Oper Res 22:263-279
2. Amiri A (2005) Designing a distribution network in a supply chain system: formulation and efficient solution procedure. Eur J Oper Res (in press)
3. Avealla P (1998) Some personal views on the current state and the future of locational analysis. Eur J Oper Res 104:269-287
4. Das C, Heragu S (1988) A transportation approach to locating plants in relation to potential markets and raw material sources. Decis Sci 19(4):819-829
5. Davis L (1995) Job-shop scheduling with genetic algorithms. Proceedings of the First International Conference on Genetic Algorithms. Lawrence Erlbaum Associates, pp 36-140
6. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-Completeness, Freeman
7. Gen M, Cheng RW (1997) Genetic algorithms and engineering design. Wiley, New York
8. Gen M, Cheng RW (2000) Genetic algorithms and engineering optimization. Wiley, New York
9. Gen M, Li YZ (1998) Solving multi-objective transportation problem by spanning tree-base genetic algorithm. In: Adaptive computing in design and manufactured. Springer, Berlin Heidelberg New York, pp 98-108
10. Geoffrion AM, Graves GW (1974) Multicommodity distribution system design by benders decomposition. Manage Sci 20:822-844
11. Goldberg D, Lingle R (1995) Alleles, Loci and the traveling salesman problem. Proceedings of the First International Conference on Genetic Algorithms. Lawrence Erlbaum Associates, pp 154-159
12. Heragu S (1997) Facilities design. PSW
13. Hindi KS, Basta T, Pienkosz K (1998) Efficient solution of a multi-commodity, two-stage distribution problem with constraints on assignment of customers to distribution centers. Int Trans Oper Res 5(6):519-527
14. Hitchcock FL (1941) The distribution of a product from several sources to numerous localities. J Math Phys 20:24-230
15. Li YZ, Gen M, Ida K (1998) Improved genetic algorithm for solving multi-objective solid transportation problem with fuzzy number. Jpn J Fuzzy Theory Syst 4(3):220-229
16. Michalewicz Z, Vignaux GA, Hobbs M (1991) A non-standard genetic algorithm for the nonlinear transportation problem. ORSA J Comput 3(4):307-316
17. Pirkul H, Jayaraman V (1998) A multi-commodity, multi-plant capacitated facility location problem: formulation and efficient heuristic solution. Computer Operations Research 25 (10):869-878
18. ReVelle C, Laporte G (1996) The plant location problem: new models and research prospects. Oper Res 44:864-874
19. Syarif A, Gen M (2003) Double spanning tree-based genetic algorithm for two stage transportation problem. Int J Knowl-Based Intell Eng Syst 7(4): October
20. Syswerda G (1995) Uniform crossover in genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms. Lawrence Erlbaum Associates, pp 2-9
21. Tilanus B (1997) Introduction to information system in logistics and transportation. In: Tilanus B (ed) Information systems in logistics and transportation. Elsevier, Amsterdam, pp 7-16
22. Tragantalerngsak S, Holt J, Ronnqvist M (2000) An exact method for two-echelon, single-source, capacitated facility location problem. Eur J Oper Res 123:473-489
23. Vignaux GA, Michalewicz Z (1991) A genetic algorithm for the linear transportation problem. IEEE Trans Syst Man Cybern 21(2):445-452