An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
From MaRDI portal
Publication:1039783
DOI10.1016/j.ejor.2009.05.015zbMath1175.90345OpenAlexW2045658258WikidataQ58646228 ScholiaQ58646228MaRDI QIDQ1039783
Chris T. Kiranoudis, Emmanouil E. Zachariadis, Christos D. Tarantilis
Publication date: 23 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.015
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (14)
A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot ⋮ A hybrid algorithm for a class of vehicle routing problems ⋮ Route planning for a seaplane service: the case of the Greek islands ⋮ A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ A review of vehicle routing with simultaneous pickup and delivery ⋮ An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup ⋮ A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services ⋮ Local search for the undirected capacitated arc routing problem with profits ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery ⋮ The paired many-to-many pickup and delivery problem: an application ⋮ Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery
Uses Software
Cites Work
- Unnamed Item
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- General solutions to the single vehicle routing problem with pickups and deliveries
- A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- The savings algorithm for the vehicle routing problem
- Heuristics for the traveling salesman problem with pickup and delivery
- Solving the vehicle routing problem with adaptive memory programming methodology
- Future paths for integer programming and links to artificial intelligence
- BoneRoute: An adaptive memory-based method for effective fleet management
- Probabilistic diversification and intensification in local search for vehicle routing
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Solving a vehicle-routing problem arising in soft-drink distribution
- Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
- A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement
- A Method for Solving Traveling-Salesman Problems
- Vehicle routing problem with simultaneous deliveries and pickups
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
This page was built for publication: An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
