Abstract
Abstract Recently, we have concerned the strategic optimization on logistic network design problems and developed an efficient two-level solution method using a meta-heuristic method like tabu search. To cope with extremely large-scale problems, in this paper, we propose an extended algorithm for the parallel computing that utilizes the analogy between the algorithm and the master-worker configuration of PC cluster. To enhance the efficiency, we developed a modified discrete algorithm of particle swarm optimization (PSO) that can deal with binary decision variables. Then, we applied it to a parallel procedure that requires only very small overhead for the parallel computing. Finally, we confirmed that the proposed method can bring about high performance for the parallel computing that is suitable for the present goal and circumstance through numerical experiments.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
