XXIV Congresso da Associação Portuguesa de Investigação Operacional (IO2025)

Session

Session 4.1 – Transportation and Delivery

Not scheduled

Room 1

58. A new effective heuristic for the Prisoner transportation problem

José Valério de Carvalho (Centro ALGORITMI/LASI, Departamento de Produção e Sistemas, Universidade do Minho)

Apresentação regular

The Prisoner Transportation Problem is an NP-hard combinatorial problem and a complex variant of the Dial-a-Ride Problem. Given a set of requests for pick-up and delivery and a homogeneous fleet, it consists of assigning requests to vehicles to serve all requests, respecting the problem constraints such as route duration, capacity, ride time, time windows, multi-compartment assignment of...

83. A pickup and delivery problem with automated guided vehicles - modelling approaches

PAULO FERREIRA (ipp.pt)

Apresentação regular

Pickup and Delivery Problems (PDP) and their variants are commonly found in logistics and transportation systems. This work addresses a logistic transport problem where homogeneous vehicles must fulfill transportation requests between pickup and delivery nodes, subject to service level agreements (SLAs). We compare the performance of two Mixed-Integer Linear Programming (MILP) models: one...

43. Last-mile Delivery with Crowdshipping: a multi-objective approach

Tiago Monteiro (FEUP)

Apresentação regular

Crowdshipping has emerged as an innovative solution for last-mile delivery, in which customers can receive their groceries, parcels, or other purchases delivered by ordinary individuals (occasional couriers) instead of by a professional courier. This strategy offers faster, more cost-effective same-day delivery and greater flexibility to meet fluctuating demand. Occasional couriers (OCs) can...

33. Two-index formulations for the Traveling Purchaser Problem with Incompatibility Constraints

Raquel Monteiro De Nobre Costa Bernardino (ISEG-Research)

Apresentação regular

The Traveling Purchaser Problem with Incompatibility Constraints (TPP-IC) generalizes the classical Traveling Purchaser Problem (TPP) by introducing constraints that prevent certain items from being transported together. This problem arises in various real-world applications, such as hazardous materials transportation, where incompatible products must be handled separately to ensure safety and...