Green vehicle routing and scheduling problem with heterogeneous fleet including reverse logistics in the form of collecting returned goods

2020 ◽  
Vol 94 ◽  
pp. 106462
Author(s):  
Reza Alizadeh Foroutan ◽  
Javad Rezaeian ◽  
Iraj Mahdavi
Keyword(s):  
Vehicle Routing ◽  
Reverse Logistics ◽  
Scheduling Problem ◽  
Vehicle Routing And Scheduling ◽  
Routing And Scheduling ◽  
Heterogeneous Fleet

Vehicle routing and scheduling in cross docks with forward and reverse logistics

2018 ◽  
Vol 20 (3) ◽  
pp. 1589-1622 ◽  
Author(s):  
Yaser Kaboudani ◽  
Seyyed Hassan Ghodsypour ◽  
Hamidreza Kia ◽  
Amin Shahmardan
Keyword(s):  
Vehicle Routing ◽  
Reverse Logistics ◽  
Vehicle Routing And Scheduling ◽  
Routing And Scheduling

scholarly journals A Combinatorial Benders’ Cuts Algorithm for the Local Container Drayage Problem

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Zhaojie Xue ◽  
Canrong Zhang ◽  
Peng Yang ◽  
Lixin Miao
Keyword(s):  
Vehicle Routing ◽  
Numerical Experiments ◽  
Operation Mode ◽  
Scheduling Problem ◽  
Temporal Constraints ◽  
Vehicle Routing And Scheduling ◽  
Routing And Scheduling ◽  
Empty Containers ◽  
Operation Cost

This paper examines the local container drayage problem under a special operation mode in which tractors and trailers can be separated; that is, tractors can be assigned to a new task at another location while trailers with containers are waiting for packing or unpacking. Meanwhile, the strategy of sharing empty containers between different customers is also considered to improve the efficiency and lower the operation cost. The problem is formulated as a vehicle routing and scheduling problem with temporal constraints. We adopt combinatorial benders’ cuts algorithm to solve this problem. Numerical experiments are performed on a group of randomly generated instances to test the performance of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document