Min–max and min–max regret criteria are commonly used to define robust solutions. After
motivating the use of these criteria, we present general results. Then, we survey complexity …

The Time Dependent Vehicle Routing Problem (TDVRP) consists in optimally routing a fleet
of vehicles of fixed capacity when travel times are time dependent, in the sense that the time …

We consider a class of routing optimization problems under uncertainty in which all
decisions are made before the uncertainty is realized. The objective is to obtain optimal …

In this chapter a review of recent results on robust discrete optimization is presented. The
most popular discrete and interval uncertainty representations are discussed. Various robust …

The robust deviation shortest path problem with interval data is studied in this paper. After
the formulation of the problem in mathematical terms, an exact algorithm, based on a very …

Many real problems can be modelled as robust shortest path problems on interval digraphs,
where intervals represent uncertainty about real costs and a robust path is not too far from …

In a real-world manufacturing environment featuring a variety of uncertainties, production
schedules for manufacturing systems often cannot be executed exactly as they are …

The traveling salesman problem is one of the most famous combinatorial optimization
problems and has been intensively studied. Many extensions to the basic problem have also …

In operations research applications we are often faced with the problem of incomplete or
uncertain data. This is caused by a lack of knowledge about the considered system or by a …

This paper presents a generic model for using different decision strategies in multi-criteria,
personalized route planning. Some researchers have considered user preferences in …