Integrated Facility Location and Vehicle Routing Models: Recent Work and Future Prospects

1987 ◽  
Vol 7 (1-2) ◽  
pp. 35-61 ◽  
Author(s):  
Anantaram Balakrishnan ◽  
James E. Ward ◽  
Richard T. Wong
Keyword(s):  
Facility Location ◽  
Vehicle Routing ◽  
Recent Work ◽  
Future Prospects ◽  
Integrated Facility ◽  
Routing Models

scholarly journals An auction for collaborative vehicle routing: Models and algorithms

2020 ◽  
Vol 9 (2) ◽  
pp. 100009
Author(s):  
Vincentius C.G. Karels ◽  
Lucas P. Veelenturf ◽  
Tom Van Woensel
Keyword(s):  
Vehicle Routing ◽  
Routing Models

A Two-Phase Meta Heuristic Approach to the Location-Routing Problem for Transportation Network Planning

2013 ◽  
Vol 361-363 ◽  
pp. 1900-1905 ◽  
Author(s):  
Ji Ung Sun
Keyword(s):  
Ant Colony Optimization ◽  
Facility Location ◽  
Vehicle Routing ◽  
Optimization Algorithm ◽  
Transportation Network ◽  
Ant Colony Optimization Algorithm ◽  
Two Phase ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing

In this paper we consider the location-routing problem which combines the facility location and the vehicle routing decisions. In this type of problem, we have to determine the location of facilities within a set of possible locations and routes of the vehicles to meet the demands of number of customers. Since the location-routing problem is NP-hard, it is difficult to obtain optimal solution within a reasonable computational time. Therefore, a two-phase ant colony optimization algorithm is developed which solves facility location problem and vehicle routing problem hierarchically. Its performance is examined through a comparative study. The experimental results show that the proposed ant colony optimization algorithm can be a viable solution method for the general transportation network planning.

scholarly journals A Nonlinear Integer Programming Model for Integrated Location, Inventory, and Routing Decisions in a Closed-Loop Supply Chain

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-17 ◽  
Author(s):  
Hao Guo ◽  
Congdong Li ◽  
Ying Zhang ◽  
Chunnan Zhang ◽  
Yu Wang
Keyword(s):  
Supply Chain ◽  
Integer Programming ◽  
Facility Location ◽  
Vehicle Routing ◽  
Closed Loop ◽  
Programming Model ◽  
Nonlinear Integer Programming ◽  
Inventory Routing ◽  
Closed Loop Supply Chain ◽  
Integer Programming Model

Facility location, inventory management, and vehicle routing are three important decisions in supply chain management, and location-inventory-routing problems consider them jointly to improve the performance and efficiency of today’s supply chain networks. In this paper, we study a location-inventory-routing problem to minimize the total cost in a closed-loop supply chain that has forward and reverse logistics flows. First, we formulate this problem as a nonlinear integer programming model to optimize facility location, inventory control, and vehicle routing decisions simultaneously in such a system. Second, we develop a novel heuristic approach that incorporates simulated annealing into adaptive genetic algorithm to solve the model efficiently. Last, numerical analysis is presented to validate our solution approach, and it also provides meaningful managerial insight into how to improve the closed-loop supply chain under study.

Risk-averse optimization of disaster relief facility location and vehicle routing under stochastic demand

2020 ◽  
Vol 141 ◽  
pp. 102015 ◽  
Author(s):  
Shaopeng Zhong ◽  
Rong Cheng ◽  
Yu Jiang ◽  
Zhong Wang ◽  
Allan Larsen ◽  
...  
Keyword(s):  
Facility Location ◽  
Vehicle Routing ◽  
Disaster Relief ◽  
Stochastic Demand ◽  
Risk Averse

scholarly journals Exact algorithms for integrated facility location and production planning problems

2011 ◽  
Vol 58 (5) ◽  
pp. 419-436 ◽  
Author(s):  
Thomas C. Sharkey ◽  
Joseph Geunes ◽  
H. Edwin Romeijn ◽  
Zuo-Jun Max Shen
Keyword(s):  
Facility Location ◽  
Production Planning ◽  
Exact Algorithms ◽  
Integrated Facility ◽  
Planning Problems

Routing

2013 ◽  
pp. 39-46 ◽  
Author(s):  
Kevin M. Curtin
Keyword(s):  
Vehicle Routing ◽  
Traveling Salesman Problem ◽  
Research Area ◽  
Traveling Salesman ◽  
Heuristic Solution ◽  
Routing Problems ◽  
Shortest Path Problems ◽  
The Traveling Salesman Problem ◽  
Large Research ◽  
Routing Models

Routing is the act of selecting a course of travel. Routing problems are one of the most prominent and persistent problems in geoinformatics. This large research area has a strong theoretical foundation with ties to operations research and management science. There are a wide variety of routing models to fit many different application areas, including shortest path problems, vehicle routing problems, and the traveling salesman problem, among many others. There are also a range of optimal and heuristic solution procedures for solving instances of those problems. Research is ongoing to expand the types of routing problems that can be solved, and the environments within which they can be applied.

Sign in / Sign up

Export Citation Format

Share Document