Multi-products Location-Routing problem with Pickup and Delivery - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Multi-products Location-Routing problem with Pickup and Delivery

(1) , (1) , (1)
1

Abstract

An extended variant of Location-Routing Problem namely LRP with Multi-Product and Pickup and Delivery (LRP- MPPD) is considered in this study. The proposed model deals with simultaneously selecting (locating) one or more facilities from a set of potential hub (locations), assigning customers to the selected hubs and defining routes of the vehicles for serving multi-product customers demand in such way that each selected hub must be visited once for delivering, though they can be visited many times for picking up. We propose a mixed integer linear programming formulation and a heuristic approach for this problem. Since there is not any instance compatible with LRP-MPPD in the literature, we have extended known LRP instances to evaluate the performance of the proposed approach. A comparison with CPLEX shows that the proposed algorithm is a viable approach to solve small and large size LRP-MPPD instances.
Not file

Dates and versions

hal-00841498 , version 1 (04-07-2013)

Identifiers

Cite

Younes Rahmani, Ammar Oulamara, Wahiba Ramdane Cherif. Multi-products Location-Routing problem with Pickup and Delivery. ICALT - International Conference on Advanced Logistics and Transport - 2013, May 2013, Sousse, Tunisia. pp.115-122, ⟨10.1109/ICAdLT.2013.6568445⟩. ⟨hal-00841498⟩
133 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More