Karaoğlan, İsmailAltıparmak, FulyaKara, İmdatDengiz, Berna2020-03-262020-03-2620110377-22171872-6860https://dx.doi.org/10.1016/j.ejor.2011.01.003https://hdl.handle.net/20.500.12395/26031This paper addresses a location-routing problem with simultaneous pickup and delivery (LRPSPD) which is a general case of the location-routing problem. The LRPSPD is defined as finding locations of the depots and designing vehicle routes in such a way that pickup and delivery demands of each customer must be performed with same vehicle and the overall cost is minimized. We propose an effective branch-and-cut algorithm for solving the LRPSPD. The proposed algorithm implements several valid inequalities adapted from the literature for the problem and a local search based on simulated annealing algorithm to obtain upper bounds. Computational results, for a large number of instances derived from the literature, show that some instances with up to 88 customers and 8 potential depots can be solved in a reasonable computation time. (C) 2011 Elsevier B.V. All rights reserved.en10.1016/j.ejor.2011.01.003info:eu-repo/semantics/closedAccessLogisticsLocation-routing problemSimultaneous pickup and deliveryBranch-and-cutSimulated annealingArticle2112318332Q1WOS:000288308800010Q1