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

From MaRDI portal
Publication:1836590

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




Related Items

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problemA hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problemMeasures of dynamism and urgency in logisticsA heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectivesRouting problems: A bibliographyThe pickup and delivery problem: Faces and branch-and-cut algorithmDesigning sustainable mid-haul logistics networks with intra-route multi-resource facilitiesA new extension of local search applied to the Dial-A-Ride problemMixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of boundsScheduling Large-Scale Advance-Request Dial-A-Ride SystemsDesigning granular solution methods for routing problems with time windowsA multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle casesAn efficient implementation of local search algorithms for constrained routing problemsVehicle routing problems with simultaneous pick-up and delivery service.The electric location routing problem with time windows and partial rechargingA fast heuristic for solving a large-scale static dial-a-ride problem under complex constraintsA genetic algorithm for service level based vehicle schedulingA heuristic for the pickup and delivery traveling salesman problemA tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery serviceEfficient feasibility testing for dial-a-ride problems



Cites Work