Exact and Approximate Schemes for Robust Optimization Problems with Decision Dependent Information Discovery

Uncertain optimization problems with decision dependent information discovery allow the decision maker to control the timing of information discovery, in contrast to the classic multistage setting where uncertain parameters are revealed sequentially based on a prescribed filtration. This problem class is useful in a wide range of applications, however, its assimilation is partly limited by … Read more

Solving the Time Dependent Minimum Tour Duration and Delivery Man Problems with Dynamic Discretization Discovery

In this paper, we present exact methods for solving the Time Dependent Minimum Duration Problem (TDMTDP) and the Time Dependent Delivery Man Problem (TD-DMP). Both methods are based on a Dynamic Discretization Discovery (DDD) approach for solving the Time Dependent Traveling Salesman Problem with Time Windows (TD-TSPTW). Unlike the TD-TSPTW, the problems we consider in … Read more

A Branch-and-Check Approach for the Tourist Trip Design Problem with Rich Constraints

The tourist trip design problem is an extension of the orienteering problem applied to tourism. The problem consists in selecting a subset of locations to visit from among a larger set while maximizing the benefit for the tourist. The benefit is given by the sum of the rewards collected at each location visited. We consider … Read more

Location and Allocation of Service Units on a Congested Network with Time Varying Demand Rates

The service system design problem arises in the design of telecommunication networks, refuse collection and disposal networks in public sector, transportation planning, and location of emergency medical facilities. The problem seeks to locate service facilities, determine their capacities and assign users to those facilities under time varying demand conditions. The objective is to minimize total … Read more