EURO 2025 Leeds
Abstract Submission

2328. Branch-and-Price Approach for Two-Echelon Vehicle Routing Problem with Vehicle Synchronization

Invited abstract in session WD-58: Exact Algorithms for Vehicle Routing, stream Vehicle Routing and Logistics.

Wednesday, 14:30-16:00
Room: Liberty 1.13

Authors (first author is the speaker)

1. Milad Elyasi
Industrial Engineering, Ozyegin Universiity
2. Edhem Sakarya
Industrial Engineering and Innovation Sciences, Eindhoven University of Technology
3. Sonja Rohmer
Department of Logistics and Operations Management, HEC Montreal
4. Okan Ozener
Industrial Engineering, Ozyegin University
5. Ali Ekici
Industrial Engineering, Ozyegin University
6. Tom van Woensel
Technische Universiteit Eindhoven

Abstract

The rapid rise of e-commerce and grocery deliveries in urban areas is putting pressure on city infrastructure, leading to increased freight traffic, worsening congestion, and higher levels of air and noise pollution. This study addresses these challenges by proposing the Two-Echelon Prize-Collecting Vehicle Routing Problem with Time Windows and Vehicle Synchronization. The model utilizes smaller low- or zero-emission vehicles for deliveries, supported by larger trucks. Smaller vehicles, limited in capacity, handle small orders and require replenishment at depots or via larger trucks, which can also deliver both small and large items. Coordinating these fleets in cities, while considering capacity limits, tight delivery windows, vehicle synchronization, and selective order fulfillment, is complex. The problem is modeled on a time-expanded network, with network reduction applied to account for time constraints. A branch-and-price algorithm is introduced, solving instances with up to 200 customers and outperforming a leading optimization solver. The study also offers insights on synchronization, fleet management, and optimal depot/satellite placement.

Keywords

Status: accepted

Back to the list of papers