We present a branch-price-and-cut method to solve a maritime pickup and delivery problem with time windows and split loads. The fleet of ships is heterogen...

Operational problems arising in the planning of integrated supply chains have been increasingly studied in the past decade. Among these, the production rout...

The production-routing problem can be seen as a combination of two well known combinatorial optimization problems: the lotsizing and the vehicle routing prob...

In the rail industry, profit maximization relies heavily on the integration of logistics activities with an improved management of revenues. The operational ...

This paper proposes a construction heuristic and an adaptive large neighborhood search heuristic for the technician and task scheduling problem arising in a ...

The <i>Dial-a-Ride Problem</i> (DARP) consists of designing vehicle routes and schedules for <i>n</i> users who specify pickup and delivery requests between...

In one-to-one <i>Pickup and Delivery Problems</i> (PDPs), the aim is to design a set of least cost vehicle routes starting and ending at a common depot in o...

This paper considers large shift scheduling problems with different shift start times and lengths, fractionable breaks and work stretch duration restrictions...

Earth observation satellites are platforms equipped with optical instruments that orbit the Earth in order to take photographs of specific areas at the requ...

This paper considers a shift scheduling problem that includes different forms of flexibility in terms of shift starting times, break lengths and break plac...

This article reviews some of the best metaheuristics proposed in recent years for the Vehicle Routing Problem. These are based on local search, on populatio...

The integrated aircraft routing and crew scheduling problem consists in determining a minimum-cost set of aircraft routes and crew pairings such that each fl...

This chapter describes some of the most important models and algorithms for the classical vehicle routing problem and for several families of arc routing pr...

This paper introduces a new integrated model for the combined day-off and shift scheduling problem (the tour scheduling problem). This model generalizes the...

This article describes a tabu search heuristic for the <i>Dial-a-Ride Problem</i> with the following characteristics. Users specify transportation requests ...

The <i>Dial-a-Ride Problem</i> (DARP) consists of designing vehicle routes and schedules for <i>n</i> users who specify pick-up and drop-off requests betwee...

This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first desc...

In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. O...

Assigning locomotives and cars to a set of scheduled trains is a complex but important problem for passenger railways. This task is normally carried out in ...

Given a set of flight legs to be flown by a single type of aircraft, the simultaneous aircraft routing and crew scheduling problem consists of determining a...