A study on carbon reduction in the vehicle routing problem with simultaneous pickups and deliveries

@article{Huang2012ASO,
  title={A study on carbon reduction in the vehicle routing problem with simultaneous pickups and deliveries},
  author={Yixiao Huang and Chun-Hui Shi and Lei Zhao and Tom van Woensel},
  journal={Proceedings of 2012 IEEE International Conference on Service Operations and Logistics, and Informatics},
  year={2012},
  pages={302-307}
}
Reducing greenhouse gases (GHG), especially carbon dioxide, has become a critical environmental issue worldwide and has attracted attentions in all economic sectors and industries. Ranking the second in cargo turnover volume in China, road cargo transportation has become a key carbon reduction field in the country. In this paper, we study the vehicle routing problem with simultaneous pickups and deliveries (VRPSPD), a commonly encountered practice in road cargo transportation, especially… 

Figures and Tables from this paper

A variable neighborhood search to reduce carbon dioxide emissions in the capacitated vehicle routing problem

  • D. TayachiH. Boukadi
  • Business
    2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)
  • 2019
This paper tackles one of the Green Vehicle Routing Problems which consists in minimizing the carbon dioxide emissions for the capacitated vehicle routing problem and a new variable neighborhood search algorithm is proposed to solve it.

Heterogeneous Fleet Green Vehicle Routing Problem: A Literature Review

The purpose of this study is to review the development of GVRP with heterogeneous alternative fuel vehicles and the gap or state-of-the-art on existing researches.

Vehicle Routing and Scheduling Optimization of Ship Steel Distribution Center under Green Shipbuilding Mode

Timeliness of steel distribution centers can effectively ensure the smooth progress of ship construction, but the carbon emissions of vehicles in the distribution process are also a major source of

Study on Cold Chain Logistics with Time Windows Based on Carbon Emissions Considering Simultaneous Pick Up and Distribution

  • Mingzheng GongSheng Liu
  • Business
    2019 8th International Conference on Industrial Technology and Management (ICITM)
  • 2019
A multi-vehicle transportation model for simultaneous picking and distribution on the basis of fully considering carbon emissions and time windows is established, which shows that the genetic algorithm can solve this problem, and proves the feasibility and effectiveness of the model.

Optimization of Green Logistic Distribution Routing Problem with Multi Depot Using Improved Simulated Annealing

In the present study, modified probability of accepting criteria (MPAC) has been developed and the performance of Improved Simulated Annealing (ISA) is effective in solving G-VRPMD.

Solving the green capacitated vehicle routing problem using a tabu search algorithm

This paper analyses how the tabu search can be successfully applied to solve the Green Capacitated Vehicle Routing ProblemsGCVRP. This kind of problems has been described as the classical Capacitated

A Multi-Objective Optimization Model for Split Pollution Routing Problem with Controlled Indoor Activities in Cross Docking under Uncertainty

An optimization model is presented for split loading and unloading products by suppliers and customers, vehicle routing with fuzzy possibilistic time window constraints among them, assignment of vehicles tocross dock, consolidation and integration of products in cross dock, and allocation of sorted products to outbound vehicles.

References

SHOWING 1-10 OF 16 REFERENCES

The Pollution-Routing Problem

Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up

The proposed algorithm is successfully applied to a real-life problem as well as test instances introduced in the literature earlier and randomly generated instances are tackled in order to try to determine favorable settings for the parameters used in the solution approach.

Vehicle routing problem with simultaneous deliveries and pickups

An insertion-based procedure to generate good initial solutions and a heuristic based on the record-to-record travel, tabu lists, and route improvement procedures are proposed to resolve the vehicle routing problems with simultaneous deliveries and pickups.

The Green Vehicle Routing Problem

A Mixed Integer Linear Program formulation for the problem and a Local Search algorithm to find local optima for the GVRP, which includes an objective function that minimizes weighted distance.