328. A metaheuristic for the location-or-routing problem with simultaneous pickup and delivery
Invited abstract in session MA-58: Location-Routing Problems, stream Vehicle Routing and Logistics.
Monday, 8:30-10:00Room: Liberty 1.13
Authors (first author is the speaker)
| 1. | Cagri Koc
|
| Department of Industrial Engineering, Hacettepe University | |
| 2. | Busra Olgun
|
| Industrial Engineering, Suleyman Demirel University | |
| 3. | Okan Arslan
|
| HEC Montréal and CIRRELT | |
| 4. | Fulya ALTIPARMAK
|
| Department of Industrial Engineering, Gazi University |
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.
Keywords
- Vehicle Routing
- Metaheuristics
- Mathematical Programming
Status: accepted
Back to the list of papers