Journal ArticleDOI
Integrated Facility Location and Vehicle Routing Models: Recent Work and Future Prospects
TLDR
Recent research related to various modeling approaches for location/routing problems, including comprehensive mathematical programming formulations, analytical approximations, and modified facilitation approaches are discussed.Abstract:
SYNOPTIC ABSTRACTFacility location and vehicle routing are two widely used and studied management science resource planning models. According to the 1986 Statistical Abstract of the United States, freight transportation outlays for local trucking totaled 80.9 billion dollars in 1983. Thus, location/routing decisions have considerable economic importance in domains such as distribution systems planning. Since location and routing decisions are closely related, integrated models that consider the two aspects simultaneously offer the promise of more effective and economical decisions. However, such integrated models are complex and their design poses challenges in combining the short-term operational considerations of vehicle routing with the medium/long-term strategic issues of facility location. This paper discusses recent research related to various modeling approaches for location/routing problems, including comprehensive mathematical programming formulations, analytical approximations, and modified faci...read more
Citations
More filters
Journal ArticleDOI
Location-routing: Issues, models and methods
Gábor Nagy,Said Salhi +1 more
TL;DR: This paper proposes a classification scheme and looks at a number of problem variants in location-routing: a relatively new branch of locational analysis that takes into account vehicle routing aspects.
Journal ArticleDOI
Combined Location-Routing Problems: A Synthesis and Future Research Directions
TL;DR: This paper synthesizes the past evolution of location-routing literature and then explores promising research opportunities in incorporation of more realistic aspects, algorithmic design, and model complexity.
Journal ArticleDOI
Two-echelon multiple-vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food
TL;DR: Results indicate that the hybrid approach achieves better solutions compared to others, and that crowding distance method for LSP outperforms the former Grids method.
Journal ArticleDOI
A two-phase tabu search approach to the location routing problem
Dilek Tuzun,Laura I. Burke +1 more
TL;DR: This two-phase architecture makes it possible to search the solution space efficiently, thus producing good solutions without excessive computation, and shows that the TS algorithm achieves significant improvement over a recent effective LRP heuristic.
Journal ArticleDOI
Routing problems: A bibliography
Gilbert Laporte,Ibrahim H. Osman +1 more
TL;DR: This bibliography contains 500 references on four classical routing problems: the Traveling Salesman problem, the Vehicle Routing Problem, the Chinese Postman Problem, and the Rural Postman problem.
References
More filters
Book
Integer programming
TL;DR: The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning, engineering design, and combinatorial optimization as mentioned in this paper, which is a standard of graduate-level courses since 1972.
Journal ArticleDOI
The shortest path through many points
TL;DR: In this paper, it was shown that the length of the shortest closed path through n points in a bounded plane region of area v is almost always asymptotically proportional to √(nv) for large n; and this result was extended to bounded Lebesgue sets in k-dimensional Euclidean space.
Journal ArticleDOI
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
TL;DR: In this paper, the number of days required to clear a check drawn on a bank in a city depends on the city in which the check is cashed and the bank's available funds.
Journal ArticleDOI
The simple plant location problem: Survey and synthesis
Jakob Krarup,Peter Pruzan +1 more
TL;DR: In this paper, the authors consider a family of discrete, deterministic, single-criterion, NP-hard problems, including set packing, set covering, and set partitioning.