Next Article in Journal
A Novel Consistent Quality Driven for JEM Based Distributed Video Coding
Previous Article in Journal
Refinement of Background-Subtraction Methods Based on Convolutional Neural Network Features for Dynamic Background
Article Menu

Export Article

Open AccessArticle

A Hyper Heuristic Algorithm to Solve the Low-Carbon Location Routing Problem

1
Key Laboratory of Special Equipment Manufacturing and Advanced Processing Technology, Ministry of Education, Zhejiang University of Technology, Hangzhou 310023, China
2
Mechanical and Automotive Branches, Jiaxing Vocational and Technical College, Jiaxing 314036, China
*
Author to whom correspondence should be addressed.
Algorithms 2019, 12(7), 129; https://doi.org/10.3390/a12070129
Received: 25 May 2019 / Revised: 14 June 2019 / Accepted: 24 June 2019 / Published: 27 June 2019
  |  
PDF [1682 KB, uploaded 28 June 2019]
  |  

Abstract

This paper proposes a low-carbon location routing problem (LCLRP) model with simultaneous delivery and pick up, time windows, and heterogeneous fleets to reduce the logistics cost and carbon emissions and improve customer satisfaction. The correctness of the model is tested by a simple example of CPLEX (optimization software for mathematical programming). To solve this problem, a hyper-heuristic algorithm is designed based on a secondary exponential smoothing strategy and adaptive receiving mechanism. The algorithm can achieve fast convergence and is highly robust. This case study analyzes the impact of depot distribution and cost, heterogeneous fleets (HF), and customer distribution and time windows on logistics costs, carbon emissions, and customer satisfaction. The experimental results show that the proposed model can reduce logistics costs by 1.72%, carbon emissions by 11.23%, and vehicle travel distance by 9.69%, and show that the proposed model has guiding significance for reducing logistics costs. View Full-Text
Keywords: regional low-carbon location-routing problem; time windows; heterogeneous fleets; hyper-heuristic regional low-carbon location-routing problem; time windows; heterogeneous fleets; hyper-heuristic
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Zhang, C.; Zhao, Y.; Leng, L. A Hyper Heuristic Algorithm to Solve the Low-Carbon Location Routing Problem. Algorithms 2019, 12, 129.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top