k-interchange procedures for local search in a precedence-constrained routing problem
From MaRDI portal
Publication:1836590
DOI10.1016/0377-2217(83)90099-1zbMath0505.90045MaRDI QIDQ1836590
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
local search; heuristic algorithms; depth-first; breadth-first; k-interchange procedures; precedence-constrained routing problem; single vehicle many-to-many Dial-A-Ride problem
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Related Items
An efficient implementation of local search algorithms for constrained routing problems, A genetic algorithm for service level based vehicle scheduling, The pickup and delivery problem: Faces and branch-and-cut algorithm, A new extension of local search applied to the Dial-A-Ride problem, A heuristic for the pickup and delivery traveling salesman problem, Efficient feasibility testing for dial-a-ride problems, A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives, Routing problems: A bibliography, Vehicle routing problems with simultaneous pick-up and delivery service., A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints, A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service, Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
Cites Work
