A model for capacitated green vehicle routing problem with the time-varying vehicle speed and soft time windows. (November 2019)

• Record Type: Journal Article
• Authors: Xu, Zhitao; Elomri, Adel; Pokharel, Shaligram; Mutlu, Fatih
• Is Part Of: Computers & industrial engineering. Volume 137(2019)
• Publication Date: 2019-11
• Subjects: Green logistics -- Capacitated vehicle routing problem -- Time-varying speed -- Fuel consumption -- Traveling salesman problem; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2019.106011
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: A novel multi-objective MINLP model for the capacitated green VRP is developed. Allowed vehicle speeds are non-linear time-varying in fuel consumption calculation. The NSGA-II is improved with adaptive strategies and the greedy strategies. The fuel consumption can be decreased with an insignificant decrease in customer satisfaction. Abstract: This paper investigates the capacitated green vehicle routing problem (GVRP) with time-varying vehicle speed and soft time windows. The GVRP is developed as a multi-objective mixed integer nonlinear programming (MINLP) model that incorporates a fuel consumption calculation algorithm. The proposed model considers the vehicle load and capacity as well as time-varying speed in order to account for traffic congestion. An improved non-dominated sorting genetic algorithm (NSGA-II) with adaptive strategies and greedy strategies is developed to solve the GVRP. The results of numerical experiments show that the consumption of fuel in a supply chain can be decreased sharply without any significant loss in customer satisfaction. The proposed NSGA-II has a better capability and efficiency than the original NSGA-II. Our experiments also indicate that the proposed model outperforms most of the best-known solutions obtained from the traditional modeling approaches.