A hybrid algorithm for a class of vehicle routing problems (Q336559)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	A hybrid algorithm for a class of vehicle routing problems	scientific article

Statements

scholarly article

A hybrid algorithm for a class of vehicle routing problems (English)

Anand Subramanian

Luiz Satoru Ochi

Computers \& Operations Research

publication date

10 November 2016

zbMATH Keywords

vehicle routing problems

matheuristic

iterated local search

set partitioning

describes a project that uses

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.cor.2013.01.013

A new ILP-based refinement heuristic for vehicle routing problems

A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows

An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems

A general heuristic for vehicle routing problems

A unified heuristic for a large class of vehicle routing problems with backhauls

A unified tabu search heuristic for vehicle routing problems with time windows

A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems

A guide to vehicle routing heuristics

A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem

Probabilistic diversification and intensification in local search for vehicle routing

A hybrid algorithm for the heterogeneous fleet vehicle routing problem

Active-guided evolution strategies for large-scale capacitated vehicle routing problems

Edge assembly-based memetic algorithm for the capacitated vehicle routing problem

A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs

Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems

A variable neighbourhood search algorithm for the open vehicle routing problem

A hybrid evolution strategy for the open vehicle routing problem

An open vehicle routing problem metaheuristic for examining wide solution neighborhoods

A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery

An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup

A simple and effective metaheuristic for the minimum latency problem

Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows

A Method for Solving Traveling-Salesman Problems

Robust branch-and-cut-and-price for the capacitated vehicle routing problem

Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees

The open vehicle routing problem: algorithms, large-scale test problems, and computational results

A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling

An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries

A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service

A tabu search heuristic for periodic and multi-depot vehicle routing problems

A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem

A tabu search heuristic for the multi-depot vehicle routing problem

Identifiers

zbMATH Open document ID

10.1016/j.cor.2013.01.013

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:336559

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q336559&oldid=36286907"