hybrid method – Optimization Online

Heuristic approaches for split delivery vehicle routing problems

Published: 2022/02/08

Branch and Cut Algorithms, Meta Heuristics, Transportation hybrid method, iterated local search, matheuristic, split-delivery, vehicle routing

We propose a matheuristic approach to solve split delivery variants of the vehicle routing problem (VRP). The proposed method is based on the use of several mathematical programming components within an Iterated Local Search metaheuristic framework. In addition to well-known VRP local search heuristics, we include new types of improvement and perturbation strategies that are … Read more

Data-compatibility of algorithms

Published: 2019/11/26, Updated: 2020/10/23

Yair Censor

Maroun Zaknoon

Alexander J. Zaslavski

Constrained Nonlinear Optimization, Convex Optimization common fixed points, constrained convex minimization, data-compatiblity, fixed point sets, hybrid method, nonexpansive operators, proximity function, string-averaging, subgradient

The data-compatibility approach to constrained optimization, proposed here, strives to a point that is “close enough” to the solution set and whose target function value is “close enough” to the constrained minimum value. These notions can replace analysis of asymptotic convergence to a solution point of infinite sequences generated by specific algorithms. We consider a … Read more