A two-phase hybrid heuristic search approach to the location-routing problem

2006 ◽  
Author(s):  
Xuefeng Wang ◽  
Xiaoming Sun ◽  
Yang Fang
Keyword(s):  
Heuristic Search ◽  
Two Phase ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Hybrid Heuristic ◽  
Location Routing ◽  
Search Approach

The two echelon open location routing problem: Mathematical model and hybrid heuristic

2018 ◽  
Vol 121 ◽  
pp. 97-112 ◽  
Author(s):  
Khosro Pichka ◽  
Amirsaman H. Bajgiran ◽  
Matthew E.H. Petering ◽  
Jaejin Jang ◽  
Xiaohang Yue
Keyword(s):  
Mathematical Model ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Hybrid Heuristic ◽  
Location Routing

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 Presenting a Multi-Start Hybrid Heuristic for Solving the Problem of Two-Echelon Location-Routing Problem with Simultaneous Pickup and Delivery (2E-LRPSPD)

2020 ◽  
Vol 2020 ◽  
pp. 1-24 ◽  
Author(s):  
Houming Fan ◽  
Jiaxin Wu ◽  
Xin Li ◽  
Xiaodan Jiang
Keyword(s):  
Path Relinking ◽  
Mixed Integer ◽  
Computational Time ◽  
Pickup And Delivery ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Hybrid Heuristic ◽  
Location Routing ◽  
Constructive Heuristics ◽  
Simultaneous Pickup And Delivery

This study proposes a three-index flow-based mixed integer formulation to solve a two-echelon location routing problem with simultaneous pickup and delivery. In this formulation, pickup and delivery demands can be addressed using the same vehicle in each echelon of the network to reduce costs and increase logistics efficiency. We solve such NP-hard problem by developing a multistart hybrid heuristic with path relinking (MHH-PR) which is composed of local search and a variable neighbourhood descent algorithm. In the algorithm, three constructive heuristics are applied to generate diversified initial solutions, and path relinking is introduced for intensification and postoptimisation. Results indicate that MHH-PR can reduce the gap between the near optimal and global optimal solutions by 1%-2%. The proposed algorithm significantly improves computational efficiency by reducing the computational time of more than 10 min for existing cases involving 20 nodes to less than 10 s.

Sign in / Sign up

Export Citation Format

Share Document