The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem
(3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem
in distribution logistics. The problem requires the combinatorial optimization of a
feasible loading solution and a successive routing of vehicles to satisfy client demands,
where all vehicles must start and terminate at a central depot. In spite of its clear
practical significance...
This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem
(3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem
in distribution logistics. The problem requires the combinatorial optimization of a
feasible loading solution and a successive routing of vehicles to satisfy client demands,
where all vehicles must start and terminate at a central depot. In spite of its clear
practical significance...
Currently displaying 1 –
2 of
2