Time-dependent routing amounts to design “best” routes in a graph in which arc traversal
times may vary over the planning horizon. In the last decade, a number of technological …

The majority of scheduling research assumes setup as negligible or part of the processing
time. While this assumption simplifies the analysis and/or reflects certain applications, it …

The time dependent vehicle routing problem (TDVRP) is defined as follows. A vehicle fleet of
fixed capacities serves customers of fixed demands from a central depot. Customers are …

Most of the models for vehicle routing reported in the literature assume constant travel times.
Clearly, ignoring the fact that the travel time between two locations does not depend only on …

Production scheduling can be defined as the allocation of available production resources
over time to best satisfy some set of criteria. Typically, the scheduling problem involves a set …

In this paper, we consider the problem of scheduling aircraft (plane) landings at an airport.
This problem is one of deciding a landing time for each plane such that each plane lands …

In this paper, a discrete particle swarm optimization (DPSO) algorithm is presented to solve
the no-wait flowshop scheduling problem with both makespan and total flowtime criteria. The …

The cumulative capacitated vehicle routing problem (CCVRP) is a variation of the classical
capacitated vehicle routing problem in which the objective is the minimization of the sum of …

In this paper we present a formulation for the dynamic vehicle routing problem with time-
dependent travel times. We also present a genetic algorithm to solve the problem. The …

We propose the vehicle routing problem with roaming delivery locations (VRPRDL) to model
an innovation in last-mile delivery where a customer's order is delivered to the trunk of his …