Abstract
We introduce the single allocation p-hub median location and routing problem with simultaneous pick-up and delivery based on observations from real life hub networks. The aim of our problem is to minimize the cost of transferring the flow between hubs and routing the flow in the network. We propose several mixed integer programming formulations and two heuristic approaches based on multi start simulated annealing and ant colony system to solve these problems. Extensive results demonstrate that using our methods good solutions can be found despite the computationally challenging nature of the problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
