k-interchange procedures for local search in a precedence-constrained routing problem

DOI10.1016/0377-2217(83)90099-1zbMath0505.90045OpenAlexW2117235989MaRDI QIDQ1836590

Harilaos N. Psaraftis

Publication date: 1983

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(83)90099-1

zbMATH Keywords

local searchheuristic algorithmsdepth-firstbreadth-firstk-interchange proceduresprecedence-constrained routing problemsingle vehicle many-to-many Dial-A-Ride problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (20)

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem ⋮ A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Measures of dynamism and urgency in logistics ⋮ A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives ⋮ Routing problems: A bibliography ⋮ The pickup and delivery problem: Faces and branch-and-cut algorithm ⋮ Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities ⋮ A new extension of local search applied to the Dial-A-Ride problem ⋮ Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds ⋮ Scheduling Large-Scale Advance-Request Dial-A-Ride Systems ⋮ Designing granular solution methods for routing problems with time windows ⋮ A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases ⋮ An efficient implementation of local search algorithms for constrained routing problems ⋮ Vehicle routing problems with simultaneous pick-up and delivery service. ⋮ The electric location routing problem with time windows and partial recharging ⋮ A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints ⋮ A genetic algorithm for service level based vehicle scheduling ⋮ A heuristic for the pickup and delivery traveling salesman problem ⋮ A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service ⋮ Efficient feasibility testing for dial-a-ride problems

Cites Work

• Local Search for the Asymmetric Traveling Salesman Problem
• Some Examples of Difficult Traveling Salesman Problems
• An Asymptotic, Probabilistic Analysis of a Routing Problem
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: k-interchange procedures for local search in a precedence-constrained routing problem