## Abstract

Given a set of commodities to be routed over a network, the network design problem with relays involves selecting a route for each commodity and determining the location of relays where the commodities must be reprocessed at certain distance intervals. We propose a hybrid approach based on variable neighborhood search. The variable neighborhood algorithm searches for the route for each commodity and the optimal relay locations for a given set of routes are determined by an implicit enumeration algorithm. We show that dynamic programming can be used to determine the optimal relay locations for a single commodity. Dynamic programming is embedded into the implicit enumeration algorithm to solve the relay location problem optimally for multiple commodities. The special structure of the problem is leveraged for computational efficiency. In the variable neighborhood search algorithm, the routes of the current solution are perturbed and reconstructed to generate neighbor solutions using random and greedy construction heuristics. Computational experiments on three sets of problems (80 instances) show that the variable neighborhood search algorithm with optimal relay allocations outperforms all existing algorithms in the literature.

Original language | English (US) |
---|---|

Pages (from-to) | 137-164 |

Number of pages | 28 |

Journal | Journal of Heuristics |

Volume | 23 |

Issue number | 2-3 |

DOIs | |

State | Published - Jun 1 2017 |

## All Science Journal Classification (ASJC) codes

- Software
- Information Systems
- Computer Networks and Communications
- Control and Optimization
- Management Science and Operations Research
- Artificial Intelligence