We address an integrated logistics system where decisions on location of depot, vehicle routing are considered simultaneously. Total cost and service quality are common criteria influencing decision-making. Literature on location routing problem (LRP) addressed the location and vehicle routing decisions with a common assumption that each vehicle can only performance pickup or delivery assignment in each dispatch. However, both demands of each customer often require be satisfied at the same time. In this paper we consider a LRP with simultaneous pickup and delivery to minimize total cost and customer waiting time. We formulate a nonlinear multi-objective integrated programming model for the problem. A heuristic algorithm based on tabu search is proposed to solve the large-size problem. 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. Results show that the proposed heuristic approach is computationally efficient in finding good quality solutions.
[1]
Said Salhi,et al.
The effect of ignoring routes when locating depots
,
1989
.
[2]
Ismail Karaoglan,et al.
A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
,
2011,
Eur. J. Oper. Res..
[3]
F. Altiparmak,et al.
The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach
,
2012
.
[4]
Roberto D. Galvão,et al.
Vehicle Routing Problems with Simultaneous Pick-up and Delivery Service
,
2002
.
[5]
C. K. Y. Lin,et al.
A location-routing-loading problem for bill delivery services
,
2002
.
[6]
Laura I. Burke,et al.
A two-phase tabu search approach to the location routing problem
,
1999,
Eur. J. Oper. Res..
[7]
Chinyao Low,et al.
Heuristic solutions to multi-depot location-routing problems
,
2002,
Comput. Oper. Res..