In this paper we study the Time-Dependent Elementary Shortest Path Problem with Resource Constraints (TDESPPRC). We consider two integer programming formulations which exploit the characteristics of the time-dependent ...

In the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows, the set of customers is the union of delivery customers and pickup customers. A fleet of identical capacitated vehicles based at the depot ...

In this paper we consider a game theory approach for representing a real-world attacker–defender Stackelberg security game. In this novel approach the behavior of an ergodic system (repeated stochastic Markov chain game) ...

The Shortest-path problem with timewindows and capacity constraints (SPPTWCC) is a problem used for solving vehicle-routing and crewscheduling applications. The SPPTWCC occurs as a sub-problem used to implicitly generate ...

This paper addresses the multitrip Cumulative Capacitated Single-Vehicle Routing Problem (mt-CCSVRP). In this problem inspired by disaster logistics, a single vehicle can perform successive trips to serve a set of affected ...

This dissertation introduces the Restricted Robust Shortest Path problem (R-RSP), a robust optimization version of the Restricted Shortest Path problem (R-SP), a classical NP-hard problem. Given a digraph G, we associate ...