© 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. …
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 …
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 …
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 …
© 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 …
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 …
© 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 proposes a fast ant colony system based solution method to solve realistic instances of the time-dependent orienteering problem with time windows within a few seconds of computation time. Orienteering problems occur in logistic situations where an optimal combination …
In this paper, we introduce novel optimization methods for sequencing problems in which the setup times between a pair of tasks depend on the relative position of the tasks in the ordering. Our proposed methods rely on a hybrid approach …
We propose a metaheuristic for the Time-Dependent Pollution-Routing Problem, which consists of routing a number of vehicles to serve a set of customers and determining their speed on each route segment with the objective of minimizing the cost of driver’s …