文件列表:

AddPaths.m (434, 2023-06-01)
Algorithm (0, 2023-06-01)
Algorithm\Algorithm_AIA.m (1689, 2023-06-01)
Algorithm\Algorithm_GA.m (1554, 2023-06-01)
Algorithm\Algorithm_HS.m (1656, 2023-06-01)
Algorithm\Algorithm_Hybrid_GaSa.m (2199, 2023-06-01)
Algorithm\Algorithm_Hybrid_KaSa.m (2678, 2023-06-01)
Algorithm\Algorithm_KA.m (2443, 2023-06-01)
Algorithm\Algorithm_PSO.m (1853, 2023-06-01)
Algorithm\Algorithm_SA.m (874, 2023-06-01)
Algorithm\Crossover (0, 2023-06-01)
Algorithm\Crossover\Crossover.m (239, 2023-06-01)
Algorithm\Crossover\Crossover_MiddleAnswer.m (145, 2023-06-01)
Algorithm\Crossover\Crossover_OnePoint.m (195, 2023-06-01)
Algorithm\Crossover\Crossover_TwoPoint.m (261, 2023-06-01)
Algorithm\Crossover\Crossover_Uniform.m (239, 2023-06-01)
Algorithm\Keshtel_function (0, 2023-06-01)
Algorithm\Keshtel_function\Keshtel_NearestNeighbor.m (261, 2023-06-01)
Algorithm\Keshtel_function\Keshtel_Swirl.m (237, 2023-06-01)
Algorithm\Mutation (0, 2023-06-01)
Algorithm\Mutation\Mutation.m (297, 2023-06-01)
Algorithm\Mutation\Mutation_BigSwap.m (123, 2023-06-01)
Algorithm\Mutation\Mutation_Displacement.m (203, 2023-06-01)
Algorithm\Mutation\Mutation_Inversion.m (129, 2023-06-01)
Algorithm\Mutation\Mutation_Perturbation.m (158, 2023-06-01)
Algorithm\Mutation\Mutation_Swap.m (114, 2023-06-01)
Algorithm\notcompleted_Algorithm_ACO.m (1964, 2023-06-01)
Algorithm\notcompleted_Algorithm_FA.m (2474, 2023-06-01)
Algorithm\notcompleted_Algorithm_ICA.m (7273, 2023-06-01)
Algorithm\notcompleted_Algorithm_PsoHS.m (116, 2023-06-01)
Algorithm\notcompleted_Algorithm_TS.m (2000, 2023-06-01)
Algorithm\notcompleted__Algorithm_ABC.m (3714, 2023-06-01)
Problem (0, 2023-06-01)
Problem\allocation4DC (0, 2023-06-01)
Problem\allocation4DC\Cost.m (802, 2023-06-01)
Problem\allocation4DC\Finalmodel.m (1127796, 2023-06-01)
Problem\allocation4DC\Parameter.m (1952, 2023-06-01)
Problem\allocation4DC\RandomSolution.m (57, 2023-06-01)
... ...

# Allocation of Distribution Centers This project addresses the allocation problem of customers to potential distribution centers in supply chain networks. The goal is to determine the optimal assignment of customers to distribution centers while considering opening costs and dispatching costs. ## Project Description The repository contains MATLAB code that implements three algorithms for solving this allocation problem: Genetic Algorithm (GA), Keshtel Algorithm (KA), and Simulated Annealing (SA). The algorithms are based on the research paper titled ["Solving the Allocation of Customers to Potential Distribution Centers in Supply Chain Networks by GA, KA, SA"](https://www.researchgate.net/publication/317101536_Solving_the_Allocation_of_Customers_to_Potential_Distribution_Centers_in_Supply_Chain_Networks_by_GA_KA_SA). The allocation problem is a critical issue in supply chain networks, involving the selection of potential distribution centers and the optimization of costs associated with opening and dispatching. The project utilizes the Taguchi experimental design method to determine the best parameters for each algorithm and evaluates their efficiency using test problems. The computational results of each algorithm are compared, and the performance is examined for different problem sizes. ## Usage To use this project, follow these steps: 1. Clone or download the project repository. 2. Ensure that you have MATLAB installed on your system. 3. Open MATLAB and navigate to the project directory. 4. Run the MATLAB scripts that correspond to the desired algorithm (GA, KA, SA) to solve the allocation problem. Note: Modify the scripts or incorporate the algorithms into your own MATLAB projects as needed. ## Contributing If you would like to contribute to this project, you can fork the repository, make your changes, and submit a pull request. Your contributions and ideas are welcome! ## Citation If you use this project for your research or reference, please consider citing the original research paper authored by Majid Sohrabi, Ilia Abolhasani, and Mostafa Hajiaghaei-Keshteli: Sohrabi, M., Abolhasani, I., Hajiaghaei-Keshteli, M. ["Solving the Allocation of Customers to Potential Distribution Centers in Supply Chain Networks by GA, KA, SA"](https://www.researchgate.net/publication/317101536_Solving_the_Allocation_of_Customers_to_Potential_Distribution_Centers_in_Supply_Chain_Networks_by_GA_KA_SA). We appreciate your acknowledgement of the authors' work in your research. ## License This project is licensed under the [MIT License](LICENSE).

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：