© 1990-2011 Beijing Institute of Aerospace Information.The time dependent vehicle routing problem with time windows (TDVRPTW) is considered. A multi-type ant system (MTAS) algorithm hybridized with the ant colony system (ACS) and the max-min ant system (MMAS) algorithms is proposed. …
© 2018 by the authors.This paper presents a new multi-objective model for a vehicle routing problem under a stochastic uncertainty. It considers traffic point as an inflection point to deal with the arrival time of vehicles. It aims to minimize …
© 2018 Wiley Periodicals, Inc. Given a graph whose arc traversal times vary over time, the Time-Dependent Travelling Salesman Problem consists of finding a Hamiltonian tour of least total duration. In this paper we exploit some properties of the problem …
Vehicle routing problems have drawn researchers’ attention for more than 50 years. Most approaches found in the literature address these problems using the so-called customer-based graph, a complete graph representing the road network, where a node is introduced for every …
© 2017 Elsevier LtdThis paper addresses a real-life delivery problem often encountered by urban perishable product deliverers, in which the providers suffer losses from failed delivery, such as product deterioration or violating customers’ time windows, especially when delivery orders accepted …
Although the Vehicle Routing Problem (VRP) has been broadly addressed in the literature, most of the works consider constant travel times. This is a strong simplification that does not allow to correctly model real world applications. In fact, nowadays, travel …
This paper addresses a Green Time Dependent Capacitated Vehicle Routing Problem that accounts for transportation emissions. The problem has been formulated and solved using Dynamic Programming approach. The applicability of Dynamic Programming in large sized problems is, however, limited due …
Congestion in large cities and populated areas is one of the major challenges in urban logistics, and should be addressed at different planning and operational levels. The Time Dependent Travelling Salesman Problem (TDTSP) is a generalization of the well known …
© 2017 Elsevier LtdThe consideration of pollution in routing decisions gives rise to a new routing framework where measures of the environmental implications are traded off with business performance measures. To address this type of routing decisions, we formulate and …
This paper considers a real operational problem of routing and scheduling a fleet of fuel supply vessels used to service customer ships anchored outside a major port. The problem can be formulated as a rich multi-trip vehicle routing problem, including …