A Double Traveling Salesman Problem With Three-Dimensional Loading Constraints for Bulky Item Delivery
This article considers bulky item delivery problems in which multiple items are retrieved and loaded onto a vehicle from different warehouses and then delivered. This problem is described as a double traveling salesman problem with three-dimensional container loading constraints with multiple stacks...
Main Authors: | Minzhi Ruan, Chunyue Shen, Jianqiang Tang, Chao Qi, Shuang Qiu |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9321396/ |
Similar Items
-
Solving the clustered traveling salesman problem via traveling salesman problem methods
by: Yongliang Lu, et al.
Published: (2022-06-01) -
The traveling salesman problem : a computational study /
by: Applegate, David L.
Published: (2007) -
Solving travelling salesman problem using nios processor /
by: 560514 Shaikh Nasir Shaikh Husin, et al.
Published: (2007) -
Solving traveling salesman problem using Nios processor /
by: 461278 Lim, Kai Lin
Published: (2006) -
The retrace traveling salesman problem : a new extension of traveling salesman problem /
by: 212543 Juraidawati Arbain
Published: (2003)