A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
From MaRDI portal
Publication:322620
DOI10.1016/J.EJOR.2015.10.053zbMath1346.90124OpenAlexW1882270187MaRDI QIDQ322620
Juan-José Salazar-González, Hipólito Hernández-Pérez, Inmaculada Rodríguez-Martín
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.10.053
Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ Coordinating technician allocation and maintenance routing for offshore wind farms ⋮ An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem ⋮ Hybrid evolutionary search for the traveling repairman problem with profits
Cites Work
- A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases
- Kernel search: an application to the index tracking problem
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- An empirical study on the benefit of split loads with the pickup and delivery problem
- The travelling salesman problem with pick-up and delivery
- k-interchange procedures for local search in a precedence-constrained routing problem
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- An efficient transformation of the generalized vehicle routing problem
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- Bike sharing systems: solving the static rebalancing problem
- First vs. best improvement: an empirical study
- The multi-commodity pickup-and-delivery traveling salesman problem
- Approximating Capacitated Routing and Delivery Problems
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
- Vehicle routing problems with split deliveries
- A branch‐and‐cut algorithm for the nonpreemptive swapping problem
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
- Variable neighborhood search: Principles and applications
This page was built for publication: A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
