A hybrid meta-heuristic algorithm for solving real-life transportation network design problems

@inproceedings{Bagloee2013AHM,
  title={A hybrid meta-heuristic algorithm for solving real-life transportation network design problems},
  author={Saeed Asadi Bagloee and Madjid Tavana and Avishai Ceder and Claire Bozic and Mohsen Asadi},
  year={2013}
}
The network-design problem (NDP) has a wide range of applications in transportation, telecommunications, and logistics. The idea is to efficiently design a network of links (roads, optical fibres, etc.) enabling the flow of commodities (drivers, data packets, etc.) to satisfy demand characteristics. Various exact and heuristic methods such as branch and bound, Tabu search, genetic algorithm (GA), ant system (AS) have been developed to address the NDP which is a highly intractable combinatorial… CONTINUE READING

Citations

Publications citing this paper.

Applying the Discrete Network Design Problem (DNDP) for designing AMHS layouts in semiconductor fabs

  • 2018 29th Annual SEMI Advanced Semiconductor Manufacturing Conference (ASMC)
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND