Jeudi 14 Octobre


Retour à la vue des calendrier
Jeudi 14 Octobre
Heure: 10:30 - 11:30
Lieu: Salle B107, bâtiment B, Université de Villetaneuse
Résumé: Incorporating Holding Costs in Continuous-Time Service Network Design: New Model, Relaxation and Exact Algorithm
Description: Roberto Baldacci The continuous-time service network design problem (CTSNDP) occurs widely in practice. It aims to minimize the total operational cost by optimizing schedules of transportation services and routes of shipments for dispatching, which can occur at any time point along a continuous planning horizon. In order to be cost effective, shipments often wait to be consolidated, which incurs holding cost. Despite its importance, the holding cost has not been taken into account in the existing studies on the CTSNDP, since introducing it will significantly complicate the problem and make the solution development very challenging.
To tackle this challenge, we develop a new dynamic discretization discovery algorithm, which can solve the CTSNDP with holding cost to exact optimum. The algorithm is based on a novel relaxation model and several new optimization techniques.
Results from extensive computational experiments validate the efficiency and effectiveness of the new algorithm, as well as demonstrating the benefits that can be gained by taking into account holding costs in solving the CTSNDP. In particular, we show that the significance of the benefits depends on the connectivity of the underline physical network and the flexibility of the shipments’ time requirements.