New retail trends show the increasing importance of providing cost efficient deliveries in cities, where congestion and compliance with driving hours regulations should be incorporated into routing software. This paper introduces a large neighbourhood search algorithm that substantially improves the …
In this paper, we introduce several new methods for efficiently evaluating moves in neighborhood search heuristics for routing problems with time-dependent travel times. We consider both the case that route duration is constrained and the case that route duration appears …
© 2020, Springer Science+Business Media, LLC, part of Springer Nature.The multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints (MT-TDVRPSTW-OT) is considered in this paper. The modified hierarchical multi-objective formulation and the equivalent single-objective formulation are proposed. …
The rise of e-commerce has increased the demands placed on pickup and delivery operations, as well as customer expectations regarding the quality of services provided by those operations. One strategy a logistics provider can employ for meeting these increases in …
We present a new solution approach for the time-dependent traveling salesman problem with time windows. This problem considers a salesman who departs from his home, has to visit a number of cities within a predetermined period of time, and then, …
© 2020 IEEE.Recent advancements in cloud computing have driven rapid development in data-intensive smart city applications by providing near real time processing and storage scalability. This has resulted in efficient centralized route planning services such as Google Maps, upon which …
In this paper, we study a single-vehicle routing problem with stochastic service times, stochastic time-dependent travel times, and soft time windows, where the travel times may be interdependent. The objective is to minimize the expected route duration plus penalties for …
This paper provides a framework for solving the Time Dependent Vehicle Routing Problem (TDVRP) by using historical data. The data are used to predict travel times during certain times of the day and derive zones of congestion that can…
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 …