15h30 - 15h55
The Traveling Salesman Problem with Draught Limits
We introduce a new variant of the Traveling Salesman Problem from maritime transportation, namely the Traveling Salesman Problem with Draught Limits (TSP-DL). The new restrictions impose constraints on sequence of visits, weakening the lower bound of the problem. Models, including some cuts, and computational results will be presented.
15h55 - 16h20
An Efficient Hybrid Heuristic Algorithm for Solving the Production Routing Problem
We consider an integrated problem that incorporates production setup, inventory, distribution and routing decisions, which is called the production routing problem (PRP). An efficient hybrid heuristic procedure using the adaptive large neighborhood search framework (ALNS) and linear programming (LP) technique is proposed to solve the problem.
16h20 - 16h45
Workforce Management in Periodic Routing: Modeling and Practice
Service quality and driver efficiency in delivery operations may be enhanced by increasing the regularity with which drivers visit customers. However, such consideration can increase travel distance. In this talk, we discuss how workforce management impacts periodic routing decisions. We review the treatment of workforce management in routing models from the academic literature and commercial software.
16h45 - 17h10
Dynamic and Stochastic Routing in Maritime Industrial Shipping
We address a dynamic and stochastic routing problem in maritime industrial shipping. Three heuristics have been adapted to this problem and tested. Extensive computational experiments show that the use of stochastic information within the proposed solution methods yields average cost savings of 2.5% on a set of realistic test instances.