EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

4264. Matheuristic for Feeder Network Design Problem With Optional Paired Demands and Split Delivery

Invited abstract in session WD-64: Heuristics for Vehicle Routing 2, stream VeRoLog - Vehicle Routing and Logistics.

Wednesday, 14:30-16:00
Room: S16 (building: 101)

Authors (first author is the speaker)

1. Anandhu Dileep
Informatics, University of Bergen
2. Ahmad Hemmati
University of Bergen

Abstract

In this work, we study a complex variant of the feeder network design problem (FNDP) arising in the field of maritime transportation. The problem is about designing routes for ship services between several shipping ports, to deliver cargoes between these ports based on a fixed weekly demand. In many cases, this is done using disjoint networks of ships services, called feeder networks.

Each feeder network is connected to a main port by a long ship service called a mother route. Some of the paired demands are delivered by the mother routes themselves, and the remaining demands using daughter routes, which are shorter ship services that branch off from some of the ports in the mother routes.

In the variant of the FNDP studied, we also allow split deliveries of the demands and the rejection of some of the demands. There are time constraints on the routes and on the travel time for delivery of each cargo. We formulate a mathematical model for the problem and propose a matheuristic framework for obtaining high quality solutions.

Keywords

Status: accepted

Back to the list of papers