A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem

DOI10.1016/j.ejor.2020.01.008zbMath1441.90020OpenAlexW2999840680WikidataQ126360670 ScholiaQ126360670MaRDI QIDQ2178077

José Brandão

Publication date: 7 May 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.01.008

zbMATH Keywords

transportationvehicle routingmemoryiterated local searchmulti-depot

Mathematics Subject Classification ID

Search theory (90B40) Transportation, logistics and supply chain management (90B06)

Related Items (11)

Hybrid search with neighborhood reduction for the multiple traveling salesman problem ⋮ Vehicle routing for milk collection with gradual blending: a case arising in Chile ⋮ An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem ⋮ An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order ⋮ Crowdsourced humanitarian relief vehicle routing problem ⋮ A general VNS for the multi-depot open vehicle routing problem with time windows ⋮ Enhanced iterated local search for the technician routing and scheduling problem ⋮ Integrating micro-depot freight transport in existing public transport services ⋮ Mathematical formulations and improvements for the multi-depot open vehicle routing problem ⋮ Scheduling heterogeneous delivery tasks on a mixed logistics platform

Uses Software

• VRP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A multi-start algorithm for a balanced real-world open vehicle routing problem
• A tabu search algorithm for the open vehicle routing problem
• A general heuristic for vehicle routing problems
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
• A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
• The open vehicle routing problem with decoupling points
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
• A variable neighbourhood search algorithm for the open vehicle routing problem
• A unified exact method for solving different classes of vehicle routing problems
• A hybrid genetic algorithm for the multi-depot open vehicle routing problem
• Integrating multi-product production and distribution in newspaper logistics
• A unified solution framework for multi-attribute vehicle routing problems
• A heuristic method for the open vehicle routing problem
• A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• The school bus routing problem: a case study
• Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
• An improved formulation for the multi-depot open vehicle routing problem

This page was built for publication: A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem