The Inventory Routing Problem (IRP) is an integration of two operational problems: inventory management and routing. The Time-Dependent Travel-Time Constrained (TD-TC-IRP) is a new proposed variant of the IRP where the travelling time between two locations depend on the time …
In recent years, there have been several attempts to use machine learning techniques to improve the performance of exact and approximate optimization algorithms. Along this line of research, the present paper shows how supervised and unsupervised techniques can be used …
Given a graph whose arc traversal times vary over time, the Time-Dependent Travelling Salesman Problem amounts to find a Hamiltonian tour of least total duration. In this paper we exploit a new degree of freedom in the Cordeau et al. …
The mixed capacitated general routing problem (MCGRP) is defined over a mixed graph, for which some nodes, arcs, and edges must be serviced. The problem consists of determining a set of routes of minimum cost that satisfy the demand. Some …
In this paper we implement a branch-price and cut algorithm for a time dependent vehicle routing problem with time windows in which the goal is to minimize the total route duration. The travel time between two customers is given by …
© 2019 Elsevier B.V.The time-dependent vehicle routing problem with time windows (TDVRPTW) is examined in this study. A mathematical model for the TDVRPTW is formulated by considering the time-dependent vehicle speeds, capacity, travel time, wait time, customer demand, service time, …
A time-dependent graph is, informally speaking, a graph structure dynamically changes with time. In such graphs, the weights associated with edges dynamically change over time, that is, the edges in such graphs are activated by sequences of time-dependent elements. Many …
This paper presents a novel extension of vehicle routing problem considering alternative green-fuel powered vehicles in the presence of congestion, with the aim of minimizing CO2 emissions. The travel time and fuel consumption on each arc are not only dependent …
This paper presents an updated and comprehensive review of discrete optimization techniques for solving time-dependent problems, ie decision problems in which activities and resources have to be scheduled over time. Known compact models with continuous variables representing arrival/service/departure times are …