Dynamic programming approaches for the traveling salesman problem with drone
Sign Up to like & getrecommendations! Published in 2018 at "Networks"
DOI: 10.1002/net.21864
Abstract: A promising new delivery model involves the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a truck and a drone gives rise to a new planning problem that… read more here.
Keywords: drone; salesman problem; traveling salesman; problem drone ... See more keywords
Modeling the flying sidekick traveling salesman problem with multiple drones
Sign Up to like & getrecommendations! Published in 2021 at "Networks"
DOI: 10.1002/net.22022
Abstract: This article considers a version of the flying sidekick traveling salesman problem in which parcels are delivered to customers by either a truck or a set of identical flying drones. The flights of the drones… read more here.
Keywords: sidekick traveling; problem; traveling salesman; salesman problem ... See more keywords
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
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
Sign Up to like & getrecommendations! Published in 2022 at "Networks"
DOI: 10.1002/net.22125
Abstract: In this article, we study the multi‐depot family traveling salesman problem (MDFTSP) and two clustered variants, the soft‐clustered MDFTSP (SC‐MDFTSP) and the hard‐clustered MDFTSP. We emphasize the relevance of this study by relating the problems… read more here.
Keywords: clustered variants; multi depot; family traveling; depot family ... See more keywords
Discrete greedy flower pollination algorithm for spherical traveling salesman problem
Sign Up to like & getrecommendations! Published in 2017 at "Neural Computing and Applications"
DOI: 10.1007/s00521-017-3176-4
Abstract: This paper deals with the spherical traveling salesman problem. In this problem, all cities are located on the surface of a sphere and the cities must be visited exactly once in a tour. We propose… read more here.
Keywords: salesman problem; traveling salesman; flower pollination; spherical traveling ... See more keywords
A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem
Sign Up to like & getrecommendations! Published in 2020 at "Annals of Operations Research"
DOI: 10.1007/s10479-020-03789-0
Abstract: This article addresses the one-commodity pickup and delivery traveling salesman problem (1-PDTSP), which is a generalization of the well-known traveling salesman problem. The 1-PDTSP aims to find a Hamiltonian tour in which a set of… read more here.
Keywords: salesman problem; problem; delivery; one commodity ... See more keywords
The traveling salesman problem on grids with forbidden neighborhoods
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-017-0119-z
Abstract: We introduce the traveling salesman problem with forbidden neighborhoods (TSPFN). This is an extension of the Euclidean TSP in the plane where direct connections between points that are too close are forbidden. The TSPFN is… read more here.
Keywords: salesman problem; forbidden neighborhoods; problem grids; traveling salesman ... See more keywords
Weighted amplifiers and inapproximability results for Travelling Salesman problem
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-020-00659-0
Abstract: The expander graph constructions and their variants are the main tool used in gap preserving reductions to prove approximation lower bounds of combinatorial optimisation problems. In this paper we introduce the weighted amplifiers and weighted… read more here.
Keywords: amplifiers inapproximability; results travelling; salesman problem; weighted amplifiers ... See more keywords
The Anglerfish algorithm: a derivation of randomized incremental construction technique for solving the traveling salesman problem
Sign Up to like & getrecommendations! Published in 2019 at "Evolutionary Intelligence"
DOI: 10.1007/s12065-018-0169-x
Abstract: Combinatorial optimization focuses on arriving at a globally optimal solution given constraints, incomplete information and limited computational resources. The combination of possible solutions are rather vast and often overwhelms the limited computational power. Smart algorithms… read more here.
Keywords: optimization; salesman problem; randomized incremental; construction technique ... See more keywords
Hybrid optimizer for the travelling salesman problem
Sign Up to like & getrecommendations! Published in 2019 at "Evolutionary Intelligence"
DOI: 10.1007/s12065-019-00208-7
Abstract: In this paper, a hybrid model which combines genetic algorithm and heuristics like remove-sharp and local-opt with ant colony system (ACS) has been implemented to speed-up convergence as well as positive feedback and optimizes the… read more here.
Keywords: salesman problem; optimizer travelling; hybrid optimizer; travelling salesman ... See more keywords
A pre-processing reduction method for the generalized travelling salesman problem
Sign Up to like & getrecommendations! Published in 2019 at "Operational Research"
DOI: 10.1007/s12351-019-00533-w
Abstract: The generalized travelling salesman problem (GTSP) is a variant of the well-known travelling salesman problem. The cities are in this case spread into clusters and only one city from each one must be visited to… read more here.
Keywords: reduction; generalized travelling; salesman problem; travelling salesman ... See more keywords