Collaborative optimization of multi-echelon supply chain based on co-evolutionary particle swarm optimization

Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS

Volumn 16, Issue 1, 2010, Pages 127-132

  Wu, Xue Jing ^a   Zhou, Hong ^a   Liang, Chun Hua ^a  

^a BEIHANG UNIVERSITY   (China)

Author keywords

Batching delivery; Co evolutionary; Particle swarm optimization; Soft time window; Supply chain

Indexed keywords

BATCHING DELIVERY; CO-EVOLUTIONARY; COLLABORATIVE OPTIMIZATION; CUSTOMER SERVICE LEVELS; DELIVERY PROBLEMS; MANUFACTURING ENTERPRISE; MULTIECHELON; OPERATION COST; PARTICLE SWARM OPTIMIZATION ALGORITHM; PRODUCTION SCHEDULING; SUPPLY CHAIN NETWORK; TIME WINDOWS;

COST REDUCTION; PRODUCTION ENGINEERING; SCHEDULING ALGORITHMS; SUPPLY CHAIN MANAGEMENT; SUPPLY CHAINS; VEHICLE ROUTING;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 77949911468     PISSN: 10065911     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. BAUSCH D O, BROWN G G, RONEN D. Scheduling short-term marine transport of bulk products[J]. Maritime Policy and Management, 1998, 25(4): 335-348.
2. BALAKRISHNAN N. Simple heuristics for the vehicle routing problem with soft time windows[J]. Journal of Operational Research Society, 1993, 44(3): 279-287.
3. TAILLARD E, BADEAU P, GENDERAU M, et al. Tabu search heuristic for the vehicle routing problem with soft time windows[J]. Transportation Science, 1997, 31(2): 170-186.
4. KENNEDY J, EBERHART R. A discrete binary version of the particle swarm algorithm[C]//Proceedings of World Multi Conference on Systemics, Cybernetics and Informatics. Piscataway, N.J., USA: IEEE Press, 1997: 4104-4109.
5. YUSUF Y Y, SARHADI M, GUNASEKARAN A. Agile manufacturing: the drivers, concepts and attributes[J]. International Journal of Production Economics, 1999, 62(1/2): 33-43.
6. FAGERHOLT K. Ship scheduling with soft time windows-an optimization based approach[J]. European Journal of Operational Research, 2001, 131(3): 559-571.
7. HOKEY M. A multi-objective vehicle routing problem with soft time windows: the case of a public library distribution system[J]. Socio-Economic Planning Sciences, 1991, 25(3): 179-188.
8. EBERHART R, KENNEDY J. A new optimizer using particle swarm theory[C]//Proceedings of the 6th International Symposium on Micro Machine and Human Science. Washington, D.C., USA: IEEE, 1995: 39-43.
9. HUANG Min, WU Xuejing, WANG Xingwei. Virtual enterprise risk programming based on ant system under electronic commerce[J]. Computer Integrated Manufacturing Systems, 2005, 11(10): 1456-1460(in Chinese).
10. KAUFMAN L, ROUSSEEUW P. Finding groups in data: an introduction to cluster analysis[M]. New York, N.Y., USA: Wiley, 1990.
11. POTTER M, DE JONG K A. Cooperative coevolution: an architecture for evolving coadapted subcomponents[J]. Evolutionary Computation, 2000, 8(1): 1-29.
12. ZHOU Hong, LI Zhengdao, WU Xuejing. Hybrid ant colony optimization algorithm for unrelated parallel machine scheduling problem[J]. Computer Integrated Manufacturing Systems, 2008, 14(9): 1733-1741(in Chinese).
13. SHE Y, EBERHART R. A modified particle swarm optimizer[C]//Proceedings of IEEE World Congress on Computational Intelligence. Washington, D.C., USA: IEEE, 1998: 69-73.
14. KENNEDY J, MENDES R. Population structure and particle swarm performance[C]//Proceedings of IEEE Congress on Evolutionary Computation. Washington, D.C., USA: IEEE, 2002: 1671-1676.
15. SHI Y, KROHLING R. Co-evolutionary particle swarm optimization to solving min-max problems[C]//Proceedings of IEEE Congress on Evolutionary Computation. Washington, D.C., USA: IEEE, 2002: 1682-1687.
16. KENNEDY J, EBERHART R. Particle swarm optimization[C]//Proceedings of IEEE International Conference on Neural Networks. Washington, D.C., USA: IEEE, 1995: 1942-1948.
17. GUHA S, RASTOGI R, SHIM K. CURE: an efficient clustering algorithm for large databases[C]//Proceedings of ACM SIGMOD International Conference of Management of Data. New York, N.Y., USA: ACM, 1998: 73-84.
18. SUDIPTO G, RAJEEV R, KYUSEOK S. ROCK: a robust clustering algorithm for categorical attributes[J]. Information System, 2000, 25(5): 345-366.
19. KARYPIS G, HAN E, KUMAR V. Chameleon: hierarchical clustering using dynamic modeling[J]. IEEE Computer, 1999, 32(8): 68-75.
20. HALL N G, POSNER M E. Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date[J]. Operations Research, 1991, 39(5): 836-846.
21. NOLAND R B, POLAK J W. Travel time variability: a review of theoretical and empirical issues[J]. Transport Review, 2002, 22(1): 39-54.
22. BAKER K R, SCUDDER G D. Sequencing with earliness and tardiness penalties: a review[J]. Operations Research, 1990, 38(1): 22-36.
23. DIRKBISK U P, MARTIN F. Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates[J]. Computers and Operations Research, 2001, 28(8): 787-801.