Optimal routing of multiple-load AGV subject to LIFO loading constraints

From MaRDI portal
Publication:1869912

DOI10.1016/S0305-0548(01)00106-XzbMath1029.90012MaRDI QIDQ1869912

Gregory Levitin, R. Abezgaouz

Publication date: 28 April 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)




Related Items (16)

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraintsThe pickup and delivery problem with time windows, multiple stacks, and handling operationsA hybrid approach for the vehicle routing problem with three-dimensional loading constraintsFormulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacksA branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacksMultiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraintsValid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacksAn Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO LoadingNew formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacksRecent Models and Algorithms for One-to-One Pickup and Delivery ProblemsLarge neighborhood search for the pickup and delivery traveling salesman problem with multiple stacksVehicle routing problems with loading constraints: state-of-the-art and future directionsA branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loadingThe pickup and delivery traveling salesman problem with first-in-first-out loadingThe stack loading and unloading problemSurvey of research in the design and control of automated guided vehicle systems




Cites Work




This page was built for publication: Optimal routing of multiple-load AGV subject to LIFO loading constraints