A Hyper Heuristic Algorithm to Solve the Low-Carbon Location Routing Problem
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 CP...
Main Authors: | Chunmiao Zhang, Yanwei Zhao, Longlong Leng |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-06-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/12/7/129 |
Similar Items
-
A Hyper-Heuristic Algorithm for Time-Dependent Green Location Routing Problem With Time Windows
by: Chunmiao Zhang, et al.
Published: (2020-01-01) -
A Novel Hyper-Heuristic for the Biobjective Regional Low-Carbon Location-Routing Problem with Multiple Constraints
by: Longlong Leng, et al.
Published: (2019-03-01) -
A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet
by: Behrouz Afshar-Nadjafi, et al.
Published: (2017-01-01) -
A Hyper-Heuristic for the Orienteering Problem With Hotel Selection
by: Alan Toledo, et al.
Published: (2020-01-01) -
An Effective Approach for the Multiobjective Regional Low-Carbon Location-Routing Problem
by: Longlong Leng, et al.
Published: (2019-06-01)