Dynamic routing occurs when customers are not known in advance, eg for real-time routing.
Two heuristics are proposed that solve the balanced dynamic multiple travelling salesmen …

This paper addresses a dynamic vehicle routing problem related to courier mail services
with explicit consideration of multiple objectives. This problem is modeled as a dynamic …

Given a set of products each with positive discrete demand, and a set of markets selling
products at given prices, the traveling purchaser problem (TPP) looks for a tour visiting a …

Advances in information technology and telecommunications, together with ever-growing
amounts of data, offer opportunities for transportation companies to improve the quality of …

In this paper, we investigate the performances of 32 formulations for the multiple asymmetric
traveling salesman problem (mATSP) from the viewpoint of their tightness and solvability …

Unmanned aerial vehicles (UAVs) are being increasingly used for surveillance missions in
civil and military applications. These vehicles can be heterogeneous in the sense that they …

This paper presents a new heuristic approach for multiple traveling salesmen problem
(mTSP) and other variants of the TSP. In this approach, the TSP and its variants are seen as …

Efficient maritime transportation is heavily dependent on the smooth operation of land
transportation. Swift modal transfers are key to successful intermodal operations. In this …

We analyze several time dependency issues for the selective traveling salesman problem
with time-dependent profits. Specifically, we consider the case in which the profit collected at …

This paper considers the dynamic multi-period vehicle routing problem which deals with the
distribution of orders from a depot to a set of customers over a multi-period time horizon …