Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension

DOI10.1287/opre.2017.1595zbMath1378.90031OpenAlexW2616101379MaRDI QIDQ5360839

Thibaut Vidal

Publication date: 26 September 2017

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2017.1595

zbMATH Keywords

heuristicslocal searcharc routinglarge neighborhoodsgeneral routingturn penaltiesservice clustersstructural problem decomposition

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Related Items (17)

Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition ⋮ The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands ⋮ The commodity-split multi-compartment capacitated arc routing problem ⋮ A dynamic multi-period general routing problem arising in postal service and parcel delivery systems ⋮ Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows ⋮ Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows ⋮ Heuristics for vehicle routing problems: sequence or set optimization? ⋮ Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ Routing a mix of conventional, plug-in hybrid, and electric vehicles ⋮ Large multiple neighborhood search for the clustered vehicle-routing problem ⋮ A simple and effective hybrid genetic search for the job sequencing and tool switching problem ⋮ A tailored Benders decomposition approach for last-mile delivery with autonomous robots

This page was built for publication: Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension