A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs
Sign Up to like & getrecommendations! Published in 2022 at "Networks"
DOI: 10.1002/net.22096
Abstract: In the Pickup‐and‐Delivery Traveling Salesman Problem with Handling Costs (PDTSPH), a single vehicle has to satisfy multiple customer requests, each defined by a pickup location and a delivery location. Cargo handling is performed at the… read more here.
Keywords: pickup delivery; salesman problem; delivery traveling; traveling salesman ... See more keywords