Category: <span>Additions1</span>

A stochastic time-dependent green capacitated vehicle routing and scheduling problem with time window, resiliency and reliability: a case study

© 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 …

Multi-type ant system algorithm for the time dependent vehicle routing problem with time windows

© 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. …

A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times

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 …

An integer programming approach for the time-dependent traveling salesman problem with time windows

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 …

A Simulation Based Restricted Dynamic Programming approach for the Green Time Dependent Vehicle Routing Problem

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 …

x
This site uses cookies to make navigation simple and efficient. By continuing you declare that you want to automatically accept the privacy policy. More. Close