scholarly journals The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach

2019 ◽  
Vol 8 (5) ◽  
pp. 597-631 ◽  
Author(s):  
Kassem Danach ◽  
Shahin Gelareh ◽  
Rahimeh Neamatian Monemi
Keyword(s):  
Lagrangian Relaxation ◽  
Heuristic Approach ◽  
Hub Location ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Single Allocation

An efficient heuristic for a hub location routing problem

2020 ◽  
Author(s):  
Mustapha Ratli ◽  
Dragan Urošević ◽  
Abdessamad Ait El Cadi ◽  
Jack Brimberg ◽  
Nenad Mladenović ◽  
...  
Keyword(s):  
Hub Location ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing

An Location-Routing Problem with Simultaneous Pickup and Delivery in Urban-Rural Dual-Directions Logistics Network

2013 ◽  
Vol 756-759 ◽  
pp. 3423-3429
Author(s):  
Xue Feng Wang
Keyword(s):  
Heuristic Approach ◽  
Pickup And Delivery ◽  
Total System ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Commodity Flow ◽  
Logistics Network ◽  
Location Routing ◽  
Urban Rural ◽  
Simultaneous Pickup And Delivery

The design and optimization of urban-rural dual-directions logistics network is a substantial important issue, which will directly affect the development of the urban-rural integration in China. A reasonable scheme of logistics network will contribute to supply efficient logistics services to customers scattering in urban and rural areas. In this paper, we consider a variant of the Location-Routing-Problem (LRP), namely the LRP with simultaneous pickup and delivery in specially background (LRPSB). The objective of LRPSB is to minimize the total system cost, including depot location cost and vehicle routing cost, and implement and control the effective dual-direct commodity flow to meet customers requirement by simultaneously locating the depots and designing the vehicle routes that satisfy pickup and delivery demand of customer at the same time. A nonlinear mixed integrated programming model is formulated for the problem. Since such integrated logistics network design problems belong to a class of NP-hard problems, we propose a two-phase heuristic approach based on Tabu Search, tp-TS, to solve the large size problem and an initialization procedure to generate an initial solution for the tp-TS. We then empirically evaluate the strengths of the proposed formulations with respect to their ability to find optimal solutions or strong lower bounds, and investigate the effectiveness of the proposed heuristic approach. Computational results show that the proposed heuristic approach is computationally efficient in finding good quality solutions for the LRPSB.

A branch-and-cut algorithm for the partitioning-hub location-routing problem

2011 ◽  
Vol 38 (2) ◽  
pp. 539-549 ◽  
Author(s):  
Daniele Catanzaro ◽  
Eric Gourdin ◽  
Martine Labbé ◽  
F. Aykut Özsoy
Keyword(s):  
Branch And Cut ◽  
Hub Location ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing

scholarly journals Solving Partitioning-Hub Location-Routing Problem using DCA

2012 ◽  
Vol 8 (1) ◽  
pp. 87-102 ◽  
Author(s):  
Anh Son Ta ◽  
◽  
Le Thi Hoai An ◽  
Djamel Khadraoui ◽  
Pham Dinh Tao ◽  
...  
Keyword(s):  
Hub Location ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing

scholarly journals A new formulation and an exact approach for the many-to-many hub location-routing problem

2013 ◽  
Vol 37 (12-13) ◽  
pp. 7465-7480 ◽  
Author(s):  
Ricardo Saraiva de Camargo ◽  
Gilberto de Miranda ◽  
Arne Løkketangen
Keyword(s):  
Hub Location ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Exact Approach ◽  
Location Routing ◽  
The Many ◽  
New Formulation
Sign in / Sign up

Export Citation Format

Share Document