A threshold accepting approach to the Open Vehicle Routing problem

DOI10.1051/RO:2004029MaRDI QIDQ5693012zbMATH OpenOpenAlexFDO

Authors Christos D. Tarantilis, Chris T. Kiranoudis, George Ioannou, Gregory P. Prastacos

Publication date 28 September 2005

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=RO_2004__38_4_345_0, http://www.numdam.org/item?id=RO_2004__38_4_345_0/, https://eudml.org/doc/105319

zbMATH Keywords

logisticsvehicle routingDistribution

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Recommendations

• A Backtracking Adaptive Threshold Accepting Algorithm for the Vehicle Routing Problem
• A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• The open vehicle routing problem with decoupling points
• A heuristic method for the open vehicle routing problem
• A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
• A threshold accepting metaheuristic for the vehicle routing problem with time windows.
• A matheuristic for the MinMax capacitated open vehicle routing problem
• A tabu search algorithm for the open vehicle routing problem
• The open vehicle routing problem with time windows

Cites work

• scientific article; zbMATH DE number 3643061 (Why is no real title available?)
• scientific article; zbMATH DE number 3918092 (Why is no real title available?)
• scientific article; zbMATH DE number 192876 (Why is no real title available?)
• scientific article; zbMATH DE number 1452993 (Why is no real title available?)
• A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A guide to vehicle routing heuristics
• A heuristic method for the open vehicle routing problem
• A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
• A tabu search algorithm for the open vehicle routing problem
• A threshold accepting metaheuristic for the vehicle routing problem with time windows.
• BoneRoute: An adaptive memory-based method for effective fleet management
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• New heuristics for the vehicle routing problem
• Optimization by simulated annealing
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing

Cited in

(10)

• A hybrid evolution strategy for the open vehicle routing problem
• Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading
• Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
• The open vehicle routing problem with decoupling points
• A tabu search algorithm with controlled randomization for constructing feasible university course timetables
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• A simulated annealing heuristic for the open location-routing problem
• A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
• An ILP improvement procedure for the open vehicle routing problem
• An open vehicle routing problem metaheuristic for examining wide solution neighborhoods

Describes a project that uses

Uses Software

• BoneRoute
• VRP

This page was built for publication: A threshold accepting approach to the Open Vehicle Routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5693012)