THE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS

Authors

  • Babaee Tirkolaee, E.
  • Dehnavi - Arani, S.
  • Goli, A.
  • Mirmohammadi, S. H.
Abstract:

The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip is developed with this assumption that urban traffic would disrupt timely services. The objective function of proposed problem is to minimize the total amount of carbon dioxide emissions produced by the vehicle, earliness and lateness penalties costs and costs of used vehicles. At first, a novel linear integer mathematical model is formulated and then the model is validated via solving some test problems by CPLEX solver. Finally, the sensitivity analysis is carried out to study the role of two critical parameters in the optimal solution.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

The Periodic Green Vehicle Routing Problem with Considering of Time-dependent Urban Traffic and Time Windows

The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...

full text

Location-Routing Problem with Fuzzy Time Windows and Traffic Time

The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard ...

full text

Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands

The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...

full text

location-routing problem with fuzzy time windows and traffic time

the location-routing problem is a relatively new branch of logistics system. its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. in this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. another important issue in this regard ...

full text

Matheuristics for the Periodic Vehicle Routing Problem with Time Windows

We investigate two matheuristic strategies using the periodic vehicle routing problem with time windows as a testbed. Two different metaheuristics are suitably combined with parts of a developed column generation approach: On the one hand a variable neighborhood search (VNS) acts as the sole provider of columns for a set covering model, hence realizing a pure metaheuristic column generation. He...

full text

Acceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows

The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 7  issue 1

pages  143- 156

publication date 2017-01

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

No Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023