We have collected information about Heuristics For The One-Commodity Pickup-And-Delivery Traveling Salesman Problem for you. Follow the links to find out details on Heuristics For The One-Commodity Pickup-And-Delivery Traveling Salesman Problem.
https://pubsonline.informs.org/doi/10.1287/trsc.1030.0086
This paper deals with a generalisation of the well-known traveling salesman problem (TSP) in which cities correspond to customers providing or requiring known amounts of a product, and the vehicle has a given upper limit capacity. Each customer must be visited exactly once by the vehicle serving the demands while minimising the total travel distance.Author: Hipólito Hernández-Pérez, Juan-José Salazar-González
https://ideas.repec.org/a/inm/ortrsc/v38y2004i2p245-255.html
This problem is called one-commodity pickup-and-delivery TSP (1-PDTSP). We propose two heuristic approaches for the problem: (1) is based on a greedy algorithm and improved with a k -optimality criterion and (2) is based on a branch-and-cut procedure for finding an optimal local solution.Author: Hipólito Hernández-Pérez, Juan-José Salazar-González
https://www.sciencedirect.com/science/article/pii/S0360835208002751
In this paper, we proposed a genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. In the proposed algorithm, we designed a new tour constructing heuristic to generate the initial population, and proposed a novel pheromone-based crossover operator that utilizes both local and global information to construct offspring.Author: Fanggeng Zhao, Sujian Li, Jiangsheng Sun, Dong Mei
https://www.sciencedirect.com/science/article/pii/S0305054818301072
1. Introduction. The Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem (SD1PDTSP) combines three vehicle routing problems. The first one is the Capacitated Vehicle Routing Problem (CVRP), aimed at designing the routes for a vehicle fleet to deliver a commodity from the depot to a set of customers. Each route starts and ends at the depot, and the load of a vehicle ...Author: Hipólito Hernández-Pérez, Juan José Salazar-González, Beatriz Santos-Hernández
https://trid.trb.org/view/701548
HEURISTICS FOR THE ONE-COMMODITY PICKUP-AND-DELIVERY TRAVELING SALESMAN PROBLEM. This paper presents two heuristic algorithms for a generalization of the well-known traveling salesman problem (TSP) called one-commodity pickup-and-delivery TSP.
https://www.researchgate.net/publication/220413201_Heuristics_for_the_One-Commodity_Pickup-and-Delivery_Traveling_Salesman_Problem
Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem. ... Heuristics for the Traveling Salesman Problem. ... called the pickup and delivery traveling salesman prob-lem ...
https://dl.acm.org/doi/10.1016/j.cie.2008.10.014
In this paper, we proposed a genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. In the proposed algorithm, we designed a new tour constructing heuristic to generate the initial population, and proposed a novel pheromone-based crossover operator that utilizes both local and global information to construct offspring.Author: ZhaoFanggeng, LiSujian, SunJiangsheng, MeiDong
https://www.academia.edu/10903903/Heuristics_for_the_One-Commodity_Pickup-and-Delivery_Traveling_Salesman_Problem
Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem
https://www.jstor.org/stable/25769195
Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem Hipolito Hernandez-Perez, Juan-Jose Salazar-Gonzalez DEIOC, Facultad de Matematicas, Universidad de La Laguna, 38271 La Laguna, Tenerife, Spain {[email protected], [email protected]}
https://link.springer.com/chapter/10.1007/3-540-36478-1_10
Jan 30, 2003 · The new problem is called “one-commodity Pickup-and-Delivery TSP” (1-PDTSP). We introduce a 0-1 Integer Linear Programming model for the 1-PDTSP and describe a simple branch-and-cut procedure for finding an optimal solution. The proposal can be easily adapted for the classical “TSP with Pickup-and- Delivery” (PDTSP).Author: Hipólito Hernández-Pérez, Juan-José Salazar-González
Searching for Heuristics For The One-Commodity Pickup-And-Delivery Traveling Salesman Problem?
You can just click the links above. The data is collected for you.
