2019
DOI: 10.3390/su11061596
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Hyper-Heuristic for the Biobjective Regional Low-Carbon Location-Routing Problem with Multiple Constraints

Abstract: With the aim of reducing cost, carbon emissions, and service periods and improving clients’ satisfaction with the logistics network, this paper investigates the optimization of a variant of the location-routing problem (LRP), namely the regional low-carbon LRP (RLCLRP), considering simultaneous pickup and delivery, hard time windows, and a heterogeneous fleet. In order to solve this problem, we construct a biobjective model for the RLCLRP with minimum total cost consisting of depot, vehicle rental, fuel consum… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
41
0
1

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 26 publications
(42 citation statements)
references
References 69 publications
0
41
0
1
Order By: Relevance
“…Higherperformance HLH strategy will be designed to improve solution quality and stability of the currently proposed MOHH. Moreover, we will focus on the alternative frameworks of MOHH like [31,32] and the framework that has a digital twin to repatriate at runtime [33]. In addition, consideration of other carbon emission models will become one of the focuses in the next work.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Higherperformance HLH strategy will be designed to improve solution quality and stability of the currently proposed MOHH. Moreover, we will focus on the alternative frameworks of MOHH like [31,32] and the framework that has a digital twin to repatriate at runtime [33]. In addition, consideration of other carbon emission models will become one of the focuses in the next work.…”
Section: Discussionmentioning
confidence: 99%
“…Objective (20) represents minimization of total cost during optimization of cold chain logistics LRP, including fuel consumption cost, cargo damage cost, transportation cost, refrigeration cost of refrigerated truck, penalty cost of time window, and operation cost of distribution centre; objective (21) represents the shortest vehicle distribution time. Constraint (22) ensures that each customer is served once; constraint (23) ensures that the vehicle has to leave after serving a customer; constraint (24) indicates that each customer can be assigned to one distribution centre only; constraints (25)- (27) indicate that the enabled distribution centre has to serve a customer; constraint (28) ensures that total demand of customers served by each distribution centre is not more than capacity of the distribution centre; constraint (29) ensures that total volume of cargoes carried by each vehicle is not more than its loading capacity; constraint (30) represents temporal connection between two consecutive customer points in a vehicle distribution path; and constraint (31) indicates that the time when a vehicle arrives at a customer point may not be out of the permissible time interval. [25].…”
Section: Location-routing Optimization Modelling For Coldmentioning
confidence: 99%
“…worst, the reason is that the estimation of FCCE depends on plentiful parameters which may change over traveling time. For a comprehensive view of the models and factors, the reader is referred to the surveys [21] and papers [20,[28][29][30][31].…”
Section: Plos Onementioning
confidence: 99%
“…Moreover, as an extensive variant of VRP, the investigation of the green/lowcarbon LRP was not provided. Our previous work [29,30] provided a detailed assessment of the FCCE model for green/low carbon LRP, the solution approach, and the number of optimization objectives. This section provides additional papers on the recently published LCLRP, and other papers are also available in our previous paper [29,30].…”
Section: Lrp Considering Environmental Effectsmentioning
confidence: 99%
“…Owing to the complexity of the CPDPTW, commercial solvers are ineffective in incorporating all the practical factors considered in the problem formulation. Compared with commercial solvers, a heuristic algorithm can offer a series of feasible solutions for practical analysis [57]. The Improved NSGA-II algorithm (INSGA-II) is developed from NSGA and is proposed by Deb et al [58] in order to complement NSGA's lack of elitism and speed [41,59,60].…”
Section: Improved Nsga-ii Algorithmmentioning
confidence: 99%