Pickup and Delivery Problem of Automobile Outbound Logistics Considering Trans-Shipment among Distribution Centers
This paper considers a pickup and delivery problem in automobile logistics. In the daily operations of a third-party logistics company (3PL), decisions must be made for two kinds of demands: delivering finished automobiles from an outbound warehouse to distribution centers (DCs) and transferring aut...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-09-01
|
| Series: | Systems |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-8954/11/9/457 |
| _version_ | 1797576522369859584 |
|---|---|
| author | Yu Wang Renrong Zheng Yan Zhao Chengji Liang |
| author_facet | Yu Wang Renrong Zheng Yan Zhao Chengji Liang |
| author_sort | Yu Wang |
| collection | DOAJ |
| description | This paper considers a pickup and delivery problem in automobile logistics. In the daily operations of a third-party logistics company (3PL), decisions must be made for two kinds of demands: delivering finished automobiles from an outbound warehouse to distribution centers (DCs) and transferring automobiles among the DCs according to specific customer orders. The problem is to assign a set of automobiles to a set of heterogeneous auto-carriers and deliver them to their destinations considering the outbound and transfer demands. Each automobile is assigned a value indicating its urgency level to be handled and a car type: small, medium, or large. Each of the auto-carriers has a specific number of slots with different types indicating the largest size of an automobile that can be loaded into the slot. An integer programming (IP) model is formulated for the problem to maximize the total loaded value and minimize the total transportation cost depending on the routing of the carriers. An improved adaptive large neighborhood search algorithm is developed to solve the problem efficiently, where a heuristic generates an initial solution, and a series of operators update the solution iteratively. Experimental results based on multi-scale instances show that the proposed algorithm can generate near-optimal solutions in an acceptable amount of time, and outperforms solving the IP model directly by CPLEX to a large extent. The algorithm can help 3PL companies make efficient and economical decisions in daily operations. |
| first_indexed | 2024-03-10T21:54:15Z |
| format | Article |
| id | doaj.art-1d9577d766bd4f858a4371f4e162f5d0 |
| institution | Directory Open Access Journal |
| issn | 2079-8954 |
| language | English |
| last_indexed | 2024-03-10T21:54:15Z |
| publishDate | 2023-09-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Systems |
| spelling | doaj.art-1d9577d766bd4f858a4371f4e162f5d02023-11-19T13:13:14ZengMDPI AGSystems2079-89542023-09-0111945710.3390/systems11090457Pickup and Delivery Problem of Automobile Outbound Logistics Considering Trans-Shipment among Distribution CentersYu Wang0Renrong Zheng1Yan Zhao2Chengji Liang3Logistics Research Center, Institute of Logistics Science and Engineering, Shanghai Maritime University, Shanghai 201306, ChinaLogistics Research Center, Institute of Logistics Science and Engineering, Shanghai Maritime University, Shanghai 201306, ChinaLogistics Research Center, Institute of Logistics Science and Engineering, Shanghai Maritime University, Shanghai 201306, ChinaLogistics Research Center, Institute of Logistics Science and Engineering, Shanghai Maritime University, Shanghai 201306, ChinaThis paper considers a pickup and delivery problem in automobile logistics. In the daily operations of a third-party logistics company (3PL), decisions must be made for two kinds of demands: delivering finished automobiles from an outbound warehouse to distribution centers (DCs) and transferring automobiles among the DCs according to specific customer orders. The problem is to assign a set of automobiles to a set of heterogeneous auto-carriers and deliver them to their destinations considering the outbound and transfer demands. Each automobile is assigned a value indicating its urgency level to be handled and a car type: small, medium, or large. Each of the auto-carriers has a specific number of slots with different types indicating the largest size of an automobile that can be loaded into the slot. An integer programming (IP) model is formulated for the problem to maximize the total loaded value and minimize the total transportation cost depending on the routing of the carriers. An improved adaptive large neighborhood search algorithm is developed to solve the problem efficiently, where a heuristic generates an initial solution, and a series of operators update the solution iteratively. Experimental results based on multi-scale instances show that the proposed algorithm can generate near-optimal solutions in an acceptable amount of time, and outperforms solving the IP model directly by CPLEX to a large extent. The algorithm can help 3PL companies make efficient and economical decisions in daily operations.https://www.mdpi.com/2079-8954/11/9/457automobile outbound logisticspickup and deliverytrans-shipment among distribution centersadaptive large neighborhood search |
| spellingShingle | Yu Wang Renrong Zheng Yan Zhao Chengji Liang Pickup and Delivery Problem of Automobile Outbound Logistics Considering Trans-Shipment among Distribution Centers Systems automobile outbound logistics pickup and delivery trans-shipment among distribution centers adaptive large neighborhood search |
| title | Pickup and Delivery Problem of Automobile Outbound Logistics Considering Trans-Shipment among Distribution Centers |
| title_full | Pickup and Delivery Problem of Automobile Outbound Logistics Considering Trans-Shipment among Distribution Centers |
| title_fullStr | Pickup and Delivery Problem of Automobile Outbound Logistics Considering Trans-Shipment among Distribution Centers |
| title_full_unstemmed | Pickup and Delivery Problem of Automobile Outbound Logistics Considering Trans-Shipment among Distribution Centers |
| title_short | Pickup and Delivery Problem of Automobile Outbound Logistics Considering Trans-Shipment among Distribution Centers |
| title_sort | pickup and delivery problem of automobile outbound logistics considering trans shipment among distribution centers |
| topic | automobile outbound logistics pickup and delivery trans-shipment among distribution centers adaptive large neighborhood search |
| url | https://www.mdpi.com/2079-8954/11/9/457 |
| work_keys_str_mv | AT yuwang pickupanddeliveryproblemofautomobileoutboundlogisticsconsideringtransshipmentamongdistributioncenters AT renrongzheng pickupanddeliveryproblemofautomobileoutboundlogisticsconsideringtransshipmentamongdistributioncenters AT yanzhao pickupanddeliveryproblemofautomobileoutboundlogisticsconsideringtransshipmentamongdistributioncenters AT chengjiliang pickupanddeliveryproblemofautomobileoutboundlogisticsconsideringtransshipmentamongdistributioncenters |