Abstract
Location-routing problems involve simultaneously locating a number of facilities among candidate sites and establishing delivery routes to a set of users in such a way that the total system cost is minimized. This paper presents a survey of such problems. It includes some applications and examples of location-routing problems, a description of the main heuristics that have been developed for such problems, and reviews of various formulations and algorithms used in solving these problems. A more detailed review is given of exact algorithms for the vehicle routing problem, three-index vehicle flow formulations, and two-index vehicle flow formulations and algorithms for symmetrical and non-symmetrical problems. It is concluded that location-routing problem research is a fast-growing area, with most developments occurring over the past few years; however, research is relatively fragmented, often addresses problems which are too specific and contains several voids which have yet to be filled. A number of promising research areas are identified. 137 refs., 3 figs.
Citation Formats
Laporte, G.
Location-routing problems.
Canada: N. p.,
1987.
Web.
Laporte, G.
Location-routing problems.
Canada.
Laporte, G.
1987.
"Location-routing problems."
Canada.
@misc{etde_6622976,
title = {Location-routing problems}
author = {Laporte, G}
abstractNote = {Location-routing problems involve simultaneously locating a number of facilities among candidate sites and establishing delivery routes to a set of users in such a way that the total system cost is minimized. This paper presents a survey of such problems. It includes some applications and examples of location-routing problems, a description of the main heuristics that have been developed for such problems, and reviews of various formulations and algorithms used in solving these problems. A more detailed review is given of exact algorithms for the vehicle routing problem, three-index vehicle flow formulations, and two-index vehicle flow formulations and algorithms for symmetrical and non-symmetrical problems. It is concluded that location-routing problem research is a fast-growing area, with most developments occurring over the past few years; however, research is relatively fragmented, often addresses problems which are too specific and contains several voids which have yet to be filled. A number of promising research areas are identified. 137 refs., 3 figs.}
place = {Canada}
year = {1987}
month = {Jan}
}
title = {Location-routing problems}
author = {Laporte, G}
abstractNote = {Location-routing problems involve simultaneously locating a number of facilities among candidate sites and establishing delivery routes to a set of users in such a way that the total system cost is minimized. This paper presents a survey of such problems. It includes some applications and examples of location-routing problems, a description of the main heuristics that have been developed for such problems, and reviews of various formulations and algorithms used in solving these problems. A more detailed review is given of exact algorithms for the vehicle routing problem, three-index vehicle flow formulations, and two-index vehicle flow formulations and algorithms for symmetrical and non-symmetrical problems. It is concluded that location-routing problem research is a fast-growing area, with most developments occurring over the past few years; however, research is relatively fragmented, often addresses problems which are too specific and contains several voids which have yet to be filled. A number of promising research areas are identified. 137 refs., 3 figs.}
place = {Canada}
year = {1987}
month = {Jan}
}