Multiobjective Green Time-Dependent Location-Routing Problem and Algorithms

Table 2

Parameters and values.

Symbols	Description	Symbols	Description
D	Set of the candidate depots		Travel speed of the vehicle h
C	Set of the customers	Kijh	Load of vehicle h leaving i and traveling to j
qi	The demands of the customer i	STj	Service time of customer j
STj	Service time of customer j	ATjh	The time when vehicle h arrives at node j
xi, yi	Coordinate of the node i	TTij	Travel time between nodes i and j
[ai, ei]	Time window of the node i	yr	1 if depot r is open, and 0 otherwise
Pj	Capacity of the depot j
FDj	Cost of the depot j	zim	1 if customer i is served by depot m, and 0 otherwise
Qh	Capacity of the vehicle h
FVh	Cost of the vehicle h	xijh	1 if customer i is served by depot m, and 0 otherwise
dij	Distance between the two nodes i and j
Fijh	Fuel consumption of the vehicle h from node i to node j