The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands

DOI10.1016/J.COR.2020.104949MaRDI QIDQ2664291zbMATH OpenOpenAlexWikidataFDO

Authors J. Buckow, Benjamin Graf, Sigrid Knust

Publication date 20 April 2021

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2020.104949

zbMATH Keywords

exponential neighborhoodunit demandsvehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An exponential (matching based) neighborhood for the vehicle routing problem
• A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem
• scientific article; zbMATH DE number 2102229
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
• An integer linear programming local search for capacitated vehicle routing problems

Cites work

• A branch-and-cut algorithm for vehicle routing problems
• A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
• A survey of very large-scale neighborhood search techniques
• An exponential (matching based) neighborhood for the vehicle routing problem
• An exponential neighborhood for a one-machine batching problem
• An open source spreadsheet solver for vehicle routing problems
• Creating very large scale neighborhoods out of smaller ones by compounding moves
• Exponential neighbourhood local search for the traveling salesman problem
• Fast local search algorithms for the handicapped persons transportation problem
• Handbooks in operations Research \& management science: Transportation
• Heuristics for the black and white traveling salesman problem
• scientific article; zbMATH DE number 3643061 (Why is no real title available?)
• scientific article; zbMATH DE number 1452993 (Why is no real title available?)
• New benchmark instances for the capacitated vehicle routing problem
• Node, edge, arc routing and turn penalties: multiple problems -- one neighborhood extension
• Polyhedral results for a vehicle routing problem
• Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
• Reducibility among combinatorial problems
• Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
• The Black and White Traveling Salesman Problem
• The four-day aircraft maintenance routing problem
• The traveling salesman problem: new polynomial approximation algorithms and domination analysis
• The vehicle routing problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• TSPLIB—A Traveling Salesman Problem Library
• Two very large-scale neighborhoods for single machine scheduling

Cited in

(1)

• An exponential (matching based) neighborhood for the vehicle routing problem

Describes a project that uses

Uses Software

• TSPLIB
• VRP
• LEMON

This page was built for publication: The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands

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