An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
From MaRDI portal
Publication:3625024
DOI10.1007/978-3-540-70807-0_17zbMath1159.90312OpenAlexW1563136009MaRDI QIDQ3625024
Christian Prins, Mohamed Reghioui, Nacima Labadi
Publication date: 7 May 2009
Published in: Recent Advances in Evolutionary Computation for Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70807-0_17
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Dynamic programming (90C39)
Related Items (5)
Efficient frameworks for greedy split and new depth first search split procedures for routing problems ⋮ Arc routing problems: A review of the past, present, and future ⋮ Crossover iterated local search for SDCARP ⋮ Vehicle routing problems with split deliveries ⋮ Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
This page was built for publication: An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem