An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot
From MaRDI portal
Publication:2357926
DOI10.1007/s11067-015-9297-3zbMath1364.90291MaRDI QIDQ2357926
Binh T. Luong, Satish V. Ukkusuri, Lanshan Han
Publication date: 20 June 2017
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-015-9297-3
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case, Efficient insertion heuristic algorithms for multi-trip inventory routing problem with time windows, shift time limits and variable delivery time, A model of Green acceptance and intentions to use bike-sharing: YouBike users in Taiwan, Branch-and-bound-based local search heuristics for train timetabling on single-track railway network
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
- Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- Planning for agricultural forage harvesters and trucks: model, heuristics, and case study
- On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- The travelling salesman problem with pick-up and delivery
- The traveling salesman problem with delivery and backhauls
- Routing a vehicle of capacity greater than one
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- Integer Programming Formulation of Traveling Salesman Problems
- The swapping problem
- Approximating Capacitated Routing and Delivery Problems
- The Swapping Problem on a Line
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
- The General Pickup and Delivery Problem
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
- The one‐commodity pickup and delivery travelling salesman problem on a path or a tree
- Computer Solutions of the Traveling Salesman Problem