Browsing by Subject "Vehicle routing problem"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Open Access The location and location-routing problem for the refugee camp network design(Elsevier Ltd, 2021-01) Arslan, O.; Culhan Kumcu, G.; Yetiş Kara, Bahar; Laporte, G.The refugee crisis is one of the major challenges of modern society. The influxes of refugees are usually sudden and the refugees are in sheer need of services such as health care, education and safety. Planning public services under an imminent humanitarian crisis re quires simultaneous strategic and operational decisions. Inspired by a real-world problem that Red Crescent is facing in Southeast Turkey, we study the problem of locating refugee camps and planning transportation of public service providers from their institutions to the located camps. Our modeling approach brings a new facet to the location and routing problem by considering the location of beneficiaries as variables. We develop a branch price-and-cut algorithm for the problem. To solve the pricing problem, we introduce a cycle-eliminating algorithm using nested recursion to generate elementary hop constrained shortest paths. The best version of our algorithm efficiently solves 244-node real-world in stances optimallItem Open Access New exact solution approaches for the split delivery vehicle routing problem(Springer Verlag, 2018) Özbaygın, Gizem; Karasan, Oya Ekin; Yaman, HandeIn this study, we propose exact solution methods for the split delivery vehicle routing problem (SDVRP). We first give a new vehicle-indexed flow formulation for the problem and then a relaxation obtained by aggregating the vehicle-indexed variables over all vehicles. This relaxation may have optimal solutions where several vehicles exchange loads at some customers. We cut off such solutions, in a nontraditional way, either by extending the formulation locally with vehicle-indexed variables or by node splitting. We compare these approaches using instances from the literature and new randomly generated instances. Additionally, we introduce two new extensions of the SDVRP by restricting the number of splits and by relaxing the depot return requirement and modify our algorithms to handle these extensions.