Abstract
One group of the optimization problems is Hub location problem. Hub facilities are used in transportation network which are provided transfer of products, information, passengers and postal package through of intermediate node instead of direct transfer. Methodology: One main group of these problems is discrete hub median location that seeks to minimize total transportation cost. Results: In this paper, we present hub median location problem with multiple allocation of non-hub nodes to hub nodes, moreover it is possible to connect non-hub nodes directly with considering a penalty coefficient. Conclusion: The numerical example for CAB25data set -which is related to flow and distance between 25 cities in America- with establishment cost under fuzzy circumstance solved and presented.
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.
