k-Interchange procedures for local search in a precedence-constrained routing problem-Reference-Cited by-同舟云学术

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

Published:1983-08 Issue:4 Volume:13 Page:391-402
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Psaraftis Harilaos N.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference14 articles.

1. The state-of-the-art of routing and scheduling of vehicles and crews;Bodin,1981

2. The subscriber Dial-A-Ride problem: The Baltimore, Maryland benchmark;Bodin,1980

3. Mathematical formulations of the Dial-A-Ride problem;Gavish,1980

4. 'Local search for the asymmetric traveling salesman problem;Kanellakis;Operations Res.,1980

5. Computer solutions to the traveling salesman problem;Lin;Bell System Tech. J.,1965

Cited by 61 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem;Transportation Science;2023-03

2. Reinforcement Learning for Practical Express Systems with Mixed Deliveries and Pickups;ACM Transactions on Knowledge Discovery from Data;2023-02-22

3. Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds;Mathematical Programming Computation;2022-12-08

4. Solving pickup and drop-off problem using hybrid pointer networks with deep reinforcement learning;PLOS ONE;2022-05-26

5. Simulationsbasierte Dimensionierung innerbetrieblicher Transportsysteme;Zeitschrift für wirtschaftlichen Fabrikbetrieb;2022-04-01