Abstract
We have proposed a new meta-heuristic method termed Hybrid Tabu Search to solve a hierarchical logistics optimization problem. It is formulated as a p-Hub problem with capacity constraint. The method divides the solution procedure into two levels. Its upper level solves a Hub location problem based on the sophisticated Tubu Search and the lower a connecting problem by Dijkstra method in terms of Lagrangean relaxation. We also call attention on the discount effect regarding mass transport. Through numerical experiments, we confirmed that the proposed method outperformed the commercial software known popularly, and can deal with the real life problems effectively.
Sign-in/Register to access full text options 
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 callMore From: The Proceedings of Manufacturing Systems Division Conference
Disclaimer: 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.
