Young Researcher and Innovator Conference Grant

A Metaheuristic for the Location-or-Routing Problem with Simultaneous Pickup and Delivery

Çağrı Koç, Hacettepe University, Ankara, Türkiye
Busra Olgun, Suleyman Demirel University, Isparta, Türkiye
Okan Arslan, HEC Montréal and CIRRELT, Montréal, Canada
Fulya Altiparmak, Gazi University, Ankara, Türkiye

34th European Conference on Operational Research (EURO 2025)
Leeds, United Kingdom
22-25 June 2025

Grantee: Çağrı Koç, Hacettepe University, Ankara, Türkiye
Type of publication: Abstract
Type of presentation: Oral

Start date: 2025-06-21
End date: 2025-06-26
Awarded: 2025-03-13
Report approved: 2025-07-22

Abstract

This study addresses the simultaneous pickup and delivery location-or-routing problem, where a distribution network is designed to serve end customers with both pickup and delivery demands. The problem is tackled by optimizing facility locations and vehicle routes. A customer must either fall within the coverage area of a facility or be included in a vehicle route. If a customer is located within the coverage range of one or more facilities, the customer can be served directly or through vehicle-based service. The coverage range represents the customer’s ability to travel to the facility independently. Conversely, customers outside the coverage area require vehicle-based service, where their pickup and delivery demands are met simultaneously by the same vehicles. The objective is to determine the optimal facility locations and vehicle routes that minimize total costs. We formulate the problem as a mixed-integer linear programming model and solve it using a commercial solver. We develop a metaheuristic based on adaptive large neighborhood search to effectively solve the problem. Extensive computational experiments are conducted on a set of generated instances, derived from multiple benchmark datasets in the literature, to analyze the problem’s characteristics.