A polyhedral approach to the asymmetric traveling salesman problem
Management Science
Heuristics for the traveling salesman problem with pickup and delivery
Computers and Operations Research
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
The pickup and delivery traveling salesman problem with first-in-first-out loading
Computers and Operations Research
INFORMS Journal on Computing
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
Networks - Networks Optimization Workshop, August 22–25, 2006
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
Computers and Operations Research
The Traveling Salesman Problem with Draft Limits
Computers and Operations Research
The vehicle routing problem with restricted mixing of deliveries and pickups
Journal of Scheduling
A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
Computers and Operations Research
Hi-index | 0.00 |
This paper introduces a new variant of the one-to-many-to-one single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The simultaneous optimization of routing and handling costs is difficult, and the resulting loading patterns are hard to implement in practice. However, this option makes economical sense in contexts where the routing cost dominates the handling cost. We have proposed some simplified policies applicable to such contexts. The first is a two-phase heuristic in which the tour having minimum routing cost is initially determined by optimally solving an SVPDP, and the optimal handling policy is then determined for that tour. In addition, branch-and-cut algorithms based on integer linear programming formulations are proposed, in which routing and handling decisions are simultaneously optimized, but the handling decisions are restricted to three simplified policies. The formulations are strengthened by means of problem specific valid inequalities. The proposed methods have been extensively tested on instances involving up to 25 customers and hundreds of items. Our results show the impact of the handling aspect on the customer sequencing and indicate that the simplified handling policies favorably compare with the optimal one.