A variable neighborhood search algorithm for the capacitated vehicle routing problem

DOI10.1016/J.ENDM.2017.03.030zbMath1384.90010OpenAlexW2606053784MaRDI QIDQ1687688

Mansour Eddaly, Marwa Amous, Said Toumi, Bassem Jarboui

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.03.030

zbMATH Keywords

vehicle routing problemvariable neighborhood searchvariable neighborhood descentcapacity constraints

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

A novel variable neighborhood strategy adaptive search for SALBP-2 problem with a limit on the number of machine's types

Uses Software

• VRP

Cites Work

• Unnamed Item
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• Variable neighborhood search
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Variable neighborhood search: Principles and applications

This page was built for publication: A variable neighborhood search algorithm for the capacitated vehicle routing problem