| Article ID: | iaor2000709 |
| Country: | Greece |
| Volume: | 10 |
| Issue: | 1 |
| Start Page Number: | 109 |
| End Page Number: | 128 |
| Publication Date: | Oct 1996 |
| Journal: | Studies In Locational Analysis |
| Authors: | Salhi Sad, Nagy Gbor |
| Keywords: | tabu search |
A nested heuristic approach that uses route length approximation is proposed to solve the location–routing problem. A new estimation formula for route length approximation is also developed. The heuristic is evaluated empirically against the sequential method and a recently developed nested method for location–routing problems. This testing is carried out on a set of problems of 400 customers and around 15 to 25 depots with good results.